|
Poster
|
Wed 11:00
|
Kernel-Based Function Approximation for Average Reward Reinforcement Learning: An Optimist No-Regret Algorithm
Sattar Vakili · Julia Olkhovskaya
|
|
|
Poster
|
Fri 16:30
|
Adversarial Environment Design via Regret-Guided Diffusion Models
Hojun Chung · Junseo Lee · Minsoo Kim · Dohyeong Kim · Songhwai Oh
|
|
|
Poster
|
Thu 11:00
|
No-regret Learning in Harmonic Games: Extrapolation in the Face of Conflicting Interests
Davide Legacci · Panayotis Mertikopoulos · Christos Papadimitriou · Georgios Piliouras · Bary Pradelski
|
|
|
Poster
|
Thu 11:00
|
Honor Among Bandits: No-Regret Learning for Online Fair Division
Ariel Procaccia · Ben Schiffer · Shirley Zhang
|
|
|
Poster
|
Wed 11:00
|
No-Regret Bandit Exploration based on Soft Tree Ensemble Model
Shogo Iwazaki · Shinya Suzumura
|
|
|
Poster
|
Wed 16:30
|
Local Linearity: the Key for No-regret Reinforcement Learning in Continuous MDPs
Davide Maran · Alberto Maria Metelli · Matteo Papini · Marcello Restelli
|
|
|
Poster
|
Wed 11:00
|
No-Regret M♮-Concave Function Maximization: Stochastic Bandit Algorithms and NP-Hardness of Adversarial Full-Information Setting
Taihei Oki · Shinsaku Sakaue
|
|
|
Poster
|
Wed 11:00
|
No-Regret Learning for Fair Multi-Agent Social Welfare Optimization
Mengxiao Zhang · Ramiro Deo-Campo Vuong · Haipeng Luo
|
|
|
Poster
|
Thu 11:00
|
Partial Structure Discovery is Sufficient for No-regret Learning in Causal Bandits
Muhammad Qasim Elahi · Mahsa Ghasemi · Murat Kocaoglu
|
|
|
Poster
|
Fri 16:30
|
Convergence of No-Swap-Regret Dynamics in Self-Play
Renato Leme · Georgios Piliouras · Jon Schneider
|
|
|
Poster
|
Fri 11:00
|
Is O(log N) practical? Near-Equivalence Between Delay Robustness and Bounded Regret in Bandits and RL
Enoch H. Kang · P. R. Kumar
|
|
|
Poster
|
Wed 16:30
|
Improved Regret of Linear Ensemble Sampling
Harin Lee · Min-hwan Oh
|
|
