Poster
|
Thu 9:00
|
Decentralized, Communication- and Coordination-free Learning in Structured Matching Markets
Chinmay Maheshwari · Shankar Sastry · Eric Mazumdar
|
|
Poster
|
Tue 9:00
|
Nearly Optimal Best-of-Both-Worlds Algorithms for Online Learning with Feedback Graphs
Shinji Ito · Taira Tsuchiya · Junya Honda
|
|
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
|
Thu 9:00
|
Syndicated Bandits: A Framework for Auto Tuning Hyper-parameters in Contextual Bandit Algorithms
QIN DING · Yue Kang · Yi-Wei Liu · Thomas Chun Man Lee · Cho-Jui Hsieh · James Sharpnack
|
|
Poster
|
Tue 14:00
|
Beyond the Best: Distribution Functional Estimation in Infinite-Armed Bandits
Yifei Wang · Tavor Baharav · Yanjun Han · Jiantao Jiao · David Tse
|
|
Poster
|
Thu 9:00
|
Single-pass Streaming Lower Bounds for Multi-armed Bandits Exploration with Instance-sensitive Sample Complexity
Sepehr Assadi · Chen Wang
|
|
Poster
|
Tue 9:00
|
Collaborative Linear Bandits with Adversarial Agents: Near-Optimal Regret Bounds
Aritra Mitra · Arman Adibi · George J. Pappas · Hamed Hassani
|
|
Poster
|
Thu 14:00
|
Top Two Algorithms Revisited
Marc Jourdan · Rémy Degenne · Dorian Baudry · Rianne de Heide · Emilie Kaufmann
|
|
Poster
|
Thu 9:00
|
Dynamic Learning in Large Matching Markets
Anand Kalvit · Assaf Zeevi
|
|
Poster
|
Wed 14:00
|
An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem
Arpit Agarwal · Rohan Ghuge · viswanath nagarajan
|
|
Poster
|
Wed 9:00
|
Finite-Time Regret of Thompson Sampling Algorithms for Exponential Family Multi-Armed Bandits
Tianyuan Jin · Pan Xu · Xiaokui Xiao · Anima Anandkumar
|
|