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. 2301.07040
  4. Cited By
Optimal Algorithms for Latent Bandits with Cluster Structure
v1v2v3 (latest)

Optimal Algorithms for Latent Bandits with Cluster Structure

International Conference on Artificial Intelligence and Statistics (AISTATS), 2023
17 January 2023
S. Pal
A. Suggala
Karthikeyan Shanmugam
Prateek Jain
ArXiv (abs)PDFHTML

Papers citing "Optimal Algorithms for Latent Bandits with Cluster Structure"

10 / 10 papers shown
Latent Preference Bandits
Latent Preference Bandits
Newton Mwai
Emil Carlsson
Fredrik D. Johansson
133
0
0
07 Aug 2025
Learning to Call: A Field Trial of a Collaborative Bandit Algorithm for Improved Message Delivery in Mobile Maternal Health
Learning to Call: A Field Trial of a Collaborative Bandit Algorithm for Improved Message Delivery in Mobile Maternal Health
Arpan Dasgupta
Mizhaan Maniyar
Awadhesh Srivastava
Sanat Kumar
Amrita Mahale
Aparna Hedge
A. Suggala
Karthikeyan Shanmugam
Aparna Taneja
Milind Tambe
102
0
0
22 Jul 2025
Near Optimal Best Arm Identification for Clustered Bandits
Near Optimal Best Arm Identification for Clustered Bandits
Yash
Nikhil Karamchandani
Avishek Ghosh
221
0
0
15 May 2025
A Classification View on Meta Learning Bandits
A Classification View on Meta Learning Bandits
Mirco Mutti
Jeongyeol Kwon
Shie Mannor
Aviv Tamar
263
0
0
06 Apr 2025
Online Matrix Completion: A Collaborative Approach with Hott Items
Online Matrix Completion: A Collaborative Approach with Hott ItemsInternational Conference on Machine Learning (ICML), 2024
Dheeraj Baby
S. Pal
305
0
0
11 Aug 2024
Pretraining Decision Transformers with Reward Prediction for In-Context Multi-task Structured Bandit Learning
Pretraining Decision Transformers with Reward Prediction for In-Context Multi-task Structured Bandit Learning
Subhojyoti Mukherjee
Josiah P. Hanna
Qiaomin Xie
Robert D. Nowak
620
5
0
07 Jun 2024
Finite-Time Frequentist Regret Bounds of Multi-Agent Thompson Sampling
  on Sparse Hypergraphs
Finite-Time Frequentist Regret Bounds of Multi-Agent Thompson Sampling on Sparse Hypergraphs
Tianyuan Jin
Hao-Lun Hsu
William Chang
Pan Xu
192
2
0
24 Dec 2023
Blocked Collaborative Bandits: Online Collaborative Filtering with
  Per-Item Budget Constraints
Blocked Collaborative Bandits: Online Collaborative Filtering with Per-Item Budget ConstraintsNeural Information Processing Systems (NeurIPS), 2023
S. Pal
A. Suggala
Karthikeyan Shanmugam
Prateek Jain
191
2
0
31 Oct 2023
Context-lumpable stochastic bandits
Context-lumpable stochastic banditsNeural Information Processing Systems (NeurIPS), 2023
Chung-Wei Lee
Qinghua Liu
Yasin Abbasi-Yadkori
Chi Jin
Tor Lattimore
Csaba Szepesvári
OffRL
289
2
0
22 Jun 2023
Adversarial Online Collaborative Filtering
Adversarial Online Collaborative FilteringInternational Conference on Algorithmic Learning Theory (ALT), 2023
Stephen Pasteris
Fabio Vitale
Mark Herbster
Claudio Gentile
Andre' Panisson
323
0
0
11 Feb 2023
1