Publication

Is there an analog of Nesterov acceleration for gradient-based MCMC?

Related publications (49)

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.

, ,

The aim of this work is to provide bounds connecting two probability measures of the same event using Rényi

\alpha

-Divergences and Sibson’s

\alpha

-Mutual Information, a generalization of respectively the Kullback-Leibler Divergence and Shannon’s Mutual ...

ETHZ2020

Is there an analog of Nesterov acceleration for gradient-based MCMC?

Graph Chatbot

Chat with Graph Search

Spatiotemporal energy-density distribution of time-reversed electromagnetic fields

On the Double Descent of Random Features Models Trained with SGD

Lower-bounds on the Bayesian Risk in Estimation Procedures via f–Divergences

Hidden-nucleons neural-network quantum states for the nuclear many-body problem

Generalization Error Bounds Via Rényi-, f-Divergences and Maximal Leakage

Locally Differentially-Private Randomized Response for Discrete Distribution Learning

Robust Generalization via f−Mutual Information

Collaborative Sampling in Generative Adversarial Networks