Riemannian KL Property Analysis
- The Riemannian KL property is a regularity condition on geodesically complete manifolds that guarantees a gradient–suboptimality differential inequality near critical points.
- It underpins convergence theorems for manifold-based algorithms, including proximal and steepest descent methods, by providing explicit linear or sublinear rate estimates.
- This property extends classical KL results to nonconvex, nonsmooth functions, enabling robust and predictable convergence analysis across diverse optimization problems.
The Riemannian Kurdyka–Łojasiewicz (KL) property extends the key regularity phenomenon underlying sharp global and local convergence of descent-type algorithms from the classical Euclidean to the Riemannian manifold context. It guarantees, for a large class of nonconvex and possibly nonsmooth functions on geodesically complete Riemannian manifolds, a powerful gradient–suboptimality differential inequality near critical points, governing the interplay between residuals and step sizes within iterative optimization schemes. The Riemannian KL property now underpins a host of abstract and algorithmic convergence theorems for inexact proximal, projected, and steepest descent methods on manifolds, and, crucially, provides explicit rates that depend on the KL exponent.
1. Subdifferentials, Gradients, and Quasi-Distances on Riemannian Manifolds
Let denote an -dimensional complete Riemannian manifold with metric , distance , and geodesic structure. For , proper and lower semicontinuous (lsc), the relevant first-order objects are:
- Fréchet subdifferential at :
- Limiting subdifferential:
- Critical points are such that .
A quasi-distance 0 satisfies
- 1,
- 2, continuity in the second argument.
The Riemannian gradient 3 at 4 satisfies 5 for all 6.
2. Formal Statement of the Riemannian KL Property
Given a proper lsc 7 and a critical point 8, 9 is said to have the Kurdyka–Łojasiewicz property at 0 if there exist:
- 1,
- geodesically convex neighborhood 2 of 3,
- 4, continuous, concave, 5 on 6 with 7 and 8,
such that for all 9 with 0,
1
or, in the subdifferential form,
2
A global KL function satisfies this property at every point of 3 (Bento et al., 2011, Yu et al., 10 Feb 2025).
3. Classes of Functions and Manifold Requirements
The Riemannian KL property is guaranteed for key function classes:
- Analytic functions on analytic manifolds (classical Łojasiewicz setup).
- Definable functions in an o-minimal structure (semi-algebraic, subanalytic, restricted analytic, etc.).
- Morse functions (4 with nondegenerate critical points): KL with exponent 5.
- Nonsmooth, lower-semicontinuous definable functions on definable submanifolds.
For algorithmic convergence, manifold requirements depend on method:
- Proximal-point: 6 must be complete (no curvature sign constraint), Hopf–Rinow applies.
- Steepest descent: 7 assumed Hadamard (complete, simply connected, nonpositive sectional curvature; unique minimizing geodesics and global exponential map) (Bento et al., 2011, Yu et al., 10 Feb 2025).
4. KL Property, Exponent, and Desingularizing Functions
A typical desingularizing function is 8 with 9, 0. The key inequality becomes:
1
for some 2. The exponent 3 quantifies critical point sharpness:
- 4: “sharp” case—finite-step convergence.
- 5: local linear convergence rate for descent methods.
- 6: local sublinear rate, specifically 7.
For composite or structured potentials (e.g., in ManPPA), KL exponents propagate: if a primal potential 8 has exponent 9, so does an auxiliary lifted potential 0, and conversely under additional regularity (Yu et al., 10 Feb 2025).
5. KL Property and Convergence of Descent Methods
The KL property is pivotal for establishing full-sequence convergence in inexact (possibly non-Euclidean) descent algorithms, as shown in (Bento et al., 2011, Yu et al., 10 Feb 2025). The abstract convergence framework employs:
- Proximal-point methods: For a sequence 1 generated via
2
3
boundedness and compactness in 4 yield convergence of 5 to a critical point.
- Steepest descent (smooth, 6-Lipschitz gradient): For 7,
8
9
With 0 (the Riemannian distance), on Hadamard manifolds, this applies to exponential-mapped iterates with Armijo or fixed-step rules.
Fundamental technical estimates, such as
1
ensure iterates remain in a KL ball and the steps sum to a finite total, so the full sequence converges (Bento et al., 2011).
6. Application: Manifold Proximal Point and Related Algorithms
For constrained and structured problems, the Riemannian KL property enables convergence analysis of manifold-based algorithms such as the Manifold Proximal Point Algorithm (ManPPA). For instance, on 2 (unit sphere),
3
with 4 a concave regularizer, KL analysis applies both to the primal objective 5 and to lifted auxiliary potentials 6. Concrete residual-step bounds and descent inequalities facilitate direct application of the abstract KL convergence theorems, guaranteeing:
- Global convergence of the sequence to a critical point.
- Explicit linear or sublinear rates determined by the KL exponent 7.
- Finite-step convergence when 8, such as in the weak-sharp minima setting.
The propagation and equivalence of KL exponents between potential functions are established for key problem classes, making rate conclusions robust to various reformulations (Yu et al., 10 Feb 2025).
7. Examples and Scope of KL Functions on Manifolds
The class of KL functions on manifolds is broad, encompassing:
- Real-analytic functions on analytic manifolds (guaranteed classical Łojasiewicz property).
- Definable functions (semi-algebraic, subanalytic, restricted analytic) on definable submanifolds, ensuring the KL property via o-minimal structure theory.
- Morse functions: Smooth objectives with nondegenerate critical points, with exponent 9.
- Nonsmooth, prox-regular, semialgebraic functions—ubiquitous in composite optimization, statistical estimation, and signal processing on manifolds (Bento et al., 2011, Yu et al., 10 Feb 2025).
The Riemannian KL property thereby serves as the geometric-analytic backbone for convergence analysis, rate guarantees, and regularity theory of nonconvex optimization across a broad swath of smooth and nondifferentiable problems on manifolds.