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.02463
  4. Cited By
Unifying Clustered and Non-stationary Bandits

Unifying Clustered and Non-stationary Bandits

International Conference on Artificial Intelligence and Statistics (AISTATS), 2020
5 September 2020
Chuanhao Li
Qingyun Wu
Hongning Wang
ArXiv (abs)PDFHTML

Papers citing "Unifying Clustered and Non-stationary Bandits"

10 / 10 papers shown
Constrained Feedback Learning for Non-Stationary Multi-Armed Bandits
Constrained Feedback Learning for Non-Stationary Multi-Armed Bandits
Shaoang Li
Jian Li
164
0
0
18 Sep 2025
Designing an Interpretable Interface for Contextual Bandits
Designing an Interpretable Interface for Contextual Bandits
Andrew Maher
Matia Gobbo
Lancelot Lachartre
Subash Prabanantham
Rowan Swiers
Puli Liyanagama
258
0
0
23 Sep 2024
Federated Linear Contextual Bandits with Heterogeneous Clients
Federated Linear Contextual Bandits with Heterogeneous Clients
Ethan Blaser
Chuanhao Li
Hongning Wang
FedML
364
4
0
29 Feb 2024
Clustered Linear Contextual Bandits with Knapsacks
Clustered Linear Contextual Bandits with Knapsacks
Yichuan Deng
M. Mamakos
Zhao Song
225
0
0
21 Aug 2023
Linear Bandits with Memory: from Rotting to Rising
Linear Bandits with Memory: from Rotting to Rising
Giulia Clerici
Pierre Laforgue
Nicolò Cesa-Bianchi
256
3
0
16 Feb 2023
A Simple and Provably Efficient Algorithm for Asynchronous Federated
  Contextual Linear Bandits
A Simple and Provably Efficient Algorithm for Asynchronous Federated Contextual Linear BanditsNeural Information Processing Systems (NeurIPS), 2022
Jiafan He
Tianhao Wang
Yifei Min
Quanquan Gu
FedML
319
41
0
07 Jul 2022
Semi-Parametric Contextual Bandits with Graph-Laplacian Regularization
Semi-Parametric Contextual Bandits with Graph-Laplacian RegularizationInformation Sciences (Inf. Sci.), 2022
Y. Choi
Gi-Soo Kim
Seung-Jin Paik
M. Paik
212
8
0
17 May 2022
When Are Linear Stochastic Bandits Attackable?
When Are Linear Stochastic Bandits Attackable?
Huazheng Wang
Haifeng Xu
Hongning Wang
AAML
250
13
0
18 Oct 2021
Asynchronous Upper Confidence Bound Algorithms for Federated Linear
  Bandits
Asynchronous Upper Confidence Bound Algorithms for Federated Linear Bandits
Chuanhao Li
Hongning Wang
FedML
221
43
0
04 Oct 2021
Field Study in Deploying Restless Multi-Armed Bandits: Assisting
  Non-Profits in Improving Maternal and Child Health
Field Study in Deploying Restless Multi-Armed Bandits: Assisting Non-Profits in Improving Maternal and Child Health
Aditya Mate
Lovish Madaan
Aparna Taneja
N. Madhiwalla
Shresth Verma
Gargi Singh
Aparna Hegde
Pradeep Varakantham
Milind Tambe
283
71
0
16 Sep 2021
1
Page 1 of 1