Stochastic zeroth-order discretizations of Langevin diffusions for Bayesian inference
From MaRDI portal
Cites work
- A companion for the Kiefer-Wolfowitz-Blum stochastic approximation algorithm
- Accelerated randomized stochastic optimization.
- Analysis and geometry of Markov diffusion operators
- Automatic differentiation variational inference
- Complexity of randomized algorithms for underdamped Langevin dynamics
- Couplings and quantitative contraction rates for Langevin dynamics
- Derivative-free and blackbox optimization
- Derivative-free optimization methods
- Evaluating Derivatives
- Exponential convergence of Langevin distributions and their discrete approximations
- High-dimensional Bayesian inference via the unadjusted Langevin algorithm
- Hit-and-Run Algorithms for Generating Multivariate Distributions
- scientific article; zbMATH DE number 1619459 (Why is no real title available?)
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 88931 (Why is no real title available?)
- scientific article; zbMATH DE number 3534286 (Why is no real title available?)
- scientific article; zbMATH DE number 1034042 (Why is no real title available?)
- scientific article; zbMATH DE number 3438144 (Why is no real title available?)
- Improved regret for zeroth-order adversarial bandit convex optimisation
- Introduction to Derivative-Free Optimization
- Introduction to Stochastic Search and Optimization
- Isoperimetric problems for convex bodies and a localization lemma
- Kernel-based methods for bandit convex optimization
- Langevin-type models II: Self-targeting candidates for MCMC algorithms
- Langevin-type models. I: Diffusions with given stationary distributions and their discretizations
- Log-concave sampling: Metropolis-Hastings algorithms are fast
- MCMC using Hamiltonian dynamics
- Multidimensional Stochastic Approximation Methods
- Nonasymptotic convergence analysis for the unadjusted Langevin algorithm
- On sampling from a log-concave density using kinetic Langevin diffusions
- On the efficiency of pseudo-marginal random walk Metropolis algorithms
- Optimal Rates for Zero-Order Convex Optimization: The Power of Two Function Evaluations
- Optimal Scaling of Discrete Approximations to Langevin Diffusions
- Pseudo-marginal Hamiltonian Monte Carlo
- Random gradient-free minimization of convex functions
- Rates of convergence of the Hastings and Metropolis algorithms
- Riemann manifold Langevin and Hamiltonian Monte Carlo methods. With discussion and authors' reply
- Sampling from a log-concave distribution with projected Langevin Monte Carlo
- Spike and slab variable selection: frequentist and Bayesian strategies
- Stochastic Estimation of the Maximum of a Regression Function
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- Stochastic online optimization. Single-point and multi-point non-linear multi-armed bandits. Convex and strongly-convex case
- The geometry of logconcave functions and sampling algorithms
- The Hastings algorithm at fifty
- The pseudo-marginal approach for efficient Monte Carlo computations
- Theoretical Guarantees for Approximate Sampling from Smooth and Log-Concave Densities
- User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient
- Zeroth-order nonconvex stochastic optimization: handling constraints, high dimensionality, and saddle points
Cited in
(3)
This page was built for publication: Stochastic zeroth-order discretizations of Langevin diffusions for Bayesian inference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2137043)
