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. 2002.03273
  4. Cited By
On the Complexity of Minimizing Convex Finite Sums Without Using the
  Indices of the Individual Functions

On the Complexity of Minimizing Convex Finite Sums Without Using the Indices of the Individual Functions

9 February 2020
Yossi Arjevani
Amit Daniely
Stefanie Jegelka
Hongzhou Lin
ArXivPDFHTML

Papers citing "On the Complexity of Minimizing Convex Finite Sums Without Using the Indices of the Individual Functions"

1 / 1 papers shown
Title
Incremental Majorization-Minimization Optimization with Application to
  Large-Scale Machine Learning
Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning
Julien Mairal
76
317
0
18 Feb 2014
1