English

On Convergence Lemma and Convergence Stability for Piecewise Analytic Functions

Computer Science and Game Theory 2022-08-12 v3 Artificial Intelligence Machine Learning Numerical Analysis Numerical Analysis Optimization and Control

Abstract

In this work, a convergence lemma for function ff being finite compositions of analytic mappings and the maximum operator is proved. The lemma shows that the set of δ\delta-stationary points near an isolated local minimum point xx^* is shrinking to xx^* as δ0\delta\to 0. It is a natural extension of the version for strongly convex C1C^1 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 CC^\infty mappings makes the lemma false. The proof is based on stratification theorems of semi-analytic sets by {\L}ojasiewicz. An extension of this proof presents a geometric characterization of the set of stationary points of ff. 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 ff is proved. These results together provide a new geometric perspective to study the problem of "where-to-converge" in nonsmooth nonconvex optimization.

Keywords

Cite

@article{arxiv.2204.01643,
  title  = {On Convergence Lemma and Convergence Stability for Piecewise Analytic Functions},
  author = {Xiaotie Deng and Hanyu Li and Ningyuan Li},
  journal= {arXiv preprint arXiv:2204.01643},
  year   = {2022}
}

Comments

24 pages

R2 v1 2026-06-24T10:37:18.508Z