mlsanityData to 13 Oct 2026

A diffusion-map-based algorithm for gradient computation on manifolds and applications

arXiv 2108.06988 ↗First posted 16 Aug 2021cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

We recover the Riemannian gradient of a given function defined on interior points of a Riemannian submanifold in the Euclidean space based on a sample of function evaluations at points in the submanifold. This approach is based on the estimates of the Laplace-Beltrami operator proposed in the diffusion-maps theory. The Riemannian gradient estimates do not involve differential terms. Analytical convergence results of the Riemannian gradient expansion are proved. We apply the Riemannian gradient estimate in a gradient-based algorithm providing a derivative-free optimization method. We test and validate several applications, including tomographic reconstruction from an unknown random angle distribution, and the sphere packing problem in dimensions 2 and 3.

Key facts. No citing papers in the map yet (data through 13 Oct 2026). Builds on 7 of its 74 references that are in the map. First posted on arXiv 16 Aug 2021.

Builds on

7 of 74 references.

References · 7

  1. 2013Manopt, a Matlab toolbox for optimization on manifoldscited by 112
  2. 2019A Theoretical and Empirical Comparison of Gradient Approximations in Derivative-Free Optimizationcited by 67
  3. 2018Averaging Stochastic Gradient Descent on Riemannian Manifoldscited by 39
  4. 2014Optimization Techniques on Riemannian Manifoldscited by 27
  5. 2021DIRECTGO: A new DIRECT-type MATLAB toolbox for derivative-free global optimizationcited by 5
  6. 2020Manifold Learning for Accelerating Coarse-Grained Optimizationcited by 2
  7. 2018Damped Newton's Method on Riemannian Manifoldscited by 1

Built on by

Not cited yet.