scientific article; zbMATH DE number 7014196
From MaRDI portal
Publication:4617601
zbMath1406.60114arXiv1705.09048MaRDI QIDQ4617601
Bartlett, Peter L., Xiang Cheng
Publication date: 6 February 2019
Full work available at URL: https://arxiv.org/abs/1705.09048
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (20)
Oracle lower bounds for stochastic gradient sampling algorithms ⋮ Improved bounds for discretization of Langevin diffusions: near-optimal rates without convexity ⋮ Particle dual averaging: optimization of mean field neural network with global convergence rate analysis* ⋮ Unnamed Item ⋮ Nonasymptotic bounds for sampling algorithms without log-concavity ⋮ On sampling from a log-concave density using kinetic Langevin diffusions ⋮ ALMOND: Adaptive Latent Modeling and Optimization via Neural Networks and Langevin Diffusion ⋮ Global Optimization via Schrödinger–Föllmer Diffusion ⋮ Unnamed Item ⋮ Swarm gradient dynamics for global optimization: the mean-field limit case ⋮ Mirror variational transport: a particle-based algorithm for distributional optimization on constrained domains ⋮ Distributed event-triggered unadjusted Langevin algorithm for Bayesian learning ⋮ Unnamed Item ⋮ On Stochastic Gradient Langevin Dynamics with Dependent Data Streams: The Fully Nonconvex Case ⋮ User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient ⋮ Is there an analog of Nesterov acceleration for gradient-based MCMC? ⋮ Unnamed Item ⋮ Efficient stochastic optimisation by unadjusted Langevin Monte Carlo. Application to maximum marginal likelihood and empirical Bayesian estimation ⋮ Unadjusted Langevin algorithm for sampling a mixture of weakly smooth potentials ⋮ Unnamed Item
This page was built for publication:
