SearcharxivSearch

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

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC