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. 1511.02176
  4. Cited By
Optimal Non-Asymptotic Lower Bound on the Minimax Regret of Learning
  with Expert Advice

Optimal Non-Asymptotic Lower Bound on the Minimax Regret of Learning with Expert Advice

6 November 2015
Francesco Orabona
D. Pál
ArXiv (abs)PDFHTML

Papers citing "Optimal Non-Asymptotic Lower Bound on the Minimax Regret of Learning with Expert Advice"

6 / 6 papers shown
Title
Continuous Prediction with Experts' Advice
Continuous Prediction with Experts' Advice
V. S. Portella
Christopher Liaw
Nicholas J. A. Harvey
92
5
0
01 Jun 2022
Online Learning of Network Bottlenecks via Minimax Paths
Online Learning of Network Bottlenecks via Minimax Paths
Niklas Åkerblom
F. Hoseini
M. Chehreghani
74
11
0
17 Sep 2021
Online Learning with Optimism and Delay
Online Learning with Optimism and Delay
Genevieve Flaspohler
Francesco Orabona
J. Cohen
Soukayna Mouatadid
Miruna Oprescu
Paulo Orenstein
Lester W. Mackey
94
35
0
13 Jun 2021
MaxUp: A Simple Way to Improve Generalization of Neural Network Training
MaxUp: A Simple Way to Improve Generalization of Neural Network Training
Chengyue Gong
Zhaolin Ren
Mao Ye
Qiang Liu
AAML
77
56
0
20 Feb 2020
New Potential-Based Bounds for the Geometric-Stopping Version of
  Prediction with Expert Advice
New Potential-Based Bounds for the Geometric-Stopping Version of Prediction with Expert Advice
Vladimir A. Kobzar
R. Kohn
Zhilei Wang
78
11
0
05 Dec 2019
New Potential-Based Bounds for Prediction with Expert Advice
New Potential-Based Bounds for Prediction with Expert Advice
Vladimir A. Kobzar
R. Kohn
Zhilei Wang
135
21
0
05 Nov 2019
1