mlsanityData to 7 Oct 2026

On Convergence Lemma and Convergence Stability for Piecewise Analytic Functions

arXiv 2204.01643 ↗First posted 4 Apr 2022cs.GT cs.AI cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

In this work, a convergence lemma for function f being finite compositions of analytic mappings and the maximum operator is proved. The lemma shows that the set of δ-stationary points near an isolated local minimum point x^* is shrinking to x^* as δ→ 0. It is a natural extension of the version for strongly convex C1 functions. However, the correctness of the lemma is subtle. Analytic mappings are necessary for the lemma in the sense that replacing it with differentiable or C^∞ mappings makes the lemma false. The proof is based on stratification theorems of semi-analytic sets by Lojasiewicz. An extension of this proof presents a geometric characterization of the set of stationary points of f. Finally, a notion of stability on stationary points, called convergence stability, is proposed. It asks, under small numerical errors, whether a reasonable convergent optimization method started near a stationary point should eventually converge to the same stationary point. The concept of convergence stability becomes nontrivial qualitatively only when the objective function is both nonsmooth and nonconvex. Via the convergence lemma, an intuitive equivalent condition for convergence stability of f is proved. These results together provide a new geometric perspective to study the problem of "where-to-converge" in nonsmooth nonconvex optimization.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 9 of its 40 references that are in the map. First posted on arXiv 4 Apr 2022.

Builds on

9 of 40 references.

References · 9

  1. 2017Attention Is All You Needcited by 59,932
  2. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  3. 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
  4. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
  5. 2021Convex optimizationcited by 2,479
  6. 2018A Convergence Theory for Deep Learning via Over-Parameterizationcited by 784
  7. 2018Gradient Descent Provably Optimizes Over-parameterized Neural Networkscited by 655
  8. 2018Gradient Descent Finds Global Minima of Deep Neural Networkscited by 572
  9. 2020Pooling Methods in Deep Neural Networks, a Reviewcited by 52

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.