ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2010.06642
  4. Cited By
High-Order Oracle Complexity of Smooth and Strongly Convex Optimization
v1v2 (latest)

High-Order Oracle Complexity of Smooth and Strongly Convex Optimization

13 October 2020
Guy Kornowski
Ohad Shamir
ArXiv (abs)PDFHTML

Papers citing "High-Order Oracle Complexity of Smooth and Strongly Convex Optimization"

4 / 4 papers shown
Title
Tight Lower Bounds under Asymmetric High-Order Hölder Smoothness and Uniform Convexity
Tight Lower Bounds under Asymmetric High-Order Hölder Smoothness and Uniform ConvexityInternational Conference on Learning Representations (ICLR), 2024
Site Bai
Brian Bullins
233
2
0
16 Sep 2024
Stochastic Newton Proximal Extragradient Method
Stochastic Newton Proximal Extragradient Method
Ruichen Jiang
Michal Dereziñski
Aryan Mokhtari
96
0
0
03 Jun 2024
Perseus: A Simple and Optimal High-Order Method for Variational
  Inequalities
Perseus: A Simple and Optimal High-Order Method for Variational InequalitiesMathematical programming (Math. Program.), 2022
Tianyi Lin
Michael I. Jordan
737
20
0
06 May 2022
Generalized Optimistic Methods for Convex-Concave Saddle Point Problems
Generalized Optimistic Methods for Convex-Concave Saddle Point Problems
Ruichen Jiang
Aryan Mokhtari
206
40
0
19 Feb 2022
1