ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2009.02003
  4. Cited By
Nearly Dimension-Independent Sparse Linear Bandit over Small Action
  Spaces via Best Subset Selection

Nearly Dimension-Independent Sparse Linear Bandit over Small Action Spaces via Best Subset Selection

Journal of the American Statistical Association (JASA), 2020
4 September 2020
Yining Wang
Yi Chen
Ethan X. Fang
Zhaoran Wang
Runze Li
ArXiv (abs)PDFHTML

Papers citing "Nearly Dimension-Independent Sparse Linear Bandit over Small Action Spaces via Best Subset Selection"

7 / 7 papers shown
Navigating Sparsities in High-Dimensional Linear Contextual Bandits
Navigating Sparsities in High-Dimensional Linear Contextual Bandits
Rui Zhao
Zihan Chen
Zemin Zheng
107
0
0
09 Oct 2025
Thompson Sampling for High-Dimensional Sparse Linear Contextual Bandits
Thompson Sampling for High-Dimensional Sparse Linear Contextual BanditsInternational Conference on Machine Learning (ICML), 2022
Sunrit Chakraborty
Saptarshi Roy
Ambuj Tewari
560
15
0
11 Nov 2022
Contexts can be Cheap: Solving Stochastic Contextual Bandits with Linear
  Bandit Algorithms
Contexts can be Cheap: Solving Stochastic Contextual Bandits with Linear Bandit AlgorithmsAnnual Conference Computational Learning Theory (COLT), 2022
Osama A. Hanna
Lin F. Yang
Christina Fragouli
380
20
0
08 Nov 2022
Distributed Linear Bandits under Communication Constraints
Distributed Linear Bandits under Communication ConstraintsInternational Conference on Machine Learning (ICML), 2022
Sudeep Salgia
Qing Zhao
306
7
0
04 Nov 2022
Contextual Information-Directed Sampling
Contextual Information-Directed SamplingInternational Conference on Machine Learning (ICML), 2022
Botao Hao
Tor Lattimore
Chao Qin
399
19
0
22 May 2022
Information Directed Sampling for Sparse Linear Bandits
Information Directed Sampling for Sparse Linear BanditsNeural Information Processing Systems (NeurIPS), 2021
Botao Hao
Tor Lattimore
Wei Deng
263
21
0
29 May 2021
Online Sparse Reinforcement Learning
Online Sparse Reinforcement Learning
Botao Hao
Tor Lattimore
Csaba Szepesvári
Mengdi Wang
OffRL
781
32
0
08 Nov 2020
1
Page 1 of 1