First-order methods almost always avoid strict saddle points (Q2425175): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1710.07406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of the Iterates of Descent Methods for Analytic Cost Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5433140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Extrinsic Look at the Riemannian Hessian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projection-like Retractions on Matrix Manifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Fields and Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Matrices and Complexity of Spin Glasses / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-Order Methods in Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal alternating linearized minimization for nonconvex and nonsmooth problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal rates of convergence for noisy sparse phase retrieval via thresholded Wirtinger flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phase Retrieval via Wirtinger Flow: Theory and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trust Region Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton-type methods for unconstrained and linearly constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Completion From a Few Entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplicative updates outperform generic no-regret learning in congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Projections on Manifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamics of games and genes: Discrete versus continuous time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the use of directions of negative curvature in a modified newton method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some NP-complete problems in quadratic and nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introductory lectures on convex optimization. A basic course. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cubic regularization of Newton method and its global performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient Descent Only Converges to Minimizers: Non-Isolated Critical Points and Invariant Regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonconvergence to unstable points in urn models and stochastic approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Analysis of Second-Order Line-Search Algorithms for Smooth Nonconvex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3744918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Insights Into the Optimization Landscape of Over-Parameterized Shallow Neural Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete Dictionary Recovery Over the Sphere II: Recovery by Riemannian Trust-Region Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3188030 / rank
 
Normal rank

Latest revision as of 16:30, 19 July 2024

scientific article
Language Label Description Also known as
English
First-order methods almost always avoid strict saddle points
scientific article

    Statements

    First-order methods almost always avoid strict saddle points (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    26 June 2019
    0 references
    gradient descent
    0 references
    smooth optimization
    0 references
    saddle points
    0 references
    local minimum
    0 references
    dynamical systems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers