← Back to papers

2025 COLT COLT 2025

Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries

Authors

Arnab Maiti , Zhiyuan Fan , Kevin Jamieson , Lillian J. Ratliff , Gabriele Farina

Related papers

Of Dice and Games: A Theory of Generalized Boosting 2025

Is a Good Foundation Necessary for Efficient Reinforcement Learning? The Computational Role of the Base Model in Exploration 2025

Computing Optimal Regularizers for Online Linear Optimization 2025

Learning Mixtures of Gaussians Using Diffusion Models 2025

On the query complexity of sampling from non-log-concave distributions (extended abstract) 2025