Smooth, globally Polyak-ojasiewicz functions are nonlinear least-squares
Abstract
The Polyak-ojasiewicz (P) condition is often invoked in nonconvex optimization because it allows fast convergence of algorithms beyond strong convexity. A function f M R on a Riemannian manifold M is globally P if \|∇ f(x)\|2 ≥ 2μ(f(x) - f*) for all x, where f* = ∈f f and μ > 0. How much does this pointwise, first-order inequality constrain f and its set of minimizers S? We show that if f is also smooth (C∞) and M is contractible (e.g., if M = Rn), then the P condition imposes a firm global structure: such a function is necessarily of the form f(x) = f* + \|(x)\|2 (a nonlinear sum of squares) where M Rk is a submersion, and k is the codimension of S in M. The proof hinges on showing that the end-point map of negative gradient flow on f is a trivial smooth fiber bundle over S. This rigidity leads to a striking dichotomy. Either S is diffeomorphic to a Euclidean space, in which case f can be transformed into a convex quadratic by a smooth change of coordinates. Or S 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 M under which f remains P and becomes geodesically convex.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.