A deep learning algorithm for high-dimensional exploratory item factor analysis
From MaRDI portal
Publication:823855
DOI10.1007/s11336-021-09748-3zbMath1476.62250arXiv2001.07859OpenAlexW3129001966MaRDI QIDQ823855
Daniel J. Bauer, Christopher J. Urban
Publication date: 16 December 2021
Published in: Psychometrika (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.07859
item response theoryimportance samplingartificial neural networkvariational inferencedeep learninglatent variable modelingcategorical factor analysisimportance weighted autoencodervariational autoencoder
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximum likelihood estimation of limited and discrete dependent variable models with nested random effects
- A penalized maximum likelihood approach to sparse factor analysis
- A Markov chain Monte Carlo approach to confirmatory item factor analysis
- Multidimensional item reponse theory.
- High-dimensional exploratory item factor analysis by a Metropolis-Hastings Robbins-Monro algorithm
- Density estimation by dual ascent of the log-likelihood
- Contributions to factor analysis of dichotomous variables
- Nonlinear factor analysis as a statistical method.
- An introduction to variational methods for graphical models
- High-dimensional maximum marginal likelihood item factor analysis by adaptive quadrature
- Item response theory with estimation of the latent population distribution using spline-based densities
- Joint maximum likelihood estimation for high-dimensional exploratory item factor analysis
- Latent variable selection for multidimensional item response theory models via \(L_{1}\) regularization
- Describing disability through individual-level mixture models for multivariate binary data
- MCMC estimation and some model-fit analysis of multidimensional IRT models
- Variable selection via the weighted group lasso for factor analysis models
- Graphical Models, Exponential Families, and Variational Inference
- Robust Stochastic Approximation Approach to Stochastic Programming
- Fitting Full-Information Item Factor Models and an Empirical Investigation of Bridge Sampling
- Introduction to Stochastic Search and Optimization
- Optimization Methods for Large-Scale Machine Learning
- Estimation of Generalized Linear Latent Variable Models
- A Family of Nonparametric Density Estimation Algorithms
- An improved stochastic <scp>EM</scp> algorithm for large‐scale full‐information item factor analysis
- Modelling structured correlation matrices
- Parameterizing correlations: a geometric interpretation
- A Stochastic Approximation Method
- Approximation by superpositions of a sigmoidal function
This page was built for publication: A deep learning algorithm for high-dimensional exploratory item factor analysis