A stochastic approximation algorithm with Markov chain Monte-Carlo method for incomplete data estimation problems
DOI10.1073/PNAS.95.13.7270zbMATH Open0898.62101OpenAlexW2043073960WikidataQ32060371 ScholiaQ32060371MaRDI QIDQ3838482FDOQ3838482
Authors: Fan Hui Kong, Minggao Gu 
Publication date: 13 August 1998
Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1073/pnas.95.13.7270
Recommendations
maximum likelihood estimationmeasurement errorestimating equationsadaptive algorithmsmeasurement error modelmaximum likelihood estimateMarkov chain Monte-Carloincomplete data estimation problems
Cited In (36)
- Computation for latent variable model estimation: a unified stochastic proximal framework
- Logitboost with errors-in-variables
- Maximum likelihood estimation for social network dynamics
- Coupling a stochastic approximation version of EM with an MCMC procedure
- Adaptive LASSO for general transformation models with right censored data
- Weak Convergence Rates of Population Versus Single-Chain Stochastic Approximation MCMC Algorithms
- A baseline-free procedure for transformation models under interval censorship
- Semiparametric factor analysis for item-level response time data
- A Stochastic Approximation-Langevinized Ensemble Kalman Filter Algorithm for State Space Models with Unknown Parameters
- A constrained Metropolis-Hastings Robbins-Monro algorithm for \(\boldsymbol{Q}\) matrix estimation in DINA models
- Estimation in nonlinear mixed-effects models using heavy-tailed distributions
- Annealing stochastic approximation Monte Carlo algorithm for neural network training
- Variable selection for general transformation models with ranking data
- Trajectory averaging for stochastic approximation MCMC algorithms
- Maximum likelihood estimation for simplex distribution nonlinear mixed models via the stochastic approximation algorithm
- Improving SAMC using smoothing methods: Theory and applications to Bayesian model selection problems
- Stochastic approximation EM for large-scale exploratory IRT factor analysis
- Analysis of longitudinal data with intermittent missing values using the stochastic EM algorithm
- Maximum likelihood estimation for spatial models by Markov chain Monte Carlo stochastic approximation
- Convergence of Markovian stochastic approximation for Markov random fields with hidden variables
- High-dimensional exploratory item factor analysis by a Metropolis-Hastings Robbins-Monro algorithm
- Bayesian and non-Bayesian analysis of gamma stochastic frontier models by Markov chain Monte Carlo methods
- Stochastic approximation boosting for incomplete data problems
- A computational framework for empirical Bayes inference
- Deletion measures for generalized linear mixed effects models
- The S-U algorithm for missing data problems
- Adaptive learning algorithm convergence in passive and reactive environments
- Influence analyses of nonlinear mixed-effects models
- Smoothing spline ANOVA frailty model for recurrent event data
- The stochastic EM algorithm: Estimation and asymptotic results
- A universal procedure for parametric frailty models
- Local influence for generalized linear mixed models
- Stochastic approximation
- Simulated stochastic approximation annealing for global optimization with a square-root cooling schedule
- Improving Estimates of Genetic Maps: A Maximum Likelihood Approach
- A Gibbs‐INLA algorithm for multidimensional graded response model analysis
This page was built for publication: A stochastic approximation algorithm with Markov chain Monte-Carlo method for incomplete data estimation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3838482)
