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. 2110.14804
  4. Cited By
Minimax Optimal Quantile and Semi-Adversarial Regret via
  Root-Logarithmic Regularizers

Minimax Optimal Quantile and Semi-Adversarial Regret via Root-Logarithmic Regularizers

27 October 2021
Jeffrey Negrea
Blair Bilodeau
Nicolò Campolongo
Francesco Orabona
Daniel M. Roy
ArXivPDFHTML

Papers citing "Minimax Optimal Quantile and Semi-Adversarial Regret via Root-Logarithmic Regularizers"

2 / 2 papers shown
Title
Unconstrained Dynamic Regret via Sparse Coding
Unconstrained Dynamic Regret via Sparse Coding
Zhiyu Zhang
Ashok Cutkosky
I. Paschalidis
39
7
0
31 Jan 2023
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
1