Concept

Curvature of Riemannian manifolds

Related publications (167)

Escaping from saddle points on Riemannian manifolds

Nicolas Henri Bernard Flammarion, Yue Sun

We consider minimizing a nonconvex, smooth function f on a Riemannian manifold M. We show that a perturbed version of Riemannian gradient descent algorithm converges to a second-order stationary point (and hence is able to escape saddle points on the manif ...

2019

A Gauss-Bonnet Theorem for Asymptotically Conical Manifolds and Manifolds with Conical Singularities

Adrien Giuliano Marcone

The purpose of this thesis is to provide an intrinsic proof of a Gauss-Bonnet-Chern formula for complete Riemannian manifolds with finitely many conical singularities and asymptotically conical ends. A geometric invariant is associated to the link of both ...

EPFL2019

Some regularity results for p-harmonic mappings between Riemannian manifolds

Changyu Guo

Let M be a C-2-smooth Riemannian manifold with boundary and N a complete C-2-smooth Riemannian manifold. We show that each stationary p-harmonic mapping u: M -> N, whose image lies in a compact subset of N, is locally C-1,C-alpha for some alpha is an eleme ...

2019

Improved Bounds for Discretization of Langevin Diffusions: Near-Optimal Rates without Convexity

Nicolas Henri Bernard Flammarion

We consider minimizing a nonconvex, smooth function

f

on a Riemannian manifold

\mathcal{M}

. We show that a perturbed version of Riemannian gradient descent algorithm converges to a second-order stationary point (and hence is able to escape saddle point ...

2019

Renormalization of quantum field theory on Riemannian manifolds

In this paper, we provide a simple pedagogical proof of the existence of covariant renormalizations in Euclidean perturbative quantum field theory on closed Riemannian manifolds, following the Epstein–Glaser philosophy. We rely on a local method that allow ...

2019

Bayesian Optimization Meets Riemannian Manifolds in Robot Learning

Sylvain Calinon, Noémie Laure Gwendoline Jaquier

Bayesian optimization (BO) recently became popular in robotics to optimize control parameters and parametric policies in direct reinforcement learning due to its data efficiency and gradient-free approach. However, its performance may be seriously compromi ...

2019

Warped tori with almost non-negative scalar curvature

Davide Parise

For sequences of warped product metrics on a 3-torus satisfying the scalar curvature bound Rj = -1j, uniform upper volume and diameter bounds, and a uniform lower area bound on the smallest minimal surface, we find a subsequence which converges in both the ...

SPRINGER2019

Steady Three-Dimensional Rotational Flows: An Approach Via Two Stream Functions And Nash-Moser Iteration

Boris Buffoni

We consider the stationary flow of an inviscid and incompressible fluid of constant density in the region D = (0, L) x R-2. We are concerned with flows that are periodic in the second and third variables and that have prescribed flux through each point of ...

MATHEMATICAL SCIENCE PUBL2019

Manifold Learning and Optimal Control for Obstacle Avoidance in Autonomous Driving

Colin Neil Jones, Sanket Sanjay Diwale

A novel manifold learning approach is presented to incorporate computationally efficient obstacle avoidance constraints in optimal control algorithms. The method presented provides a significant computational benefit by reducing the number of constraints r ...

2019

Averaging Stochastic Gradient Descent on Riemannian Manifolds

Nicolas Henri Bernard Flammarion

We propose an estimator for the mean of a random vector in Rd that can be computed in time O(n3.5 + n2d) for n i.i.d. samples and that has error bounds matching the sub-Gaussian case. The only assumptions we make about the data distribution are that it has ...

2018

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.

Improved Bounds for Discretization of Langevin Diffusions: Near-Optimal Rates without Convexity

Nicolas Henri Bernard Flammarion

We consider minimizing a nonconvex, smooth function

f

on a Riemannian manifold

\mathcal{M}

. We show that a perturbed version of Riemannian gradient descent algorithm converges to a second-order stationary point (and hence is able to escape saddle point ...

2019