Atomic Gradient Flows: Gradient Flows on Sparse Representations
Christian Amend, Marcello Carioni, Konstantinos Zemas

TL;DR
This paper introduces Atomic Gradient Flows (AGFs), a generalization of Particle Gradient Flows, for convex optimization in Banach spaces, enabling efficient sparse representations and extending applications to infinite-dimensional problems.
Contribution
It develops a new framework for gradient flows on sparse representations in Banach spaces, using extremal points and Wasserstein space lifting, with theoretical guarantees and practical applications.
Findings
AGFs are well-defined and consistent with original problems via $ extGamma$-convergence.
The lifted AGF evolution is a metric gradient flow in Wasserstein space.
Applicable to infinite-dimensional problems like functions of bounded variation.
Abstract
One of the most popular approaches for solving total variation-regularized optimization problems in the space of measures are Particle Gradient Flows (PGFs). These restrict the problem to linear combinations of Dirac deltas and then perform a Euclidean gradient flow in the weights and positions, significantly reducing the computational cost while still decreasing the energy. In this work, we generalize PGFs to convex optimization problems in arbitrary Banach spaces, which we call Atomic Gradient Flows (AGFs). To this end, the crucial ingredient turns out to be the right notion of particles, chosen here as the extremal points of the unit ball of the regularizer. This choice is motivated by the Krein-Milman theorem, which ensures that minimizers can be approximated by linear combinations of extremal points. We investigate metric gradient flows of the optimization problem when restricted…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
