Fetching the paper…
Reading the bibliography…
Stochastic linear bandits with high-dimensional sparse features are a practical model for a variety of domains, including personalized medicine and online advertising.
Regression shrinkage and selection via the lasso
R. Tibshirani · 1996
Earlier work this paper cites.
Using confidence bounds for exploitation-exploration trade-offs
Peter Auer · 2002
Earlier work this paper cites.
Convex optimization
Stephen Boyd, Stephen P Boyd, and Lieven Vandenberghe · 2004
Earlier work this paper cites.
Stochastic linear optimization under bandit feedback
Varsha Dani, Thomas P Hayes, and Sham M Kakade · 2008
Earlier work this paper cites.
Introduction to Nonparametric Estimation
Alexandre B. Tsybakov · 2008
Earlier work this paper cites.
Simultaneous analysis of lasso and dantzig selector
Peter J Bickel, Ya’acov Ritov, Alexandre B Tsybakov, et al · 2009
Earlier work this paper cites.
Linearly parameterized bandits
Paat Rusmevichientong and John N Tsitsiklis · 2010
Earlier work this paper cites.
Introduction to the non-asymptotic analysis of random matrices
Roman Vershynin · 2010
Earlier work this paper cites.
Improved algorithms for linear stochastic bandits
Yasin Abbasi-Yadkori, Dávid Pál, and Csaba Szepesvári · 2011
Earlier work this paper cites.
Statistics for high-dimensional data: methods, theory and applications
Peter Bühlmann and Sara Van De Geer · 2011
Earlier work this paper cites.
Contextual bandits with linear payoff functions
Wei Chu, Lihong Li, Lev Reyzin, and Robert Schapire · 2011
Earlier work this paper cites.
Minimax rates of estimation for high-dimensional linear regression over
G. Raskutti, M. J. Wainwright, and B. Yu · 2011
Earlier work this paper cites.
Online-to-confidence-set conversions and application to sparse stochastic bandits
Yasin Abbasi-Yadkori, David Pal, and Csaba Szepesvari · 2012
Cited alongside, same era.
Bandit theory meets compressed sensing for high dimensional stochastic linear bandit
Alexandra Carpentier and Rémi Munos · 2012
Cited alongside, same era.
Linear bandits in high dimension and recommendation systems
Yash Deshpande and Andrea Montanari · 2012
Cited alongside, same era.
Thompson sampling for contextual bandits with linear payoffs
Shipra Agrawal and Navin Goyal · 2013
Cited alongside, same era.
Least squares after model selection in high-dimensional sparse models
Alexandre Belloni, Victor Chernozhukov, et al · 2013
Cited alongside, same era.
Reconstruction from anisotropic random measurements
Mark Rudelson and Shuheng Zhou · 2013
The end of optimism? an asymptotic analysis of finite-armed linear bandits
Tor Lattimore and Csaba Szepesvari · 2017
Later among the works it cites.
Simple regret minimization for contextual bandits
Aniket Anand Deshmukh, Srinagesh Sharma, James W Cutler, Mark Moldwin, and Clayton Scott · 2018
Later among the works it cites.
Debiasing the lasso: Optimal sample size for gaussian designs
Adel Javanmard, Andrea Montanari, et al · 2018
Later among the works it cites.
Minimax concave penalized multi-armed bandit model with high-dimensional covariates
Xue Wang, Mingcheng Wei, and Tao Yao · 2018
Later among the works it cites.
Doubly-robust lasso bandit
Gi-Soo Kim and Myunghee Cho Paik · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Partial monitoring—classification, regret bounds, and algorithms
G. Bartók, D. P. Foster, D. Pál, A. Rakhlin, and Cs. Szepesvári · 2014
Cited alongside, same era.
Confidence intervals and hypothesis testing for high-dimensional regression
Adel Javanmard and Andrea Montanari · 2014
Cited alongside, same era.
Learning to optimize via posterior sampling
Daniel Russo and Benjamin Van Roy · 2014
Cited alongside, same era.
Linear multi-resource allocation with semi-bandit feedback
Tor Lattimore, Koby Crammer, and Csaba Szepesvári · 2015
Cited alongside, same era.
Cvxpy: A python-embedded modeling language for convex optimization
Steven Diamond and Stephen Boyd · 2016
Cited alongside, same era.
Minimal exploration in structured stochastic bandits
Richard Combes, Stefan Magureanu, and Alexandre Proutiere · 2017
Cited alongside, same era.
Martin J Wainwright · 2019
Later among the works it cites.
Online decision making with high-dimensional covariates
Hamsa Bastani and Mohsen Bayati · 2020
Closest in time.
Adaptive exploration in linear contextual bandit
Botao Hao, Tor Lattimore, and Csaba Szepesvari · 2020
Closest in time.
Bandit algorithms
Tor Lattimore and Csaba Szepesvári · 2020
Closest in time.
Learning with good feature representations in bandits and in rl with a generative model
Tor Lattimore, Csaba Szepesvari, and Gellert Weisz · 2020
Closest in time.
Structured linear contextual bandits: A sharp and geometric smoothed analysis
Vidyashankar Sivakumar, Zhiwei Steven Wu, and Arindam Banerjee · 2020
Closest in time.