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. 1304.0740
  4. Cited By
O(logT) Projections for Stochastic Optimization of Smooth and Strongly
  Convex Functions

O(logT) Projections for Stochastic Optimization of Smooth and Strongly Convex Functions

2 April 2013
Lijun Zhang
Tianbao Yang
Rong Jin
Xiaofei He
ArXiv (abs)PDFHTML

Papers citing "O(logT) Projections for Stochastic Optimization of Smooth and Strongly Convex Functions"

2 / 2 papers shown
Title
Better Mini-Batch Algorithms via Accelerated Gradient Methods
Better Mini-Batch Algorithms via Accelerated Gradient Methods
Andrew Cotter
Ohad Shamir
Nathan Srebro
Karthik Sridharan
ODL
120
315
0
22 Jun 2011
Information-theoretic lower bounds on the oracle complexity of
  stochastic convex optimization
Information-theoretic lower bounds on the oracle complexity of stochastic convex optimization
Alekh Agarwal
Peter L. Bartlett
Pradeep Ravikumar
Martin J. Wainwright
202
251
0
03 Sep 2010
1