Sparse optimization on measures with over-parameterized gradient descent
From MaRDI portal
Publication:2149558
DOI10.1007/s10107-021-01636-zzbMath1494.90082arXiv1907.10300OpenAlexW3158438262MaRDI QIDQ2149558
Publication date: 29 June 2022
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.10300
Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Numerical methods based on nonlinear programming (49M37)
Related Items (4)
On the uniqueness of solutions for the basis pursuit in the continuum ⋮ A rigorous framework for the mean field limit of multilayer neural networks ⋮ Regularizing Orientation Estimation in Cryogenic Electron Microscopy Three-Dimensional Map Refinement through Measure-Based Lifting over Riemannian Manifolds ⋮ Convergence analysis for gradient flows in the training of artificial neural networks with ReLU activation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact reconstruction using Beurling minimal extrapolation
- Poincaré and logarithmic Sobolev inequalities by decomposition of the energy landscape
- Exact support recovery for sparse spikes deconvolution
- Probabilistic representation and uniqueness results for measure-valued solutions of transport equations
- A family of functional inequalities: Łojasiewicz inequalities and displacement convex functions
- A new optimal transport distance on the space of finite Radon measures
- Optimal entropy-transport problems and a new Hellinger-Kantorovich distance between positive measures
- An interpolating distance between optimal transport and Fisher-Rao metrics
- Unbalanced optimal transport: dynamic and Kantorovich formulations
- Natural gradient via optimal transport
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Accelerated information gradient flow
- On the linear convergence rates of exchange and continuous methods for total variation minimization
- Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance
- Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
- Sparse Modeling for Image and Vision Processing
- Optimization with Sparsity-Inducing Penalties
- Exact Solutions to Super Resolution on Semi-Algebraic Domains in Higher Dimensions
- On the Rate of Convergence of Empirical Measures in ∞-transportation Distance
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Inverse problems in spaces of measures
- A mean field view of the landscape of two-layer neural networks
- The basins of attraction of the global minimizers of the non-convex sparse spike estimation problem
- Exact solutions of infinite dimensional total-variation regularized problems
- The sliding Frank–Wolfe algorithm and its application to super-resolution microscopy
- Mean Field Analysis of Neural Networks: A Law of Large Numbers
- On Representer Theorems and Convex Regularization
- Kurdyka–Łojasiewicz–Simon inequality for gradient flows in metric spaces
- Compressed Sensing Off the Grid
- Breaking the Curse of Dimensionality with Convex Neural Networks
- Towards a Mathematical Theory of Super‐resolution
- The Alternating Descent Conditional Gradient Method for Sparse Inverse Problems
- A JKO Splitting Scheme for Kantorovich--Fisher--Rao Gradient Flows
- Positive trigonometric polynomials and signal processing applications
This page was built for publication: Sparse optimization on measures with over-parameterized gradient descent
