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. 1904.03602
  4. Cited By
Competitive ratio versus regret minimization: achieving the best of both
  worlds

Competitive ratio versus regret minimization: achieving the best of both worlds

7 April 2019
Amit Daniely
Yishay Mansour
ArXivPDFHTML

Papers citing "Competitive ratio versus regret minimization: achieving the best of both worlds"

5 / 5 papers shown
Title
Strongly Adaptive Online Learning
Strongly Adaptive Online Learning
Amit Daniely
Alon Gonen
Shai Shalev-Shwartz
ODL
165
178
0
25 Feb 2015
Optimization, Learning, and Games with Predictable Sequences
Optimization, Learning, and Games with Predictable Sequences
Alexander Rakhlin
Karthik Sridharan
95
380
0
08 Nov 2013
Bandits with Switching Costs: T^{2/3} Regret
Bandits with Switching Costs: T^{2/3} Regret
O. Dekel
Jian Ding
Tomer Koren
Yuval Peres
76
98
0
11 Oct 2013
Optimal amortized regret in every interval
Optimal amortized regret in every interval
Rina Panigrahy
P. Popat
53
2
0
29 Apr 2013
Online Learning with Switching Costs and Other Adaptive Adversaries
Online Learning with Switching Costs and Other Adaptive Adversaries
Nicolò Cesa-Bianchi
O. Dekel
Ohad Shamir
88
120
0
18 Feb 2013
1