Publication

An Efficient Sampling Algorithm for Non-smooth Composite Potentials

Publications associées (33)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

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

An Efficient Sampling Algorithm for Non-smooth Composite Potentials

Graph Chatbot

Chattez avec Graph Search

Gibbs sampling the posterior of neural networks

Finding stationary points on bounded-rank matrices: a geometric hurdle and a smooth remedy

Spectral analysis for transmission eigenvalue problems with and without the complementing conditions

Forward-Backward Splitting for Optimal Transport Based Problems

A critically degenerate elliptic Dirichlet problem, spectral theory and bifurcation

On the asymptotic behavior of the solutions to parabolic variational inequalities

Log Barriers for Safe Non-convex Black-box Optimization

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

Efficient Greedy Coordinate Descent for Composite Problems

Fast Automatic Smoothing for Generalized Additive Models

Gibbs sampling the posterior of neural networks

Finding stationary points on bounded-rank matrices: a geometric hurdle and a smooth remedy

On the asymptotic behavior of the solutions to parabolic variational inequalities

Efficient Greedy Coordinate Descent for Composite Problems

Spectral analysis for transmission eigenvalue problems with and without the complementing conditions

A critically degenerate elliptic Dirichlet problem, spectral theory and bifurcation

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

Forward-Backward Splitting for Optimal Transport Based Problems

Fast Automatic Smoothing for Generalized Additive Models

Log Barriers for Safe Non-convex Black-box Optimization