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. 2103.05138
  4. Cited By
On the Oracle Complexity of Higher-Order Smooth Non-Convex Finite-Sum
  Optimization

On the Oracle Complexity of Higher-Order Smooth Non-Convex Finite-Sum Optimization

8 March 2021
N. Emmenegger
Rasmus Kyng
Ahad N. Zehmakan
ArXivPDFHTML

Papers citing "On the Oracle Complexity of Higher-Order Smooth Non-Convex Finite-Sum Optimization"

5 / 5 papers shown
Title
The Min-Max Complexity of Distributed Stochastic Convex Optimization
  with Intermittent Communication
The Min-Max Complexity of Distributed Stochastic Convex Optimization with Intermittent Communication
Blake E. Woodworth
Brian Bullins
Ohad Shamir
Nathan Srebro
33
49
0
02 Feb 2021
Second-Order Information in Non-Convex Stochastic Optimization: Power
  and Limitations
Second-Order Information in Non-Convex Stochastic Optimization: Power and Limitations
Yossi Arjevani
Y. Carmon
John C. Duchi
Dylan J. Foster
Ayush Sekhari
Karthik Sridharan
112
53
0
24 Jun 2020
Stochastic Recursive Variance-Reduced Cubic Regularization Methods
Stochastic Recursive Variance-Reduced Cubic Regularization Methods
Dongruo Zhou
Quanquan Gu
57
26
0
31 Jan 2019
SPIDER: Near-Optimal Non-Convex Optimization via Stochastic Path
  Integrated Differential Estimator
SPIDER: Near-Optimal Non-Convex Optimization via Stochastic Path Integrated Differential Estimator
Cong Fang
C. J. Li
Zhouchen Lin
Tong Zhang
87
577
0
04 Jul 2018
Sub-sampled Cubic Regularization for Non-convex Optimization
Sub-sampled Cubic Regularization for Non-convex Optimization
Jonas Köhler
Aurelien Lucchi
54
167
0
16 May 2017
1