Impossible Tuning Made Possible: A New Expert Algorithm and Its Applications

1 February 2021

Papers citing "Impossible Tuning Made Possible: A New Expert Algorithm and Its Applications"

32 / 32 papers shown

Title
Fully Unconstrained Online Learning Ashok Cutkosky Zakaria Mhammedi CLL 32 1 0 30 May 2024
Fast TRAC: A Parameter-Free Optimizer for Lifelong Reinforcement Learning Aneesh Muppidi Zhiyu Zhang Heng Yang 39 4 0 26 May 2024
Predict to Minimize Swap Regret for All Payoff-Bounded Tasks Lunjia Hu Yifan Wu 40 3 0 21 Apr 2024
Discounted Adaptive Online Learning: Towards Better Regularization Zhiyu Zhang David Bombara Heng Yang 23 8 0 05 Feb 2024
A Policy Gradient Primal-Dual Algorithm for Constrained MDPs with Uniform PAC Guarantees Toshinori Kitamura Tadashi Kozuno Masahiro Kato Yuki Ichihara Soichiro Nishimori Akiyoshi Sannai Sho Sonoda Wataru Kumagai Yutaka Matsuo 42 2 0 31 Jan 2024
Improving Adaptive Online Learning Using Refined Discretization Zhiyu Zhang Heng Yang Ashok Cutkosky I. Paschalidis 16 5 0 27 Sep 2023
Universal Online Learning with Gradient Variations: A Multi-layer Online Ensemble Approach Yu-Hu Yan Peng Zhao Zhiguang Zhou 32 8 0 17 Jul 2023
Unconstrained Online Learning with Unbounded Losses Andrew Jacobsen Ashok Cutkosky 32 16 0 08 Jun 2023
Mechanic: A Learning Rate Tuner Ashok Cutkosky Aaron Defazio Harsh Mehta OffRL 21 15 0 31 May 2023
Accelerated Rates between Stochastic and Adversarial Online Convex Optimization Sarah Sachs Hédi Hadiji T. Erven Cristóbal Guzmán 29 6 0 06 Mar 2023
Uncoupled and Convergent Learning in Two-Player Zero-Sum Markov Games with Bandit Feedback Yang Cai Haipeng Luo Chen-Yu Wei Weiqiang Zheng 31 18 0 05 Mar 2023
Repeated Bilateral Trade Against a Smoothed Adversary Nicolò Cesa-Bianchi Tommaso Cesari Roberto Colomboni Federico Fusco S. Leonardi 36 16 0 21 Feb 2023
Best of Both Worlds Policy Optimization Christoph Dann Chen-Yu Wei Julian Zimmert 29 12 0 18 Feb 2023
Optimal Stochastic Non-smooth Non-convex Optimization through Online-to-Non-convex Conversion Ashok Cutkosky Harsh Mehta Francesco Orabona 35 32 0 07 Feb 2023
Unconstrained Dynamic Regret via Sparse Coding Zhiyu Zhang Ashok Cutkosky I. Paschalidis 39 7 0 31 Jan 2023
Parameter-free Regret in High Probability with Heavy Tails Jiujia Zhang Ashok Cutkosky 16 20 0 25 Oct 2022
Dynamic Regret of Online Markov Decision Processes Peng Zhao Longfei Li Zhi-Hua Zhou OffRL 39 17 0 26 Aug 2022
A Regret-Variance Trade-Off in Online Learning Dirk van der Hoeven Nikita Zhivotovskiy Nicolò Cesa-Bianchi 19 6 0 06 Jun 2022
Optimal Comparator Adaptive Online Learning with Switching Cost Zhiyu Zhang Ashok Cutkosky I. Paschalidis 21 4 0 13 May 2022
Implicit Parameter-free Online Learning with Truncated Linear Models Keyi Chen Ashok Cutkosky Francesco Orabona 20 10 0 19 Mar 2022
Leveraging Initial Hints for Free in Stochastic Linear Bandits Ashok Cutkosky Christoph Dann Abhimanyu Das Qiuyi Qiuyi Zhang 8 5 0 08 Mar 2022
Parameter-free Mirror Descent Andrew Jacobsen Ashok Cutkosky 20 32 0 26 Feb 2022
Corralling a Larger Band of Bandits: A Case Study on Switching Regret for Linear Bandits Haipeng Luo Mengxiao Zhang Peng Zhao Zhi-Hua Zhou 34 17 0 12 Feb 2022
Policy Optimization for Stochastic Shortest Path Liyu Chen Haipeng Luo Aviv A. Rosenberg 19 12 0 07 Feb 2022
Parameter-free Online Linear Optimization with Side Information via Universal Coin Betting Jeonghun Ryu Alankrita Bhatt Young-Han Kim 26 1 0 04 Feb 2022
Learning Infinite-Horizon Average-Reward Markov Decision Processes with Constraints Liyu Chen R. Jain Haipeng Luo 57 25 0 31 Jan 2022
No-Regret Learning in Time-Varying Zero-Sum Games Mengxiao Zhang Peng Zhao Haipeng Luo Zhi-Hua Zhou 33 38 0 30 Jan 2022
Isotuning With Applications To Scale-Free Online Learning Laurent Orseau Marcus Hutter 15 5 0 29 Dec 2021
Logarithmic Regret from Sublinear Hints Aditya Bhaskara Ashok Cutkosky Ravi Kumar Manish Purohit 60 18 0 09 Nov 2021
Nonstochastic Bandits and Experts with Arm-Dependent Delays Dirk van der Hoeven Nicolò Cesa-Bianchi 6 15 0 02 Nov 2021
Finding the Stochastic Shortest Path with Low Regret: The Adversarial Cost and Unknown Transition Case Liyu Chen Haipeng Luo 25 30 0 10 Feb 2021
Minimax Regret for Stochastic Shortest Path with Adversarial Costs and Known Transition Liyu Chen Haipeng Luo Chen-Yu Wei 29 32 0 07 Dec 2020