Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"Strict saddle points"”.

  1. Complexity, conditioning, and saddle avoidance in nonsmooth optimization

    … guarantees, we turn to the question of escaping saddle points of nonsmooth functions. Recent work has shown that stochastically perturbed gradient methods can efficiently strict saddle points of smooth functions. We extend this body of work to nonsmooth optimization, by analyzing an inexact …

    cornell Repository record for Complexity, conditioning, and saddle avoidance in nonsmooth optimization (opens in a new tab)

  2. Mathematical Analysis of High-Dimensional Algorithms and Models

    … that the algorithm almost surely escapes from strict saddle points and converges to local minima for nonconvex optimization. The proof is based on viewing the randomized algorithm as a nonlinear random dynamical system and a quantitative finite block analysis of its linearization around saddle …

    duke Repository record for Mathematical Analysis of High-Dimensional Algorithms and Models (opens in a new tab)

  3. Bilinear inverse problems with sparsity: Optimal identifiability conditions and efficient recovery

    … to an inherent sign and shift ambiguity, and all saddle points have strictly negative curvatures. This geometric structure allows successful recovery of $f$ and $x_i$ using a simple manifold gradient descent algorithm with random initialization. Our theoretical findings are complemented by …

    uiuc Repository record for Bilinear inverse problems with sparsity: Optimal identifiability conditions and efficient recovery (opens in a new tab)