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.09369
  4. Cited By
Minimax Optimal Online Stochastic Learning for Sequences of Convex
  Functions under Sub-Gradient Observation Failures

Minimax Optimal Online Stochastic Learning for Sequences of Convex Functions under Sub-Gradient Observation Failures

19 April 2019
Hakan Gokcesu
Suleyman S. Kozat
ArXiv (abs)PDFHTML

Papers citing "Minimax Optimal Online Stochastic Learning for Sequences of Convex Functions under Sub-Gradient Observation Failures"

1 / 1 papers shown
Title
Universal Online Convex Optimization with Minimax Optimal Second-Order
  Dynamic Regret
Universal Online Convex Optimization with Minimax Optimal Second-Order Dynamic Regret
Hakan Gokcesu
Suleyman S. Kozat
62
1
0
30 Jun 2019
1