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 Serdar Kozat
ArXivPDFHTML

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

1 / 1 papers shown
Title
(Bandit) Convex Optimization with Biased Noisy Gradient Oracles
(Bandit) Convex Optimization with Biased Noisy Gradient Oracles
Xiaowei Hu
A. PrashanthL.
András Gyorgy
Csaba Szepesvári
84
66
0
22 Sep 2016
1