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. 1605.06439
  4. Cited By
Combining Adversarial Guarantees and Stochastic Fast Rates in Online
  Learning

Combining Adversarial Guarantees and Stochastic Fast Rates in Online Learning

20 May 2016
Wouter M. Koolen
Peter Grünwald
T. Erven
ArXivPDFHTML

Papers citing "Combining Adversarial Guarantees and Stochastic Fast Rates in Online Learning"

10 / 10 papers shown
Title
Modifying Squint for Prediction with Expert Advice in a Changing
  Environment
Modifying Squint for Prediction with Expert Advice in a Changing Environment
Thom Neuteboom
T. Erven
24
1
0
14 Sep 2022
A Near-Optimal Best-of-Both-Worlds Algorithm for Online Learning with
  Feedback Graphs
A Near-Optimal Best-of-Both-Worlds Algorithm for Online Learning with Feedback Graphs
Chloé Rouyer
Dirk van der Hoeven
Nicolò Cesa-Bianchi
Yevgeny Seldin
23
15
0
01 Jun 2022
Online Learning with Bounded Recall
Online Learning with Bounded Recall
Jon Schneider
Kiran Vodrahalli
23
1
0
28 May 2022
PAC-Bayes, MAC-Bayes and Conditional Mutual Information: Fast rate
  bounds that handle general VC classes
PAC-Bayes, MAC-Bayes and Conditional Mutual Information: Fast rate bounds that handle general VC classes
Peter Grünwald
Thomas Steinke
Lydia Zakynthinou
30
29
0
17 Jun 2021
Generalization Bounds via Information Density and Conditional
  Information Density
Generalization Bounds via Information Density and Conditional Information Density
Fredrik Hellström
G. Durisi
27
65
0
16 May 2020
PAC-Bayes Un-Expected Bernstein Inequality
PAC-Bayes Un-Expected Bernstein Inequality
Zakaria Mhammedi
Peter Grünwald
Benjamin Guedj
21
46
0
31 May 2019
Lipschitz Adaptivity with Multiple Learning Rates in Online Learning
Lipschitz Adaptivity with Multiple Learning Rates in Online Learning
Zakaria Mhammedi
Wouter M. Koolen
T. Erven
23
34
0
27 Feb 2019
Beating Stochastic and Adversarial Semi-bandits Optimally and
  Simultaneously
Beating Stochastic and Adversarial Semi-bandits Optimally and Simultaneously
Julian Zimmert
Haipeng Luo
Chen-Yu Wei
11
79
0
25 Jan 2019
Best of many worlds: Robust model selection for online supervised
  learning
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
Fast Rates for General Unbounded Loss Functions: from ERM to Generalized
  Bayes
Fast Rates for General Unbounded Loss Functions: from ERM to Generalized Bayes
Peter Grünwald
Nishant A. Mehta
50
71
0
01 May 2016
1