Probabilistically-autoencoded horseshoe-disentangled multidomain item-response theory models
Item response theory (IRT) is a non-linear generative probabilistic paradigm for using exams to identify, quantify, and compare latent traits of individuals, relative to their peers, within a population of interest. In pre-existing multidimensional IRT methods, one requires a factorization of the test items. For this task, linear exploratory factor analysis is used, making IRT a posthoc model. We propose skipping the initial factor analysis by using a sparsity-promoting horseshoe prior to perform factorization directly within the IRT model so that all training occurs in a single self-consistent step. Being a hierarchical Bayesian model, we adapt the WAIC to the problem of dimensionality selection. IRT models are analogous to probabilistic autoencoders. By binding the generative IRT model to a Bayesian neural network (forming a probabilistic autoencoder), one obtains a scoring algorithm consistent with the interpretable Bayesian model. In some IRT applications the black-box nature of a neural network scoring machine is desirable. In this manuscript, we demonstrate within-IRT factorization and comment on scoring approaches.
Code (1)
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
False Discovery Rate Control via Frequentist-assisted Horseshoe
The horseshoe prior, a widely used handy alternative to the spike-and-slab prior, has proven to be an exceptional default global-local shrinkage prior in Bayesian inference and machine learning. However, designing tests …
Bayesian InferenceDualVAE: Dual Disentangled Variational AutoEncoder for Recommendation
Learning precise representations of users and items to fit observed interaction data is the fundamental task of collaborative filtering. Existing studies usually infer entangled representations to fit such interaction da…
Collaborative FilteringDisentanglementRepresentation LearningVariational InferenceN2D: (Not Too) Deep Clustering via Clustering the Local Manifold of an Autoencoded Embedding
Deep clustering has increasingly been demonstrating superiority over conventional shallow clustering algorithms. Deep clustering algorithms usually combine representation learning with deep neural networks to achieve thi…
ClusteringDeep ClusteringImage ClusteringRepresentation Learning+3Disentangled Graph Collaborative Filtering
Learning informative representations of users and items from the interaction data is of crucial importance to collaborative filtering (CF). Present embedding functions exploit user-item relationships to enrich the repres…
Collaborative FilteringDisentanglementHorseshoe Regularization for Machine Learning in Complex and Deep Models
Since the advent of the horseshoe priors for regularization, global-local shrinkage methods have proved to be a fertile ground for the development of Bayesian methodology in machine learning, specifically for high-dimens…
BIG-bench Machine Learningregression