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. 1111.6082
  4. Cited By
Trading Regret for Efficiency: Online Convex Optimization with Long Term
  Constraints

Trading Regret for Efficiency: Online Convex Optimization with Long Term Constraints

25 November 2011
M. Mahdavi
Rong Jin
Tianbao Yang
ArXivPDFHTML

Papers citing "Trading Regret for Efficiency: Online Convex Optimization with Long Term Constraints"

2 / 2 papers shown
Title
Doubly-Bounded Queue for Constrained Online Learning: Keeping Pace with Dynamics of Both Loss and Constraint
Doubly-Bounded Queue for Constrained Online Learning: Keeping Pace with Dynamics of Both Loss and Constraint
Juncheng Wang
Bingjie Yan
Yituo Liu
155
0
0
14 Dec 2024
A Stochastic View of Optimal Regret through Minimax Duality
A Stochastic View of Optimal Regret through Minimax Duality
Jacob D. Abernethy
Alekh Agarwal
Peter L. Bartlett
Alexander Rakhlin
50
95
0
30 Mar 2009
1