follow the perturbed leader

Geometric Resampling in Nearly Linear Time for Follow-the-Perturbed-Leader with Best-of-Both-Worlds Guarantee in Bandit Problems ICML 2025 Follow-the-Perturbed-Leader Achieves Best-of-Both-Worlds for Bandit Problems ALT 2023 Learning in online MDPs: is there a price for handling the communicating case? UAI 2023 Adaptive Oracle-Efficient Online Learning NeurIPS 2022 An Efficient Algorithm for Cooperative Semi-Bandits ALT 2021 Follow the Perturbed Leader: Optimism and Fast Parallel Algorithms for Smooth Minimax Games NeurIPS 2020 Online Non-Convex Learning: Following the Perturbed Leader is Optimal ALT 2020 Revisiting Online Quantum State Learning AAAI 2020 Follow the Compressed Leader: Faster Online Learning of Eigenvectors and Faster MMWU ICML 2017 Efficient Algorithms for Adversarial Contextual Learning ICML 2016 On-Line Learning Algorithms for Path Experts with Non-Additive Losses COLT 2015 Online Learning with Adversarial Delays NeurIPS 2015 Online combinatorial optimization with stochastic decision sets and adversarial losses NeurIPS 2014 Online Linear Optimization via Smoothing COLT 2014 Prediction by random-walk perturbation COLT 2013 Relax and Randomize : From Value to Algorithms NeurIPS 2012 Online Learning in Case of Unbounded Losses Using Follow the Perturbed Leader Algorithm JMLR 2011 Adaptive Online Prediction by Following the Perturbed Leader JMLR 2005