Online Learning for Changing Environments using Coin Betting

6 November 2017

Papers citing "Online Learning for Changing Environments using Coin Betting"

10 / 10 papers shown

Title
Non-stationary Bandit Convex Optimization: A Comprehensive Study Xiaoqi Liu Dorian Baudry Julian Zimmert Patrick Rebeschini Arya Akhavan 104 1 0 03 Jun 2025
Smoothed Online Convex Optimization Based on Discounted-Normal-Predictor Lijun Zhang Wei Jiang Jinfeng Yi Tianbao Yang 122 10 0 02 May 2022
Parameter-free Online Linear Optimization with Side Information via Universal Coin Betting J. Jon Ryu Alankrita Bhatt Young-Han Kim 92 1 0 04 Feb 2022
Online Convex Optimization with Continuous Switching Constraint Guanghui Wang Yuanyu Wan Tianbao Yang Lijun Zhang 92 10 0 21 Mar 2021
Minimizing Dynamic Regret and Adaptive Regret Simultaneously Lijun Zhang Shiyin Lu Tianbao Yang 135 46 0 06 Feb 2020
Online Second Price Auction with Semi-bandit Feedback Under the Non-Stationary Setting Haoyu Zhao Wei Chen 74 13 0 14 Nov 2019
Dual Adaptivity: A Universal Algorithm for Minimizing the Adaptive Regret of Convex Functions Lijun Zhang G. Wang Wei-Wei Tu Zhi Zhou ODL 142 21 0 26 Jun 2019
Equipping Experts/Bandits with Long-term Memory Kai Zheng Haipeng Luo Ilias Diakonikolas Liwei Wang OffRL 87 15 0 30 May 2019
Adaptive Regret of Convex and Smooth Functions Lijun Zhang Tie-Yan Liu Zhi Zhou ODL 173 47 0 26 Apr 2019
A New Algorithm for Non-stationary Contextual Bandits: Efficient, Optimal, and Parameter-free Yifang Chen Chung-Wei Lee Haipeng Luo Chen-Yu Wei 230 139 0 03 Feb 2019