ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1202.3323
  4. Cited By
Mirror Descent Meets Fixed Share (and feels no regret)

Mirror Descent Meets Fixed Share (and feels no regret)

15 February 2012
Nicolò Cesa-Bianchi
Pierre Gaillard
Gabor Lugosi
Gilles Stoltz
ArXivPDFHTML

Papers citing "Mirror Descent Meets Fixed Share (and feels no regret)"

18 / 18 papers shown
Title
Online Linear Regression in Dynamic Environments via Discounting
Online Linear Regression in Dynamic Environments via Discounting
Andrew Jacobsen
Ashok Cutkosky
51
5
0
29 May 2024
Bandits with Replenishable Knapsacks: the Best of both Worlds
Bandits with Replenishable Knapsacks: the Best of both Worlds
Martino Bernasconi
Matteo Castiglioni
A. Celli
Federico Fusco
41
4
0
14 Jun 2023
Unconstrained Online Learning with Unbounded Losses
Unconstrained Online Learning with Unbounded Losses
Andrew Jacobsen
Ashok Cutkosky
32
16
0
08 Jun 2023
Dynamic Regret of Online Markov Decision Processes
Dynamic Regret of Online Markov Decision Processes
Peng Zhao
Longfei Li
Zhi-Hua Zhou
OffRL
44
17
0
26 Aug 2022
Universal Caching
Universal Caching
Ativ Joshi
Abhishek Sinha
OffRL
40
2
0
10 May 2022
Smoothed Online Convex Optimization Based on Discounted-Normal-Predictor
Smoothed Online Convex Optimization Based on Discounted-Normal-Predictor
Lijun Zhang
Wei Jiang
Jinfeng Yi
Tianbao Yang
39
6
0
02 May 2022
No-Regret Learning in Time-Varying Zero-Sum Games
No-Regret Learning in Time-Varying Zero-Sum Games
Mengxiao Zhang
Peng Zhao
Haipeng Luo
Zhi-Hua Zhou
33
38
0
30 Jan 2022
Non-stationary Online Learning with Memory and Non-stochastic Control
Non-stationary Online Learning with Memory and Non-stochastic Control
Peng Zhao
Yu-Hu Yan
Yu-Xiang Wang
Zhi-Hua Zhou
40
47
0
07 Feb 2021
CRPS Learning
CRPS Learning
Jonathan Berrisch
F. Ziel
50
25
0
01 Feb 2021
Equipping Experts/Bandits with Long-term Memory
Equipping Experts/Bandits with Long-term Memory
Kai Zheng
Haipeng Luo
Ilias Diakonikolas
Liwei Wang
OffRL
22
15
0
30 May 2019
Adaptive Regret of Convex and Smooth Functions
Adaptive Regret of Convex and Smooth Functions
Lijun Zhang
Tie-Yan Liu
Zhi-Hua Zhou
ODL
29
45
0
26 Apr 2019
Decentralized Online Learning: Take Benefits from Others' Data without
  Sharing Your Own to Track Global Trend
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
18
16
0
29 Jan 2019
Stochastic Gradient/Mirror Descent: Minimax Optimality and Implicit
  Regularization
Stochastic Gradient/Mirror Descent: Minimax Optimality and Implicit Regularization
Navid Azizan
B. Hassibi
24
61
0
04 Jun 2018
Online Learning for Non-Stationary A/B Tests
Online Learning for Non-Stationary A/B Tests
Andrés Munoz Medina
Sergei Vassilvitskii
Dong Yin
20
3
0
14 Feb 2018
Improved Strongly Adaptive Online Learning using Coin Betting
Improved Strongly Adaptive Online Learning using Coin Betting
Kwang-Sung Jun
Francesco Orabona
Rebecca Willett
S. Wright
30
81
0
14 Oct 2016
Improved Dynamic Regret for Non-degenerate Functions
Improved Dynamic Regret for Non-degenerate Functions
Lijun Zhang
Tianbao Yang
Jinfeng Yi
Jing Rong
Zhi-Hua Zhou
27
127
0
13 Aug 2016
Explore no more: Improved high-probability regret bounds for
  non-stochastic bandits
Explore no more: Improved high-probability regret bounds for non-stochastic bandits
Gergely Neu
24
181
0
10 Jun 2015
Achieving All with No Parameters: Adaptive NormalHedge
Achieving All with No Parameters: Adaptive NormalHedge
Haipeng Luo
Robert Schapire
ODL
31
18
0
20 Feb 2015
1