Variational PDEs for Acceleration on Manifolds and Application to Diffeomorphisms
We consider the optimization of cost functionals on manifolds and derive a variational approach to accelerated methods on manifolds. We demonstrate the methodology on the infinite-dimensional manifold of diffeomorphisms, motivated by registration problems in computer vision. We build on the variational approach to accelerated optimization by Wibisono, Wilson and Jordan, which applies in finite dimensions, and generalize that approach to infinite dimensional manifolds. We derive the continuum evolution equations, which are partial differential equations (PDE), and relate them to simple mechanical principles. Our approach can also be viewed as a generalization of the $L^2$ optimal mass transport problem. Our approach evolves an infinite number of particles endowed with mass, represented as a mass density. The density evolves with the optimization variable, and endows the particles with dynamics. This is different than current accelerated methods where only a single particle moves and hence the dynamics does not depend on the mass. We derive the theory, compute the PDEs for acceleration, and illustrate the behavior of this new accelerated optimization scheme.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Accelerated Optimization in the PDE Framework: Formulations for the Manifold of Diffeomorphisms
We consider the problem of optimization of cost functionals on the infinite-dimensional manifold of diffeomorphisms. We present a new class of optimization methods, valid for any optimization problem setup on the space o…
Optical Flow EstimationvalidInterpretable Image Clustering via Diffeomorphism-Aware K-Means
We design an interpretable clustering algorithm aware of the nonlinear structure of image manifolds. Our approach leverages the interpretability of $K$-means applied in the image space while addressing its clustering per…
ClusteringImage ClusteringVariational point-obstacle avoidance on Riemannian manifolds
In this letter we study variational obstacle avoidance problems on complete Riemannian manifolds. The problem consists of minimizing an energy functional depending on the velocity, covariant acceleration and a repulsive …
Parallel transport in shape analysis: a scalable numerical scheme
The analysis of manifold-valued data requires efficient tools from Riemannian geometry to cope with the computational complexity at stake. This complexity arises from the always-increasing dimension of the data, and the …
Deep Invertible Approximation of Topologically Rich Maps between Manifolds
How can we design neural networks that allow for stable universal approximation of maps between topologically interesting manifolds? The answer is with a coordinate projection. Neural networks based on topological data a…
Topological Data Analysis