Pages that link to "Item:Q2834489"
From MaRDI portal
The following pages link to Exploration of the (non-)asymptotic bias and variance of stochastic gradient Langevin dynamics (Q2834489):
Displaying 35 items.
- Asymptotic bias of stochastic gradient search (Q1704136) (← links)
- Markov chains in random environment with applications in queuing theory and machine learning (Q2029806) (← links)
- Efficient stochastic optimisation by unadjusted Langevin Monte Carlo. Application to maximum marginal likelihood and empirical Bayesian estimation (Q2058738) (← links)
- On the stability of the stochastic gradient Langevin algorithm with dependent data stream (Q2070610) (← links)
- Geometry-informed irreversible perturbations for accelerated convergence of Langevin dynamics (Q2080357) (← links)
- An adaptive Hessian approximated stochastic gradient MCMC method (Q2128489) (← links)
- Multi-variance replica exchange SGMCMC for inverse and forward problems via Bayesian PINN (Q2137979) (← links)
- An adaptively weighted stochastic gradient MCMC algorithm for Monte Carlo simulation and global optimization (Q2159413) (← links)
- Measuring sample quality with diffusions (Q2286455) (← links)
- Multi-level Monte Carlo methods for the approximation of invariant measures of stochastic differential equations (Q2302502) (← links)
- Control variates for stochastic gradient MCMC (Q2329787) (← links)
- Nonasymptotic bounds for sampling algorithms without log-concavity (Q2657917) (← links)
- Variance comparison between infinitesimal perturbation analysis and likelihood ratio estimators to stochastic gradient (Q2670503) (← links)
- Consistency and fluctuations for stochastic gradient Langevin dynamics (Q2810765) (← links)
- Stochastic gradient Langevin dynamics with adaptive drifts (Q3390482) (← links)
- (Q4449797) (← links)
- Scaling Limit of the Stein Variational Gradient Descent: The Mean Field Regime (Q4627155) (← links)
- (Q4637029) (← links)
- Efficient Bayesian Computation by Proximal Markov Chain Monte Carlo: When Langevin Meets Moreau (Q4686924) (← links)
- (Q5053262) (← links)
- (Q5054622) (← links)
- (Q5149258) (← links)
- (Q5214185) (← links)
- (Q5381127) (← links)
- Laplacian Smoothing Stochastic Gradient Markov Chain Monte Carlo (Q5856684) (← links)
- Stochastic Gradient Markov Chain Monte Carlo (Q5857155) (← links)
- Mini-Batch Metropolis–Hastings With Reversible SGLD Proposal (Q5881093) (← links)
- ALMOND: Adaptive Latent Modeling and Optimization via Neural Networks and Langevin Diffusion (Q6040682) (← links)
- Functional central limit theorem and strong law of large numbers for stochastic gradient Langevin dynamics (Q6073851) (← links)
- Improving sampling accuracy of stochastic gradient MCMC methods via non-uniform subsampling of gradients (Q6160667) (← links)
- Multi-index antithetic stochastic gradient algorithm (Q6171790) (← links)
- Contraction and convergence rates for discretized kinetic Langevin dynamics (Q6552475) (← links)
- Hybrid unadjusted Langevin methods for high-dimensional latent variable models (Q6554220) (← links)
- Some remarks on the effect of the random batch method on phase transition (Q6658917) (← links)
- Contraction rate estimates of stochastic gradient kinetic Langevin integrators (Q6667313) (← links)