The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
Online Decision Making with High-Dimensional Covariates
Abstract
Decision-makers increasingly have access to rich customer-specific data, providing an opportunity to make better, personalized service decisions. For example, in healthcare, doctors can personalize interventions based on a patient’s clinical history; in marketing, companies can target ads based on customer purchase history. However, the increased variety of potentially relevant customer data implies that an individual’s covariates may be high dimensional, which, in turn, poses statistical challenges for learning personalized decision-making policies. In “Online Decision-Making with High-Dimensional Covariates,” H. Bastani and M. Bayati introduce the LASSO Bandit, an adaptive decision-making algorithm that efficiently leverages high-dimensional user covariates by learning sparse models of decision rewards. The authors illustrate the practical relevance of such an approach by evaluating it against a personalized medication dosing problem, finding that the LASSO Bandit outperforms existing bandit methods and physicians in correctly dosing a majority of patients.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
An Introduction to the Bootstrap
Efron, B., & Tibshirani, R. J. (1994) · doi:10.1201/9780429246593 · Cited by 40,500
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
An Introduction to the Bootstrap
Efron, B., & Tibshirani, R. J. (1993) · doi:10.1007/978-1-4899-4541-9 · Cited by 21,230
Advances in Neural Information Processing Systems 25
Zhang, Y., Sutton, C. A., Storkey, A., & Zoubin Ghahramani, A. (2012) · Cited by 12,653
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596304010 · Cited by 6,845
Spencer, J. (1991) · Medical Entomology and Zoology · Cited by 4,310
Simultaneous analysis of Lasso and Dantzig selector
Bickel, P. J., Ritov, Y., & Tsybakov, A. B. (2009) · The Annals of Statistics · doi:10.1214/08-aos620 · Cited by 2,396
The Dantzig selector: Statistical estimation when p is much larger than n
Candes, E., & Tao, T. (2007) · The Annals of Statistics · doi:10.1214/009053606000001523 · Cited by 1,747
Statistics for High-Dimensional Data: Methods, Theory and Applications
Bühlmann, P., & van de Geer, S. (2011) · Springer Series in Statistics · doi:10.1007/978-3-642-20192-9 · Cited by 1,680
Inference on Treatment Effects after Selection among High-Dimensional Controls
Belloni, A., Chernozhukov, V., & Hansen, C. (2014) · The Review of Economic Studies · doi:10.1093/restud/rdt044 · Cited by 1,508
Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
Bubeck, S. (2012) · now publishers, Inc. eBooks · doi:10.1561/9781601986276 · Cited by 1,404
Using confidence bounds for exploitation-exploration trade-offs
Auer, P. L. (2003) · Journal of Machine Learning Research · doi:10.5555/944919.944941 · Cited by 1,229
Improved Algorithms for Linear Stochastic Bandits
Abbasi-Yadkori, Y., Pál, D., & Szepesvári, C. (2011) · Cited by 919
National Surveillance of Emergency Department Visits for Outpatient Adverse Drug Events
Budnitz, D. S., Pollock, D. A., Weidenbach, K. N., Mendelsohn, A. B., Schroeder, T. J., & Annest, J. L. (2006) · JAMA · doi:10.1001/jama.296.15.1858 · Cited by 893
The BATTLE Trial: Personalizing Therapy for Lung Cancer
Kim, E. S., Herbst, R. S., Wistuba, I. I., Lee, J. J., Blumenschein, G. R., Tsao, A., Stewart, D. J., Hicks, M. E., Erasmus, J., Gupta, S., et al. (2011) · Cancer Discovery · doi:10.1158/2159-8274.cd-10-0010 · Cited by 889
Exponentiated Gradient versus Gradient Descent for Linear Predictors
Kivinen, J., & Warmuth, M. K. (1997) · Information and Computation · doi:10.1006/inco.1996.2612 · Cited by 864
An Introduction to Matrix Concentration Inequalities
Tropp, J. A. (2015) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000048 · Cited by 792
From Predictive to Prescriptive Analytics
Bertsimas, D., & Kallus, N. (2020) · Management Science · doi:10.1287/mnsc.2018.3253 · Cited by 784
High-Dimensional Statistics: A Non-Asymptotic Viewpoint
Wainwright, M. J. (2019) · Cited by 651
Contextual Bandits with Linear Payoff Functions
Chu, W., Li, L. C., Reyzin, L., & Schapire, R. E. (2011) · Cited by 633
Optimal aggregation of classifiers in statistical learning
Tsybakov, A. B. (2004) · The Annals of Statistics · doi:10.1214/aos/1079120131 · Cited by 582
(2008) · ScholarlyCommons (University of Pennsylvania) · Cited by 581
Learning to Optimize via Posterior Sampling
Russo, D., & Van Roy, B. (2014) · Mathematics of Operations Research · doi:10.1287/moor.2014.0650 · Cited by 493
The Epoch-Greedy Algorithm for Multi-armed Bandits with Side Information
Langford, J. C., & Zhang, T. (2007) · Rare & Special e-Zone (The Hong Kong University of Science and Technology) · Cited by 446
Linearly Parameterized Bandits
Rusmevichientong, P., & Tsitsiklis, J. N. (2010) · Mathematics of Operations Research · doi:10.1287/moor.1100.0446 · Cited by 427
A Unified Framework for High-Dimensional Analysis of $M$-Estimators with Decomposable Regularizers
Negahban, S. N., Ravikumar, P., Wainwright, M. J., & Yu, B. (2012) · Statistical Science · doi:10.1214/12-sts400 · Cited by 287
Contextual Bandits with Similarity Information
Slivkins, A. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0907.3986 · Cited by 232
Population-Level Prediction of Type 2 Diabetes From Claims Data and Analysis of Risk Factors
Razavian, N., Blecker, S., Schmidt, A. M., Smith-McLallen, A., Nigam, S., & Sontag, D. (2015) · Big Data · doi:10.1089/big.2015.0020 · Cited by 212
The multi-armed bandit problem with covariatesPreprint
Perchet, V. (n.d.) · Cited by 160
Coupled Group Lasso for Web-Scale CTR Prediction in Display Advertising
Yan, L., Li, W.-J., Xue, G.-R., & Han, D. (2014) · International Conference on Machine Learning · Cited by 145
The multi-armed bandit problem with covariates
Perchet, V., & Rigollet, P. (2013) · The Annals of Statistics · doi:10.1214/13-aos1101 · Cited by 136
Bayati, M., Braverman, M., Gillam, M., Mack, K. M., Ruiz, G., Smith, M. S., & Horvitz, E. (2014) · PLoS ONE · doi:10.1371/journal.pone.0109264 · Cited by 122
Self-citationNonparametric Bandits with CovariatesPreprint
Rigollet, P., & Zeevi, A. J. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1003.1630 · Cited by 120
A Linear Response Bandit Problem
Goldenshluger, A., & Zeevi, A. J. (2013) · Stochastic Systems · doi:10.1287/11-ssy032 · Cited by 104
Online Learning for Linearly Parametrized Control Problems
Abbasi-Yadkori, Y. (2013) · ERA: Education and Research Archive (University of Alberta) · doi:10.7939/r3h418 · Cited by 96
He, B., Dexter, F., Macario, A., & Zenios, S. A. (2011) · Manufacturing & Service Operations Management · doi:10.1287/msom.1110.0350 · Cited by 91
The Big Data Newsvendor: Practical Insights from Machine LearningPreprint
Ban, G., & Rudin, C. D. (2015) · SSRN Electronic Journal · doi:10.2139/ssrn.2559116 · Cited by 90
Regional surveillance of emergency-department visits for outpatient adverse drug events
Capuano, A., Irpino, A., Gallo, M., Ferrante, L., Illiano, M. L., Rinaldi, B., Filippelli, A., & Rossi, F. (2009) · European Journal of Clinical Pharmacology · doi:10.1007/s00228-009-0641-8 · Cited by 53
Challenges and opportunities in high-dimensional choice data analyses
Naik, P. A., Wedel, M., Bacon, L., Bodapati, A. V., Bradlow, E. T., Kamakura, W. A., Kreulen, J. T., Lenk, P., Madigan, D., & Montgomery, A. L. (2008) · Marketing Letters · doi:10.1007/s11002-008-9036-3 · Cited by 52
An unbiased offline evaluation of contextual bandit algorithms with generalized linear models
Li, L., Chu, W., Langford, J. C., Moon, T., & Wang, X. (2011) · Cited by 52
Woodroofe’s one-armed bandit problem revisited
Goldenshluger, A., & Zeevi, A. J. (2009) · The Annals of Applied Probability · doi:10.1214/08-aap589 · Cited by 48
Cited by
Lattimore, T., & Szepesvári, C. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108571401 · Cited by 976
Metadata
- Authors
- Bastani, H., & Bayati, M.
- Venue
- Operations Research
- Published
- 2020-01
- Volume
- 68
- Issue
- 1
- Pages
- 276-294
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W3124121179
- Cited by
- 263
- References
- 43
- FWCI
- 30.05
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.