firstbacksecondback
20 Results
Poster
|
Tue 9:00 |
Collaborative Linear Bandits with Adversarial Agents: Near-Optimal Regret Bounds Aritra Mitra · Arman Adibi · George J. Pappas · Hamed Hassani |
|
Poster
|
Tue 14:00 |
Near-Optimal Collaborative Learning in Bandits Clémence Réda · Sattar Vakili · Emilie Kaufmann |
|
Poster
|
Combinatorial Bandits with Linear Constraints: Beyond Knapsacks and Fairness Qingsong Liu · Weihang Xu · Siwei Wang · Zhixuan Fang |
||
Poster
|
Tue 14:00 |
When Privacy Meets Partial Information: A Refined Analysis of Differentially Private Bandits Achraf Azize · Debabrota Basu |
|
Poster
|
Wed 14:00 |
A Simple and Provably Efficient Algorithm for Asynchronous Federated Contextual Linear Bandits Jiafan He · Tianhao Wang · Yifei Min · Quanquan Gu |
|
Poster
|
Tue 9:00 |
Scalable Representation Learning in Linear Contextual Bandits with Constant Regret Guarantees Andrea Tirinzoni · Matteo Papini · Ahmed Touati · Alessandro Lazaric · Matteo Pirotta |
|
Poster
|
Thu 14:00 |
The price of unfairness in linear bandits with biased feedback Solenne Gaucher · Alexandra Carpentier · Christophe Giraud |
|
Poster
|
Thu 14:00 |
Minimax Optimal Fixed-Budget Best Arm Identification in Linear Bandits Junwen Yang · Vincent Tan |
|
Poster
|
Tue 14:00 |
Nearly Optimal Algorithms for Linear Contextual Bandits with Adversarial Corruptions Jiafan He · Dongruo Zhou · Tong Zhang · Quanquan Gu |
|
Poster
|
Thu 9:00 |
Minimax Regret for Cascading Bandits Daniel Vial · Sujay Sanghavi · Sanjay Shakkottai · R. Srikant |
|
Poster
|
Wed 9:00 |
Best of Both Worlds Model Selection Aldo Pacchiano · Christoph Dann · Claudio Gentile |
|
Poster
|
Thu 14:00 |
Non-stationary Bandits with Knapsacks Shang Liu · Jiashuo Jiang · Xiaocheng Li |