Search arXiv⌕ Search

arXiv · 2212.03321

Model-Free Optimization on Smooth Compact Manifolds: Overcoming Topological Obstructions using Zeroth-Order Hybrid Dynamics

Abstract

Smooth autonomous dynamical systems modeled by ordinary differential equations (ODEs) cannot robustly and globally stabilize a point in compact, boundaryless manifolds. This obstruction, which is topological in nature, implies that traditional smooth optimization dynamics are not able to robustly solve global optimization problems in such spaces. In turn, model-free optimization algorithms, which usually inherit their stability and convergence properties from their model-based counterparts, might also suffer from similar topological obstructions. For example, this is the case in zeroth-order methods and perturbation-based techniques, where gradients and Hessians are usually estimated in real time via measurements or evaluations of the cost function. To address this issue, we introduce a class of hybrid model-free optimization dynamics that combine continuous-time and discrete-time feedback to overcome the obstructions that emerge in traditional ODE-based optimization algorithms evolving on smooth compact manifolds. In particular, we introduce a hybrid controller that switches between different model-free feedback-laws obtained by applying suitable exploratory geodesic dithers to a family of synergistic diffeomorphisms adapted to the cost function that defines the optimization problem. The geodesic dithers enable exploration of the manifold while preserving its forward invariance, a property that is important for many practical applications where physics-based constraints limit the feasible trajectories of the system. The hybrid controller exploits the information obtained from the geodesic dithers to achieve robust global practical stability of the set of minimizers of the cost. The proposed method is of model-free nature since it only requires measurements or evaluations of the cost function. Numerical results are presented to illustrate the main ideas and advantages of the method.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Daniel E. Ochoa, Jorge I. Poveda. 2022-12-06. Model-Free Optimization on Smooth Compact Manifolds: Overcoming Topological Obstructions using Zeroth-Order Hybrid Dynamics. https://arxiv.org/abs/2212.03321

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On the stability of proximal operators in Wasserstein spaces under different notions of convexity

The proximal operator is a fundamental tool in variational analysis and optimization. In the setting of a Hilbert space, given a proper, lower semicontinuous convex functional, its proximal operator is non-expansive, that is, 1-Lipschitz continuous. In the Wasserstein setting, the contraction properties of this operator have been investigated from different perspectives by Carlen and Craig and by Adve and Mészáros, among others, and are not completely understood. In this paper, we study the stability properties of proximal maps, with a particular focus on non-expansivity, under various notions of convexity of the functional that can be considered in the Wasserstein space.

math.OC↗

Symmetry-dependence in Rounding of a Convex Body

The symmetry measure of a convex body $S\subset\mathbb{R}^n$ is given by: $\mathrm{sym}(S):=\max\{α\ge0:\text{ there exists }x\in S\text{ such that }-α(S-x)\subseteq S-x\}$, where such an $x$ is called a Minkowski center. We prove that every convex body $S$ admits a $\sqrt{\frac{n}{\mathrm{sym}(S)}}$-rounding of $S$, namely, there exists an origin-centered ellipsoid $E$ and a center $c$ such that $E\subseteq S-c\subseteq\sqrt{\frac{n}{\mathrm{sym}(S)}}\,E$. This result was conjectured in 2005 by Belloni and Freund. As special cases, this recovers an $n$-rounding of $S$ (since $\mathrm{sym}(S)\ge\frac{1}{n}$), and a $\sqrt{n}$-rounding when $\mathrm{sym}(S)=1$. In the case when $S$ is a polytope given as the convex hull of points, the desired rounding is produced by a regularized minimum-volume covering ellipsoid problem where the regularization is with respect to the Minkowski center. Similarly, when $S$ is a polytope given as the intersection of halfspaces, such a rounding is produced by a regularized maximum-volume inscribed ellipsoid problem. In both of these cases, the rounding can be computed by first solving a linear optimization problem (to compute $\mathrm{sym}(S)$ and a Minkowski center), and then solving a convex optimization problem with a logarithmic determinant objective, second-order cone constraints, and one semidefinite cone constraint. We also show that the factor $\sqrt{\frac{n}{\mathrm{sym}(S)}}$ is nearly tight in its dependence on dimension and symmetry. When $\frac{n+1}{1+\mathrm{sym}(S)}$ is an integer, we show by explicit construction that the factor $\sqrt{\frac{n}{\mathrm{sym}(S)}}$ is tight. In the more general case, for every dimension $n$ and every admissible symmetry value, we construct a polytope $S$ for which every rounding factor is at least $\sqrt{\frac{2}{3}}\sqrt{\frac{n}{\mathrm{sym}(S)}}$.

math.OC↗

Improving the Last-Iterate Guarantees of Anytime Algorithms for Stochastic Monotone Variational Inequalities

We analyze a stochastic algorithm with Halpern-type anchoring for constrained convex-concave problems and monotone variational inequalities. This single-loop and single-call algorithm uses one unbiased sample of the gradient operator at every iteration, to be applicable to monotone games with noisy feedback. With $t$ denoting the iteration counter, we prove an anytime last-iterate convergence rate of $O(t^{-1/4})$ for both the gradient-mapping norm and restricted gap, bypassing the $O(t^{-1/5})$ constrained-anytime bottleneck in the literature. Specializing then to multi-point oracles, we use variance reduction to achieve the $O(t^{-1/2})$ rate with an anytime single-loop algorithm using $2$ samples per iteration. Our results allow constrained problems with a potentially unbounded feasible set; as well as a structured class of stochastic oracles whose variance need not be uniformly bounded.

math.OC↗