ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2002.08994
  4. Cited By
Optimal anytime regret with two experts
v1v2 (latest)

Optimal anytime regret with two experts

Mathematical Statistics and Learning (MSL), 2020
20 February 2020
Nicholas J. A. Harvey
Christopher Liaw
E. Perkins
Sikander Randhawa
ArXiv (abs)PDFHTML

Papers citing "Optimal anytime regret with two experts"

13 / 13 papers shown
Instance-Optimal Matrix Multiplicative Weight Update and Its Quantum Applications
Instance-Optimal Matrix Multiplicative Weight Update and Its Quantum Applications
Weiyuan Gong
Tongyang Li
Xinzhao Wang
Zhiyu Zhang
172
0
0
10 Sep 2025
Reasoning without Regret
Reasoning without Regret
Tarun Chitra
OffRLLRM
312
0
0
14 Apr 2025
Discounted Adaptive Online Learning: Towards Better Regularization
Discounted Adaptive Online Learning: Towards Better Regularization
Zhiyu Zhang
David Bombara
Heng Yang
311
12
0
05 Feb 2024
Improving Adaptive Online Learning Using Refined Discretization
Improving Adaptive Online Learning Using Refined DiscretizationInternational Conference on Algorithmic Learning Theory (ALT), 2023
Zhiyu Zhang
Heng Yang
Ashok Cutkosky
I. Paschalidis
433
10
0
27 Sep 2023
Unconstrained Dynamic Regret via Sparse Coding
Unconstrained Dynamic Regret via Sparse CodingNeural Information Processing Systems (NeurIPS), 2023
Zhiyu Zhang
Ashok Cutkosky
I. Paschalidis
501
12
0
31 Jan 2023
A PDE approach for regret bounds under partial monitoring
A PDE approach for regret bounds under partial monitoring
Erhan Bayraktar
Ibrahim Ekren
Xin Zhang
154
0
0
02 Sep 2022
Continuous Prediction with Experts' Advice
Continuous Prediction with Experts' AdviceJournal of machine learning research (JMLR), 2022
V. S. Portella
Christopher Liaw
Nicholas J. A. Harvey
348
7
0
01 Jun 2022
Optimal Comparator Adaptive Online Learning with Switching Cost
Optimal Comparator Adaptive Online Learning with Switching CostNeural Information Processing Systems (NeurIPS), 2022
Zhiyu Zhang
Ashok Cutkosky
I. Paschalidis
309
8
0
13 May 2022
Efficient and Optimal Fixed-Time Regret with Two Experts
Efficient and Optimal Fixed-Time Regret with Two ExpertsInternational Conference on Algorithmic Learning Theory (ALT), 2022
Laura Greenstreet
Nicholas J. A. Harvey
V. S. Portella
166
4
0
15 Mar 2022
A PDE-Based Analysis of the Symmetric Two-Armed Bernoulli Bandit
A PDE-Based Analysis of the Symmetric Two-Armed Bernoulli Bandit
Vladimir A. Kobzar
R. Kohn
374
4
0
11 Feb 2022
PDE-Based Optimal Strategy for Unconstrained Online Learning
PDE-Based Optimal Strategy for Unconstrained Online LearningInternational Conference on Machine Learning (ICML), 2022
Zhiyu Zhang
Ashok Cutkosky
I. Paschalidis
229
31
0
19 Jan 2022
Minimax Optimal Quantile and Semi-Adversarial Regret via
  Root-Logarithmic Regularizers
Minimax Optimal Quantile and Semi-Adversarial Regret via Root-Logarithmic RegularizersNeural Information Processing Systems (NeurIPS), 2021
Jeffrey Negrea
Blair Bilodeau
Nicolò Campolongo
Francesco Orabona
Daniel M. Roy
288
9
0
27 Oct 2021
New Potential-Based Bounds for Prediction with Expert Advice
New Potential-Based Bounds for Prediction with Expert AdviceAnnual Conference Computational Learning Theory (COLT), 2019
Vladimir A. Kobzar
R. Kohn
Zhilei Wang
594
22
0
05 Nov 2019
1
Page 1 of 1