Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
2002.11332
Cited By
Structured Linear Contextual Bandits: A Sharp and Geometric Smoothed Analysis
International Conference on Machine Learning (ICML), 2020
26 February 2020
V. Sivakumar
Zhiwei Steven Wu
A. Banerjee
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Structured Linear Contextual Bandits: A Sharp and Geometric Smoothed Analysis"
17 / 17 papers shown
Feel-Good Thompson Sampling for Contextual Bandits: a Markov Chain Monte Carlo Showdown
Emile Anand
Sarah Liaw
316
4
0
21 Jul 2025
Exploiting Concavity Information in Gaussian Process Contextual Bandit Optimization
Kevin Li
Eric Laber
319
1
0
13 Mar 2025
Learning to Price with Resource Constraints: From Full Information to Machine-Learned Prices
Ruicheng Ao
Jiashuo Jiang
D. Simchi-Levi
334
3
0
24 Jan 2025
Demystifying Online Clustering of Bandits: Enhanced Exploration Under Stochastic and Smoothed Adversarial Contexts
International Conference on Learning Representations (ICLR), 2025
Zhuohua Li
Maoli Liu
Xiangxiang Dai
John C. S. Lui
279
4
0
03 Jan 2025
Sparsity-Agnostic Linear Bandits with Adaptive Adversaries
Tianyuan Jin
Kyoungseok Jang
Nicolò Cesa-Bianchi
270
1
0
03 Jun 2024
New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem
Koji Ichikawa
Shinji Ito
Daisuke Hatano
Hanna Sumita
Takuro Fukunaga
Naonori Kakimura
Ken-ichi Kawarabayashi
246
0
0
19 Dec 2023
Strategic Apple Tasting
Neural Information Processing Systems (NeurIPS), 2023
Keegan Harris
Chara Podimata
Zhiwei Steven Wu
373
11
0
09 Jun 2023
Does Sparsity Help in Learning Misspecified Linear Bandits?
International Conference on Machine Learning (ICML), 2023
Jialin Dong
Lin F. Yang
287
2
0
29 Mar 2023
Repeated Bilateral Trade Against a Smoothed Adversary
Annual Conference Computational Learning Theory (COLT), 2023
Nicolò Cesa-Bianchi
Tommaso Cesari
Roberto Colomboni
Federico Fusco
S. Leonardi
322
18
0
21 Feb 2023
Improved Algorithms for Multi-period Multi-class Packing Problems with Bandit Feedback
International Conference on Machine Learning (ICML), 2023
Wonyoung Hedge Kim
G. Iyengar
A. Zeevi
202
4
0
31 Jan 2023
PopArt: Efficient Sparse Regression and Experimental Design for Optimal Sparse Linear Bandits
Neural Information Processing Systems (NeurIPS), 2022
Kyoungseok Jang
Chicheng Zhang
Kwang-Sung Jun
445
17
0
25 Oct 2022
Contextual Information-Directed Sampling
International Conference on Machine Learning (ICML), 2022
Botao Hao
Tor Lattimore
Chao Qin
393
19
0
22 May 2022
Noisy Truncated SGD: Optimization and Generalization
SDM (SDM), 2021
Yingxue Zhou
Xinyan Li
A. Banerjee
265
4
0
26 Feb 2021
High-Dimensional Sparse Linear Bandits
Botao Hao
Tor Lattimore
Mengdi Wang
451
71
0
08 Nov 2020
Near Optimal Adversarial Attacks on Stochastic Bandits and Defenses with Smoothed Responses
Shiliang Zuo
AAML
582
2
0
21 Aug 2020
A Smoothed Analysis of Online Lasso for the Sparse Linear Contextual Bandit Problem
Zhiyuan Liu
Huazheng Wang
Bo Waggoner
Youjian
Yi Liu
Lijun Chen
153
0
0
16 Jul 2020
Random Quadratic Forms with Dependence: Applications to Restricted Isometry and Beyond
Neural Information Processing Systems (NeurIPS), 2019
A. Banerjee
Qilong Gu
V. Sivakumar
Zhiwei Steven Wu
235
4
0
11 Oct 2019
1
Page 1 of 1
