ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 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

4 September 2020
Yining Wang
Yi Chen
Ethan X. Fang
Zhaoran Wang
Runze Li
ArXivPDFHTML

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

4 / 4 papers shown
Title
Contexts can be Cheap: Solving Stochastic Contextual Bandits with Linear
  Bandit Algorithms
Contexts can be Cheap: Solving Stochastic Contextual Bandits with Linear Bandit Algorithms
Osama A. Hanna
Lin F. Yang
Christina Fragouli
27
11
0
08 Nov 2022
Distributed Linear Bandits under Communication Constraints
Distributed Linear Bandits under Communication Constraints
Sudeep Salgia
Qing Zhao
32
7
0
04 Nov 2022
Kernel-based methods for bandit convex optimization
Kernel-based methods for bandit convex optimization
Sébastien Bubeck
Ronen Eldan
Y. Lee
81
163
0
11 Jul 2016
Q-learning with censored data
Q-learning with censored data
Y. Goldberg
Michael R. Kosorok
OffRL
57
136
0
30 May 2012
1