paper

Smooth, globally Polyak-Łojasiewicz functions are nonlinear least-squares

arXiv:2604.07972

Abstract

The Polyak-Łojasiewicz (PŁ) condition is often invoked in nonconvex optimization because it allows fast convergence of algorithms beyond strong convexity. A function on a Riemannian manifold is globally PŁ if for all , where and . How much does this pointwise, first-order inequality constrain and its set of minimizers ? We show that if is also smooth () and is contractible (e.g., if ), then the PŁ condition imposes a firm global structure: such a function is necessarily of the form (a nonlinear sum of squares) where is a submersion, and is the codimension of in . The proof hinges on showing that the end-point map of negative gradient flow on is a trivial smooth fiber bundle over . This rigidity leads to a striking dichotomy. Either is diffeomorphic to a Euclidean space, in which case can be transformed into a convex quadratic by a smooth change of coordinates. Or must display genuinely exotic geometry; for example, it can be diffeomorphic to the Whitehead manifold. As a further consequence, we show that there exists a complete Riemannian metric on under which remains PŁ and becomes geodesically convex.

34 pages + 12 pages of appendices and references

Smooth, globally Polyak-Łojasiewicz functions are nonlinear least-squares · wovepaper