Pages that link to "Item:Q2657917"
From MaRDI portal
The following pages link to Nonasymptotic bounds for sampling algorithms without log-concavity (Q2657917):
Displaying 16 items.
- Approximation of heavy-tailed distributions via stable-driven SDEs (Q2040106) (← links)
- Unadjusted Langevin algorithm for sampling a mixture of weakly smooth potentials (Q2083423) (← links)
- Central limit theorem and self-normalized Cramér-type moderate deviation for Euler-Maruyama scheme (Q2137002) (← links)
- Improved bounds for discretization of Langevin diffusions: near-optimal rates without convexity (Q2137032) (← links)
- Stochastic gradient Hamiltonian Monte Carlo for non-convex learning (Q2137760) (← links)
- Strict Kantorovich contractions for Markov chains and Euler schemes with general noise (Q2157329) (← links)
- Multi-level Monte Carlo methods for the approximation of invariant measures of stochastic differential equations (Q2302502) (← links)
- Quantitative contraction rates for Markov chains on general state spaces (Q2631852) (← links)
- Maximum Entropy Methods for Texture Synthesis: Theory and Practice (Q4999346) (← links)
- Convergence of a particle approximation for the quasi-stationary distribution of a diffusion process: Uniform estimates in a compact soft case (Q5030238) (← links)
- (Q5053262) (← links)
- On Stochastic Gradient Langevin Dynamics with Dependent Data Streams: The Fully Nonconvex Case (Q5162623) (← links)
- Stochastic Gradient Markov Chain Monte Carlo (Q5857155) (← links)
- Distributed event-triggered unadjusted Langevin algorithm for Bayesian learning (Q6136164) (← links)
- Multi-index antithetic stochastic gradient algorithm (Q6171790) (← links)
- The forward-backward envelope for sampling with the overdamped Langevin algorithm (Q6173566) (← links)