Computation for latent variable model estimation: a unified stochastic proximal framework
From MaRDI portal
Publication:2103576
Abstract: Latent variable models have been playing a central role in psychometrics and related fields. In many modern applications, the inference based on latent variable models involves one or several of the following features: (1) the presence of many latent variables, (2) the observed and latent variables being continuous, discrete, or a combination of both, (3) constraints on parameters, and (4) penalties on parameters to impose model parsimony. The estimation often involves maximizing an objective function based on a marginal likelihood/pseudo-likelihood, possibly with constraints and/or penalties on parameters. Solving this optimization problem is highly non-trivial, due to the complexities brought by the features mentioned above. Although several efficient algorithms have been proposed, there lacks a unified computational framework that takes all these features into account. In this paper, we fill the gap. Specifically, we provide a unified formulation for the optimization problem and then propose a quasi-Newton stochastic proximal algorithm. Theoretical properties of the proposed algorithms are established. The computational efficiency and robustness are shown by simulation studies under various settings for latent variable model estimation.
Recommendations
- Simulation-based approach to estimation of latent variable models
- Latent Variable Modelling: A Survey*
- scientific article; zbMATH DE number 1264868
- ALMOND: Adaptive Latent Modeling and Optimization via Neural Networks and Langevin Diffusion
- Asymptotic properties of adaptive maximum likelihood estimators in latent variable models
Cites work
- scientific article; zbMATH DE number 3124366 (Why is no real title available?)
- scientific article; zbMATH DE number 4215340 (Why is no real title available?)
- scientific article; zbMATH DE number 4088699 (Why is no real title available?)
- scientific article; zbMATH DE number 3768770 (Why is no real title available?)
- scientific article; zbMATH DE number 45532 (Why is no real title available?)
- scientific article; zbMATH DE number 48727 (Why is no real title available?)
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 976325 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 2109186 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 847306 (Why is no real title available?)
- scientific article; zbMATH DE number 3297790 (Why is no real title available?)
- A Markov chain Monte Carlo approach to confirmatory item factor analysis
- A Stochastic Approximation Method
- A composite likelihood inference in latent variable models for ordinal longitudinal responses
- A note on exploratory item factor analysis by singular value decomposition
- A numerically stable dual method for solving strictly convex quadratic programs
- A penalty approach to differential item functioning in Rasch models
- A simple general method for oblique rotation
- A stochastic approximation algorithm with Markov chain Monte-Carlo method for incomplete data estimation problems
- Acceleration of Stochastic Approximation by Averaging
- Adaptive Rejection Sampling for Gibbs Sampling
- An improved stochastic EM algorithm for large-scale full-information item factor analysis
- Analysis of panel data
- Compound decision theory and empirical Bayes methods
- Consistent Estimates Based on Partially Consistent Observations
- Convergence of Markovian stochastic approximation with discontinuous dynamics
- Convergence of adaptive and interacting Markov chain Monte Carlo algorithms
- Dynamic Latent Trait Models for Multidimensional Longitudinal Data
- Fitting nonlinear ordinary differential equation models with random effects and unknown initial conditions using the stochastic approximation expectation-maximization (SAEM) algorithm
- High-dimensional exploratory item factor analysis by a Metropolis-Hastings Robbins-Monro algorithm
- Identifiability of restricted latent class models with binary responses
- Inconsistent maximum likelihood estimators for the Rasch model
- Introduction to Stochastic Search and Optimization
- Introductory lectures on convex optimization. A basic course.
- Joint maximum likelihood estimation for high-dimensional exploratory item factor analysis
- Latent variable models and factor analysis. A unified approach
- Latent variable selection for multidimensional item response theory models via \(L_{1}\) regularization
- MCMC estimation and some model-fit analysis of multidimensional IRT models
- Maximum likelihood estimates in exponential response models
- Measurement Error in Nonlinear Models
- Multidimensional item reponse theory.
- On Asymptotic Normality in Stochastic Approximation
- On perturbed proximal gradient algorithms
- On single versus multiple imputation for a class of stochastic algorithms estimating maximum likelihood
- On the convergence properties of the EM algorithm
- On the ergodicity properties of some adaptive MCMC algorithms
- Proximal Newton-type methods for minimizing composite functions
- Regularization and Variable Selection Via the Elastic Net
- Robust measurement via a fused latent and graphical item response theory model
- Stability of Stochastic Approximation under Verifiable Conditions
- Statistical analysis of \(Q\)-matrix based diagnostic classification models
- Statistics for high-dimensional data. Methods, theory and applications.
- Stochastic Gradient Descent on Riemannian Manifolds
- Stochastic Methods for Composite and Weakly Convex Optimization Problems
- Structured latent factor analysis for large-scale data: identifiability, estimability, and their implications
- The elements of statistical learning. Data mining, inference, and prediction
- The generalized DINA model framework
- The stochastic EM algorithm: Estimation and asymptotic results
- Variational Analysis
Cited in
(7)- ALMOND: Adaptive Latent Modeling and Optimization via Neural Networks and Langevin Diffusion
- Scalable Bayesian approach for the DINA Q-matrix estimation combining stochastic optimization and variational inference
- Simulation-based approach to estimation of latent variable models
- Fast and universal estimation of latent variable models using extended variational approximations
- Stochastic proximal-gradient algorithms for penalized mixed models
- A generalized expectation model selection algorithm for latent variable selection in multidimensional item response theory models
- Fast estimation of generalized linear latent variable models for performance and process data with ordinal, continuous, and count observed variables
This page was built for publication: Computation for latent variable model estimation: a unified stochastic proximal framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2103576)
