Interacting particle Langevin algorithm for maximum marginal likelihood estimation
From MaRDI portal
Cites work
- 10.1162/jmlr.2003.3.4-5.993
- A consensus-based model for global optimization and its mean-field limit
- A multiple-imputation Metropolis version of the EM algorithm
- A stochastic approximation type EM algorithm for the mixture problem
- A stochastic particle method for the McKean-Vlasov and the Burgers equation
- Analysis of Langevin Monte Carlo via convex optimization
- Ascent-Based Monte Carlo Expectation– Maximization
- Conditions for convergence of Monte Carlo EM sequences with an application to product diffusion modeling
- Consensus-based global optimization with personal best
- Convergence of a stochastic approximation version of the EM algorithm
- Convergence of adaptive and interacting Markov chain Monte Carlo algorithms
- Convergence of the Monte Carlo expectation maximization for curved exponential families.
- Efficient stochastic optimisation by unadjusted Langevin Monte Carlo. Application to maximum marginal likelihood and empirical Bayesian estimation
- Empirical Bayes: Past, Present and Future
- Exponential convergence of Langevin distributions and their discrete approximations
- From particle swarm optimization to consensus based optimization: stochastic modeling and mean-field limit
- High-dimensional Bayesian inference via the unadjusted Langevin algorithm
- scientific article; zbMATH DE number 6377992 (Why is no real title available?)
- scientific article; zbMATH DE number 4211245 (Why is no real title available?)
- scientific article; zbMATH DE number 51724 (Why is no real title available?)
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 1222290 (Why is no real title available?)
- scientific article; zbMATH DE number 739537 (Why is no real title available?)
- scientific article; zbMATH DE number 765034 (Why is no real title available?)
- Laplace's method revisited: Weak convergence of probability measures
- Latent Space Approaches to Social Network Analysis
- Logarithmic Sobolev inequalities for some nonlinear PDE's.
- Marginal maximum a posteriori estimation using Markov chain Monte Carlo
- Maximizing Generalized Linear Mixed Model Likelihoods With an Automated Monte Carlo EM Algorithm
- Maximum likelihood estimation via the ECM algorithm: A general framework
- MCMC maximum likelihood for latent state models
- Monte Carlo EM Estimation for Time Series Models Involving Counts
- Nonasymptotic convergence analysis for the unadjusted Langevin algorithm
- Nonasymptotic estimates for stochastic gradient Langevin dynamics under local conditions in nonconvex optimization
- On Milstein approximations with varying coefficients: the case of super-linear diffusion coefficients
- On perturbed proximal gradient algorithms
- Optimization methods for large-scale machine learning
- Parallel sequential Monte Carlo for stochastic gradient-free nonconvex optimization
- Partial differential equations and stochastic methods in molecular dynamics
- Pattern recognition and machine learning.
- Simulation-based methods for blind maximum-likelihood filter identification
- The Brunn-Minkowski inequality
- The ECME algorithm: A simple extension of EM and ECM with faster monotone convergence
- THE GEOMETRY OF DISSIPATIVE EVOLUTION EQUATIONS: THE POROUS MEDIUM EQUATION
- The tamed unadjusted Langevin algorithm
- The Variational Formulation of the Fokker--Planck Equation
- Theoretical Guarantees for Approximate Sampling from Smooth and Log-Concave Densities
- User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient
Cited in
(5)- Fast convergence of the expectation-maximization algorithm under a logarithmic Sobolev inequality
- How to beat a Bayesian adversary
- Error bounds for particle gradient descent, and extensions of the log-Sobolev and Talagrand inequalities
- Modelling birdsong transmission with methods from molecular sequence analysis
- Statistical finite elements via interacting particle Langevin dynamics
This page was built for publication: Interacting particle Langevin algorithm for maximum marginal likelihood estimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6960461)
