Exact simulation of diffusions and improved algorithms for log-concave sampling
From MaRDI portal
Cites work
- A differential equation for modeling Nesterov's accelerated gradient method: theory and insights
- A sharp hypocoercive entropy decay estimate for underdamped Langevin dynamics
- Acceleration by stepsize hedging: silver stepsize schedule for smooth convex optimization
- Analysis and geometry of Markov diffusion operators
- Analysis of a nonreversible Markov chain sampler.
- Barker's algorithm for Bayesian inference with intractable likelihoods
- Complexity of zigzag sampling algorithm for strongly log-concave distributions
- Convergence in total variation for the kinetic Langevin algorithm
- Convergence of non-reversible Markov processes via lifting and flow Poincaré inequality
- Convergence of the Riemannian Langevin Algorithm
- Efficient Bernoulli factory Markov chain Monte Carlo for intractable posteriors
- Efficient constrained sampling via the mirror-Langevin algorithm
- Equation of state calculations by fast computing machines
- Exact Monte Carlo likelihood-based inference for jump-diffusion processes
- Exact simulation of diffusions
- Exponential ergodicity of mirror-Langevin diffusions
- Fast mixing of Metropolized Hamiltonian Monte Carlo: benefits of multi-step gradients
- Faster high-accuracy log-concave sampling via algorithmic warm starts
- Fisher information lower bounds for sampling
- Handbook of Markov Chain Monte Carlo
- High-accuracy log-concave sampling with stochastic queries
- Hypocoercivity
- Improved analysis for a proximal algorithm for sampling
- Improved dimension dependence of a proximal algorithm for sampling
- Lifting Markov chains to speed up mixing
- Logsmooth Gradient Concentration and Tighter Runtimes for Metropolized Hamiltonian Monte Carlo
- Monte carlo evaluation of functionals of solutions of stochastic differential equations. variance reduction and numerical examples
- Monte Carlo sampling methods using Markov chains and their applications
- Nesterov acceleration for the Wasserstein minimization of displacement-convex free energies
- Non-reversible lifts of reversible diffusion processes and relaxation times
- On explicit \(L^2\)-convergence rate estimate for piecewise deterministic Markov processes in MCMC algorithms
- Optimal dimension dependence of the Metropolis-Adjusted Langevin Algorithm
- Optimal Scaling of Discrete Approximations to Langevin Diffusions
- Optimal tuning of the hybrid Monte Carlo algorithm
- Optimum bounds for the distributions of martingales in Banach spaces
- Query lower bounds for log-concave sampling
- Query lower bounds for log-concave sampling
- Retrospective exact simulation of diffusion sample paths with applications
- Sampling as optimization in the space of measures: The Langevin dynamics as a composite optimization problem
- Sharp hypocoercive convergence estimates for underdamped Langevin dynamics via the modified $L^2$ method
- Shifted Composition IV: Toward Ballistic Acceleration for Log-Concave Sampling
- Shifted composition. I: Harnack and reverse transport inequalities
- Space-time divergence lemmas and optimal non-reversible lifts of diffusions on Riemannian manifolds with boundary
- Space-Time Log-Sobolev Inequality and Hypocoercive Hypercontractivity for Underdamped Langevin Dynamics
- Structured Logconcave Sampling with a Restricted Gaussian Oracle
- The Mirror Langevin Algorithm Converges with Vanishing Bias
- The Variational Formulation of the Fokker--Planck Equation
- Time averages for kinetic Fokker-Planck equations
- Towards a Theory of Non-Log-Concave Sampling: First-Order Stationarity Guarantees for Langevin Monte Carlo
- Wasserstein Control of Mirror Langevin Monte Carlo
- Windowed thinning and query complexity for the bouncy particle and Zigzag samplers
This page was built for publication: Exact simulation of diffusions and improved algorithms for log-concave sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7284652)
