Fetching the paper…
Reading the bibliography…
We study the best-arm identification problem in sparse linear bandits under the fixed-budget setting.
On the likelihood that one unknown probability exceeds another in view of the evidence of two samples
William R Thompson · 1933
Earlier work this paper cites.
Some aspects of the sequential design of experiments
Herbert Robbins · 1952
Earlier work this paper cites.
The equivalence of two extremum problems
J. Kiefer and J. Wolfowitz · 1960
Earlier work this paper cites.
Regression shrinkage and selection via the Lasso
Robert 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
S. Boyd and L. Vandenberghe · 2004
Earlier work this paper cites.
Yalmip: A toolbox for modeling and optimization in MATLAB
J. Löfberg · 2004
Earlier work this paper cites.
Action elimination and stopping conditions for the multi-armed bandit and reinforcement learning problems
Eyal Even-Dar, Shie Mannor, and Yishay Mansour · 2006
Earlier work this paper cites.
Optimal Design of Experiments
Friedrich Pukelsheim · 2006
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.
On the conditions used to prove oracle results for the Lasso
Sara A. van de Geer and Peter Bühlmann · 2009
Earlier work this paper cites.
Thresholding procedures for high dimensional variable selection and statistical estimation
Shuheng Zhou · 2009
Earlier work this paper cites.
Best arm identification in multi-armed bandits
Jean-Yves Audibert and Sébastien Bubeck · 2010
Earlier work this paper cites.
Distributed optimization and statistical learning via the alternating direction method of multipliers
Stephen Boyd, Neal Parikh, Eric Chu, Borja Peleato, and Jonathan Eckstein · 2011
Earlier work this paper cites.
Statistics for high-dimensional data
Peter Bühlmann and Sara A. van de Geer · 2011
Cited alongside, same era.
Online-to-confidence-set conversions and application to sparse stochastic bandits
Yasin Abbasi-Yadkori, David Pal, and Csaba Szepesvari · 2012
Cited alongside, same era.
Regret analysis of stochastic and nonstochastic multi-armed bandit problems
Sébastien Bubeck and Nicolo Cesa-Bianchi · 2012
Cited alongside, same era.
CVX: Matlab software for disciplined convex programming, version 2.0
M. Grant and S. Boyd · 2012
Cited alongside, same era.
Almost optimal exploration in multi-armed bandits
Zohar Karnin, Tomer Koren, and Oren Somekh · 2013
Cited alongside, same era.
On correlation and budget constraints in model-based bandit optimization with application to automatic machine learning
Matthew Hoffman, Bobak Shahriari, and Nando Freitas · 2014
High-dimensional sparse linear bandits
Botao Hao, Tor Lattimore, and Mengdi Wang · 2020
Later among the works it cites.
Optimal best-arm identification in linear bandits
Yassir Jedra and Alexandre Proutiere · 2020
Later among the works it cites.
An empirical process approach to the union bound: Practical algorithms for combinatorial and linear bandits
Julian Katz-Samuels, Lalit Jain, Zohar Karnin, and Kevin G Jamieson · 2020
Later among the works it cites.
Robust pure exploration in linear bandits with limited budget
Ayya Alieva, Ashok Cutkosky, and Abhimanyu Das · 2021
Later among the works it cites.
Sparsity-agnostic lasso bandit
Min-Hwan Oh, Garud Iyengar, and Assaf Zeevi · 2021
Later among the works it cites.
Thresholded Lasso bandit
Kaito Ariu, Kenshi Abe, and Alexandre Proutiere · 2022
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.
Best-arm identification in linear bandits
Marta Soare, Alessandro Lazaric, and Remi Munos · 2014
Cited alongside, same era.
Tight (lower) bounds for the fixed budget best arm identification bandit problem
Alexandra Carpentier and Andrea Locatelli · 2016
Cited alongside, same era.
On the complexity of best arm identification in multi-armed bandit models
Emilie Kaufmann, Olivier Cappé, and Aurélien Garivier · 2016
Cited alongside, same era.
Best arm identification in linear bandits with linear dimension dependency
Chao Tao, Saúl Blanco, and Yuan Zhou · 2018
Cited alongside, same era.
A fully adaptive algorithm for pure exploration in linear bandits
Liyuan Xu, Junya Honda, and Masashi Sugiyama · 2018
Cited alongside, same era.
Sequential experimental design for transductive linear bandits
Tanner Fiez, Lalit Jain, Kevin G Jamieson, and Lillian Ratliff · 2019
Cited alongside, same era.
Fixed-budget best-arm identification in structured bandits
MohammadJavad Azizi, Branislav Kveton, and Mohammad Ghavamzadeh · 2022
Later among the works it cites.
Popart: Efficient sparse regression and experimental design for optimal sparse linear bandits
Kyoungseok Jang, Chicheng Zhang, and Kwang-Sung Jun · 2022
Later among the works it cites.
A simple unified framework for high dimensional bandit problems
Wenjie Li, Adarsh Barik, and Jean Honorio · 2022
Later among the works it cites.
Minimax optimal fixed-budget best arm identification in linear bandits
Junwen Yang and Vincent Y. F. Tan · 2022
Later among the works it cites.
Improved pure exploration in linear bandits with no-regret learning
Mohammadi Zaki, Avi Mohan, and Aditya Gopalan · 2022
Later among the works it cites.
Thompson sampling for high-dimensional sparse linear contextual bandits
Sunrit Chakraborty, Saptarshi Roy, and Ambuj Tewari · 2023
Closest in time.
Efficient sparse linear bandits under high dimensional data
Xue Wang, Mike Mingcheng Wei, and Tao Yao · 2023
Closest in time.