Follow the Leader If You Can, Hedge If You Must

3 January 2013

Papers citing "Follow the Leader If You Can, Hedge If You Must"

37 / 37 papers shown

Title
Online Algorithm for Aggregating Experts' Predictions with Unbounded Quadratic Loss Alexander Korotin V. Výugin E. Burnaev 31 1 0 11 Jan 2025
Conformal Distributed Remote Inference in Sensor Networks Under Reliability and Communication Constraints Meiyi Zhu Matteo Zecchin Sangwoo Park Caili Guo Chunyan Feng P. Popovski Osvaldo Simeone 45 3 0 12 Sep 2024
Narrowing the Gap between Adversarial and Stochastic MDPs via Policy Optimization D. Tiapkin Evgenii Chzhen Gilles Stoltz 74 1 0 08 Jul 2024
$A Simple and Adaptive Learning Rate for FTRL in Online Learning with Minimax Regret of $Θ(T^{2/3})$ and its Application to Best-of-Both-Worlds$ A Simple and Adaptive Learning Rate for FTRL in Online Learning with Minimax Regret of $Θ(T^{2/3})$ and its Application to Best-of-Both-Worlds Taira Tsuchiya Shinji Ito 26 0 0 30 May 2024
Adaptive Online Experimental Design for Causal Discovery Muhammad Qasim Elahi Lai Wei Murat Kocaoglu Mahsa Ghasemi CML 46 1 0 19 May 2024
An Online Gradient-Based Caching Policy with Logarithmic Complexity and Regret Guarantees D. Carra Giovanni Neglia 24 1 0 02 May 2024
Policy Optimization via Adv2: Adversarial Learning on Advantage Functions Matthieu Jonckheere Chiara Mignacco Gilles Stoltz 33 2 0 25 Oct 2023
Achieving Better Regret against Strategic Adversaries Le Cong Dinh Tri-Dung Nguyen Alain B. Zemkoho Long Tran-Thanh 24 0 0 13 Feb 2023
Banker Online Mirror Descent: A Universal Approach for Delayed Online Bandit Learning Jiatai Huang Yan Dai Longbo Huang 27 6 0 25 Jan 2023
Optimistic No-regret Algorithms for Discrete Caching N. Mhaisen Abhishek Sinha G. Paschos Georgios Iosifidis 36 11 0 15 Aug 2022
Adversarially Robust Multi-Armed Bandit Algorithm with Variance-Dependent Regret Bounds Shinji Ito Taira Tsuchiya Junya Honda AAML 23 16 0 14 Jun 2022
Online Learning with Bounded Recall Jon Schneider Kiran Vodrahalli 23 1 0 28 May 2022
Exploiting the Curvature of Feasible Sets for Faster Projection-Free Online Learning Zakaria Mhammedi 23 8 0 23 May 2022
Adaptive Best-of-Both-Worlds Algorithm for Heavy-Tailed Multi-Armed Bandits Jiatai Huang Yan Dai Longbo Huang 27 14 0 28 Jan 2022
Isotuning With Applications To Scale-Free Online Learning Laurent Orseau Marcus Hutter 21 5 0 29 Dec 2021
Dealing With Misspecification In Fixed-Confidence Linear Top-m Identification Clémence Réda Andrea Tirinzoni Rémy Degenne 31 9 0 02 Nov 2021
A/B/n Testing with Control in the Presence of Subpopulations Yoan Russac C. Katsimerou Dennis Bohle Olivier Cappé Aurélien Garivier Wouter M. Koolen 24 25 0 29 Oct 2021
On Optimal Robustness to Adversarial Corruption in Online Decision Problems Shinji Ito 42 22 0 22 Sep 2021
Gamification of Pure Exploration for Linear Bandits Rémy Degenne Pierre Ménard Xuedong Shang Michal Valko 13 76 0 02 Jul 2020
Explicit Best Arm Identification in Linear Bandits Using No-Regret Learners Mohammadi Zaki Avinash Mohan Aditya Gopalan 15 9 0 13 Jun 2020
Learning to Play No-Press Diplomacy with Best Response Policy Iteration Thomas W. Anthony Tom Eccles Andrea Tacchetti János Kramár I. Gemp ... Richard Everett Roman Werpachowski Satinder Singh T. Graepel Yoram Bachrach 24 42 0 08 Jun 2020
Lipschitz Adaptivity with Multiple Learning Rates in Online Learning Zakaria Mhammedi Wouter M. Koolen T. Erven 23 34 0 27 Feb 2019
Lazy-CFR: fast and near optimal regret minimization for extensive games with imperfect information Yichi Zhou Tongzheng Ren J. Li Dong Yan Jun Zhu 21 13 0 10 Oct 2018
Online Aggregation of Unbounded Losses Using Shifting Experts with Confidence V. Výugin V. Trunov 14 9 0 02 Aug 2018
AdaGrad stepsizes: Sharp convergence over nonconvex landscapes Rachel A. Ward Xiaoxia Wu Léon Bottou ODL 27 361 0 05 Jun 2018
Best of many worlds: Robust model selection for online supervised learning Vidya Muthukumar Mitas Ray A. Sahai Peter L. Bartlett OffRL 40 8 0 22 May 2018
More Adaptive Algorithms for Adversarial Bandits Chen-Yu Wei Haipeng Luo 25 180 0 10 Jan 2018
Parameter-free online learning via model selection Dylan J. Foster Satyen Kale M. Mohri Karthik Sridharan 32 59 0 30 Dec 2017
Refined Lower Bounds for Adversarial Bandits Sébastien Gerchinovitz Tor Lattimore AAML 25 58 0 24 May 2016
Combining Adversarial Guarantees and Stochastic Fast Rates in Online Learning Wouter M. Koolen Peter Grünwald T. Erven 32 37 0 20 May 2016
Fast Rates for General Unbounded Loss Functions: from ERM to Generalized Bayes Peter Grünwald Nishant A. Mehta 50 71 0 01 May 2016
Scale-Free Online Learning Francesco Orabona D. Pál 15 102 0 08 Jan 2016
Adaptive Ensemble Learning with Confidence Bounds Cem Tekin Jinsung Yoon M. Schaar FedML 19 40 0 23 Dec 2015
Second-order Quantile Methods for Experts and Combinatorial Games Wouter M. Koolen T. Erven 29 101 0 27 Feb 2015
Achieving All with No Parameters: Adaptive NormalHedge Haipeng Luo Robert Schapire ODL 31 18 0 20 Feb 2015
Inconsistency of Bayesian Inference for Misspecified Linear Models, and a Proposal for Repairing It Peter Grünwald T. V. Ommen 29 265 0 11 Dec 2014
A Second-order Bound with Excess Losses Pierre Gaillard Gilles Stoltz T. Erven 28 149 0 10 Feb 2014