Fetching the paper…
Reading the bibliography…
In this paper, we revisit the regret minimization problem in sparse stochastic contextual linear bandits, where feature vectors may be of large dimension $d$, but where the reward function depends on a few, say $s_0\ll d$, of these features only.
Some aspects of the sequential design of experiments
Robbins, H · 1952
Earlier work this paper cites.
Asymptotically efficient adaptive allocation rules
Lai, T. L. and Robbins, H · 1985
Earlier work this paper cites.
Regression shrinkage and selection via the lasso
Tibshirani, R · 1996
Earlier work this paper cites.
Associative reinforcement learning using linear probabilistic concepts
Abe, N. and Long, P. M · 1999
Earlier work this paper cites.
Optimal aggregation of classifiers in statistical learning
Tsybakov, A. B · 2004
Earlier work this paper cites.
Fast learning rates for plug-in classifiers
Audibert, J.-Y. and Tsybakov, A. B · 2007
Earlier work this paper cites.
Dynamic batch learning in high-dimensional sparse linear contextual bandits, 2020
Ren, Z. and Zhou, Z · 2008
Earlier work this paper cites.
Feature hashing for large scale multitask learning
Weinberger, K., Dasgupta, A., Langford, J., Smola, A., and Attenberg, J · 2009
Earlier work this paper cites.
A contextual-bandit approach to personalized news article recommendation
Li, L., Chu, W., Langford, J., and Schapire, R. E · 2010
Earlier work this paper cites.
Thresholded lasso for high dimensional variable selection and statistical estimation, 2010
Zhou, S · 2010
Earlier work this paper cites.
Statistics for high-dimensional data: methods, theory and applications
Bühlmann, P. and Van De Geer, S · 2011
Cited alongside, same era.
An empirical evaluation of thompson sampling
Chapelle, O. and Li, L · 2011
Cited alongside, same era.
Unbiased offline evaluation of contextual-bandit-based news article recommendation algorithms
Li, L., Chu, W., Langford, J., and Wang, X · 2011
Cited alongside, same era.
User-friendly tail bounds for matrix martingales
Tropp, J. A · 2011
Cited alongside, same era.
Online-to-confidence-set conversions and application to sparse stochastic bandits
Abbasi-Yadkori, Y., Pal, D., and Szepesvari, C · 2012
Cited alongside, same era.
Bandit theory meets compressed sensing for high dimensional stochastic linear bandit
Carpentier, A. and Munos, R · 2012
Cited alongside, same era.
A smoothed analysis of the greedy algorithm for the linear contextual bandit problem
Kannan, S., Morgenstern, J. H., Roth, A., Waggoner, B., and Wu, Z. S · 2018
Later among the works it cites.
Minimax concave penalized multi-armed bandit model with high-dimensional covariates
Wang, X., Wei, M., and Yao, T · 2018
Later among the works it cites.
Doubly-robust lasso bandit
Kim, G.-S. and Paik, M. C · 2019
Later among the works it cites.
High-dimensional statistics: A non-asymptotic viewpoint , volume 48
Wainwright, M. J · 2019
Later among the works it cites.
Online decision making with high-dimensional covariates
Bastani, H. and Bayati, M · 2020
Closest in time.
Gamification of pure exploration for linear bandits
Degenne, R., Ménard, P., Shang, X., and Valko, M · 2020
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A linear response bandit problem
Goldenshluger, A. and Zeevi, A · 2013
Cited alongside, same era.
Online decision-making with high-dimensional covariates
Bastani, H. and Bayati, M · 2015
Cited alongside, same era.
Collaborative filtering bandits
Li, S., Karatzoglou, A., and Gentile, C · 2016
Cited alongside, same era.
Online context-aware recommendation with time varying multi-armed bandit
Zeng, C., Wang, Q., Mokhtari, S., and Li, T · 2016
Cited alongside, same era.
Adaptive exploration in linear contextual bandit
Hao, B., Lattimore, T., and Szepesvari, C
Cited in the paper.
High-dimensional sparse linear bandits
Hao, B., Lattimore, T., and Wang, M
Cited in the paper.
Optimal best-arm identification in linear bandits
Jedra, Y. and Proutiere, A · 2020
Closest in time.
Bandit algorithms
Lattimore, T. and Szepesvári, C · 2020
Closest in time.
Mostly exploration-free algorithms for contextual bandits
Bastani, H., Bayati, M., and Khosravi, K · 2021
Closest in time.
Sparsity-agnostic lasso bandit
Oh, M.-h., Iyengar, G., and Zeevi, A · 2021
Closest in time.