Publications
Publications
Show Results For
- All HBS Web
(12)
- Faculty Publications (7)
Page 1 of 7
Results
- 2023
- Working Paper
An Experimental Design for Anytime-Valid Causal Inference on Multi-Armed Bandits
By: Biyonka Liang and Iavor I. Bojinov
Typically, multi-armed bandit (MAB) experiments are analyzed at the end of the study and thus require the analyst to specify a fixed sample size in advance. However, in many online learning applications, it is advantageous to continuously produce inference on the... View Details
- 2023
- Article
Balancing Risk and Reward: An Automated Phased Release Strategy
By: Yufan Li, Jialiang Mao and Iavor Bojinov
Phased releases are a common strategy in the technology industry for gradually releasing new products or updates through a sequence of A/B tests in which the number of treated units gradually grows until full deployment or deprecation. Performing phased releases in a... View Details
- 2022
- Article
Towards Robust Off-Policy Evaluation via Human Inputs
By: Harvineet Singh, Shalmali Joshi, Finale Doshi-Velez and Himabindu Lakkaraju
Off-policy Evaluation (OPE) methods are crucial tools for evaluating policies in high-stakes domains such as healthcare, where direct deployment is often infeasible, unethical, or expensive. When deployment environments are expected to undergo changes (that is, dataset... View Details
- 2021
- Article
Fair Algorithms for Infinite and Contextual Bandits
By: Matthew Joseph, Michael J Kearns, Jamie Morgenstern, Seth Neel and Aaron Leon Roth
We study fairness in linear bandit problems. Starting from the notion of meritocratic fairness introduced in Joseph et al. [2016], we carry out a more refined analysis of a more general problem, achieving better performance guarantees with fewer modelling assumptions... View Details
- November–December 2018
- Article
Online Network Revenue Management Using Thompson Sampling
By: Kris J. Ferreira, David Simchi-Levi and He Wang
We consider a network revenue management problem where an online retailer aims to maximize revenue from multiple products with limited inventory constraints. As common in practice, the retailer does not know the consumer's purchase probability at each price and must... View Details
- Article
Mitigating Bias in Adaptive Data Gathering via Differential Privacy
By: Seth Neel and Aaron Leon Roth
Data that is gathered adaptively—via bandit algorithms, for example—exhibits bias. This is true both when gathering simple numeric valued data—the empirical means kept track of by stochastic bandit algorithms are biased downwards—and when gathering more complicated... View Details
- 18 Nov 2016
- Conference Presentation
Rawlsian Fairness for Machine Learning
By: Matthew Joseph, Michael J. Kearns, Jamie Morgenstern, Seth Neel and Aaron Leon Roth
Motivated by concerns that automated decision-making procedures can unintentionally lead to discriminatory behavior, we study a technical definition of fairness modeled after John Rawls' notion of "fair equality of opportunity". In the context of a simple model of... View Details