Escaping from saddle points on Riemannian manifolds
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
We revisit the problem of extending the notion of principal component analysis (PCA) to multivariate datasets that satisfy nonlinear constraints, therefore lying on Riemannian manifolds. Our aim is to determine curves on the manifold that retain their cano ...
The purpose of this paper is to give a self-contained proof that a complete manifold with more than one end never supports an L-q,L-p-Sobolev inequality (2
We propose a segmentation method based on the geometric representation of images as two-dimensional manifolds embedded in a higher dimensional space. The segmentation is formulated as a minimization problem, where the contours are described by a level set ...
Institute of Electrical and Electronics Engineers2014
We consider total variation (TV) minimization for manifold-valued data. We propose a cyclic proximal point algorithm and a parallel proximal point algorithm to minimize TV functionals with l(p) -type data terms in the manifold case. These algorithms are ba ...
Numerous dimensionality reduction problems in data analysis involve the recovery of low-dimensional models or the learning of manifolds underlying sets of data. Many manifold learning methods require the estimation of the tangent space of the manifold at a ...
Feature descriptors play a crucial role in a wide range of geometry analysis and processing applications, including shape correspondence, retrieval, and segmentation. In this paper, we propose ShapeNet, a generalization of the popular convolutional neural ...
The matrix completion problem consists of finding or approximating a low-rank matrix based on a few samples of this matrix. We propose a new algorithm for matrix completion that minimizes the least-square distance on the sampling set over the Riemannian ma ...
Fluid bridges are ubiquitous soft structures of finite size that conform to and link the surfaces of neighboring objects. Fluid joints, the specific type of fluid bridge with at least one extremity constrained laterally, display even more pronounced reacti ...
We prove upper bounds for Hecke-Laplace eigenfunctions on certain Riemannian manifolds X of arithmetic type, uniformly in the eigenvalue and the volume of the manifold. The manifolds under consideration are d-fold products of 2-spheres or 3-spheres, realiz ...
This thesis is a study of harmonic maps in two different settings. The first part is concerned with harmonic maps from smooth metric measure spaces to Riemannian manifolds. The second part is study of harmonic maps from Riemannian polyhedra to non-positive ...
