No article text was recorded for this version.
Hessian smoothness constraints
Version 1 of 129 papers31 conceptsfrozen 2026-10-04
Papers in this version
- Blog: First-order Stochastic Algorithms for Escaping From Saddle Points in Almost Linear Time
- Blog: Parameter-Free Accelerated Gradient Descent for Nonconvex Minimization
- Blog: The Complexity of Finding Stationary Points with Stochastic Gradient Descent
- Blog: Improved Discretization Analysis for Underdamped Langevin Monte Carlo
- Blog: Faster Gradient-Free Methods for Escaping Saddle Points
- Blog: Convergence of First-Order Algorithms for Meta-Learning with Moreau Envelopes
- Blog: Inference of Online Newton Methods with Nesterov's Accelerated Sketching
- Blog: CORE: Common Random Reconstruction for Distributed Optimization with Provable Low Communication Complexity
- Blog: Convergence Rates for the Stochastic Gradient Descent Method for Non-Convex Objective Functions
- Blog: Mirror Descent Algorithms with Nearly Dimension-Independent Rates for Differentially-Private Stochastic Saddle-Point Problems extended abstract
- Blog: Reducing the variance in online optimization by transporting past gradients
- Blog: Debiasing Distributed Second Order Optimization with Surrogate Sketching and Scaled Regularization
- Blog: Stochastic Extragradient with Flip-Flop Shuffling & Anchoring: Provable Improvements
- Blog: Accelerated Methods for Non-Convex Optimization
- Blog: Finding Approximate Local Minima for Nonconvex Optimization in Linear Time
- Blog: Stagewise Training Accelerates Convergence of Testing Error Over SGD
- Blog: Nearly Tight Bounds for the Continuum-Armed Bandit Problem
- Blog: On Finding Small Hyper-Gradients in Bilevel Optimization: Hardness Results and Improved Analysis
- Blog: A globally convergent proximal Newton-type method in nonsmooth convex optimization
- Blog: Stochastic Recursive Variance-Reduced Cubic Regularization Methods
- Blog: Optimization with Access to Auxiliary Information
- Blog: Beyond Nonconvexity: A Universal Trust-Region Method with New Analyses
- Blog: Complexity Guarantees for Nonconvex Newton-MR Under Inexact Hessian Information
- Blog: Utilizing Second Order Information in Minibatch Stochastic Variance Reduced Proximal Iterations
- Blog: On the Sample Complexity of Lipschitz Constant Estimation
- Blog: Escaping Saddle Points with Adaptive Gradient Methods
- Blog: NEON2: Finding Local Minima via First-Order Oracles
- Blog: Approximate Newton Methods and Their Local Convergence
- Blog: A Regularized Newton Method for Nonconvex Optimization with Global and Local Complexity Guarantees
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_hessian_smoothness_constraints_c3ceb50c,
title = {Hessian smoothness constraints},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/hessian-smoothness-constraints/rdr_c3ceb50cb05840ec80720f9bd752c2be},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_hessian_smoothness_constraints_c3ceb50c_v1,
title = {Hessian smoothness constraints},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/hessian-smoothness-constraints/rdr_c3ceb50cb05840ec80720f9bd752c2be/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}