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. 1802.04623
  4. Cited By
Logarithmic Regret for Online Gradient Descent Beyond Strong Convexity
v1v2 (latest)

Logarithmic Regret for Online Gradient Descent Beyond Strong Convexity

13 February 2018
Dan Garber
ArXiv (abs)PDFHTML

Papers citing "Logarithmic Regret for Online Gradient Descent Beyond Strong Convexity"

5 / 5 papers shown
Title
On Corruption-Robustness in Performative Reinforcement Learning
On Corruption-Robustness in Performative Reinforcement Learning
Vasilis Pollatos
Debmalya Mandal
Goran Radanović
199
2
0
08 May 2025
Faster Projection-Free Augmented Lagrangian Methods via Weak Proximal
  Oracle
Faster Projection-Free Augmented Lagrangian Methods via Weak Proximal Oracle
Dan Garber
Tsur Livney
Shoham Sabach
33
2
0
25 Oct 2022
Frank-Wolfe with a Nearest Extreme Point Oracle
Frank-Wolfe with a Nearest Extreme Point Oracle
Dan Garber
Noam Wolf
61
9
0
03 Feb 2021
Autoregressive Knowledge Distillation through Imitation Learning
Autoregressive Knowledge Distillation through Imitation Learning
Alexander Lin
Jeremy Wohlwend
Howard Chen
Tao Lei
107
40
0
15 Sep 2020
Revisiting Frank-Wolfe for Polytopes: Strict Complementarity and
  Sparsity
Revisiting Frank-Wolfe for Polytopes: Strict Complementarity and Sparsity
Dan Garber
64
22
0
31 May 2020
1