Improved Strongly Adaptive Online Learning using Coin Betting

14 October 2016

Papers citing "Improved Strongly Adaptive Online Learning using Coin Betting"

26 / 26 papers shown

Title
Online Convex Optimisation: The Optimal Switching Regret for all Segmentations Simultaneously Stephen Pasteris Chris Hicks V. Mavroudis Mark Herbster 18 1 0 31 May 2024
MetaCURL: Non-stationary Concave Utility Reinforcement Learning B. Moreno Margaux Brégère Pierre Gaillard Nadia Oudjane OffRL 39 0 0 30 May 2024
Online Linear Regression in Dynamic Environments via Discounting Andrew Jacobsen Ashok Cutkosky 40 5 0 29 May 2024
Efficient Methods for Non-stationary Online Learning Peng Zhao Yan-Feng Xie Lijun Zhang Zhi-Hua Zhou 44 19 0 16 Sep 2023
Non-stationary Projection-free Online Learning with Dynamic and Adaptive Regret Guarantees Yibo Wang Wenhao Yang Wei Jiang Shiyin Lu Bing Wang Haihong Tang Yuanyu Wan Lijun Zhang 24 6 0 19 May 2023
Improved Online Conformal Prediction via Strongly Adaptive Online Learning Aadyot Bhatnagar Haiquan Wang Caiming Xiong Yu Bai AI4TS 33 47 0 15 Feb 2023
Unconstrained Dynamic Regret via Sparse Coding Zhiyu Zhang Ashok Cutkosky I. Paschalidis 31 7 0 31 Jan 2023
Modifying Squint for Prediction with Expert Advice in a Changing Environment Thom Neuteboom T. Erven 24 1 0 14 Sep 2022
Optimal Dynamic Regret in LQR Control Dheeraj Baby Yu-Xiang Wang 24 16 0 18 Jun 2022
Adaptive Online Learning of Quantum States Xinyi Chen Elad Hazan Tongyang Li Zhou Lu Xinzhao Wang Rui Yang 18 13 0 01 Jun 2022
Adversarial Bandits against Arbitrary Strategies Jung-hun Kim Se-Young Yun 41 0 0 30 May 2022
Smoothed Online Convex Optimization Based on Discounted-Normal-Predictor Lijun Zhang Wei Jiang Jinfeng Yi Tianbao Yang 20 6 0 02 May 2022
Adaptive Gradient Methods with Local Guarantees Zhou Lu Wenhan Xia Sanjeev Arora Elad Hazan ODL 22 9 0 02 Mar 2022
Parameter-free Mirror Descent Andrew Jacobsen Ashok Cutkosky 12 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 26 17 0 12 Feb 2022
Optimal Dynamic Regret in Proper Online Learning with Strongly Convex Losses and Beyond Dheeraj Baby Yu-Xiang Wang 34 25 0 21 Jan 2022
Delay-Tolerant Constrained OCO with Application to Network Resource Allocation Juncheng Wang B. Liang Min Dong G. Boudreau H. Abou-zeid 18 9 0 09 May 2021
A Simple Approach for Non-stationary Linear Bandits Peng Zhao Lijun Zhang Yuan Jiang Zhi-Hua Zhou 28 81 0 09 Mar 2021
Regret Bounds for Adaptive Nonlinear Control Nicholas M. Boffi Stephen Tu Jean-Jacques E. Slotine 41 47 0 26 Nov 2020
LeadCache: Regret-Optimal Caching in Networks Debjit Paria Abhishek Sinha 18 25 0 17 Sep 2020
Dual Adaptivity: A Universal Algorithm for Minimizing the Adaptive Regret of Convex Functions Lijun Zhang G. Wang Wei-Wei Tu Zhi-Hua Zhou ODL 15 18 0 26 Jun 2019
Adaptive Regret of Convex and Smooth Functions Lijun Zhang Tie-Yan Liu Zhi-Hua Zhou ODL 27 45 0 26 Apr 2019
Decentralized Online Learning: Take Benefits from Others' Data without Sharing Your Own to Track Global Trend Wendi Wu Zongren Li Yawei Zhao Chenkai Yu P. Zhao Ji Liu FedML 16 16 0 29 Jan 2019
Online Learning for Non-Stationary A/B Tests Andrés Munoz Medina Sergei Vassilvitskii Dong Yin 13 3 0 14 Feb 2018
An Online Convex Optimization Approach to Dynamic Network Resource Allocation Tianyi Chen Qing Ling G. Giannakis 14 214 0 14 Jan 2017
Similarity Function Tracking using Pairwise Comparisons Kristjan Greenewald Stephen Kelley Brandon Oselio Alfred Hero 24 1 0 07 Jan 2017