Equivalence Set Restricted Latent Class Models (ESRLCM)

• URL: http://arxiv.org/abs/2406.03653v1
• Date: Wed, 5 Jun 2024 23:35:37 GMT
• Title: Equivalence Set Restricted Latent Class Models (ESRLCM)
• Authors: Jesse Bowers, Steve Culpepper,
• Abstract summary: We propose a novel Bayesian model called the Equivalence Set Restricted Latent Class Model (ESRLCM) This model identifies clusters who have common item response probabilities, and does so more generically than traditional restricted latent attribute models.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Latent Class Models (LCMs) are used to cluster multivariate categorical data, commonly used to interpret survey responses. We propose a novel Bayesian model called the Equivalence Set Restricted Latent Class Model (ESRLCM). This model identifies clusters who have common item response probabilities, and does so more generically than traditional restricted latent attribute models. We verify the identifiability of ESRLCMs, and demonstrate the effectiveness in both simulations and real-world applications.

Related papers

• Latent class analysis for multi-layer categorical data [0.0]
  This paper considers a more general case, multi-layer categorical data with polytomous responses. We present a novel statistical model, the multi-layer latent class model (multi-layer LCM)
  arXiv  Detail & Related papers  (2024-08-10T12:31:31Z)
• Investigating the Robustness of Counterfactual Learning to Rank Models: A Reproducibility Study [61.64685376882383]
  Counterfactual learning to rank (CLTR) has attracted extensive attention in the IR community for its ability to leverage massive logged user interaction data to train ranking models. This paper investigates the robustness of existing CLTR models in complex and diverse situations. We find that the DLA models and IPS-DCM show better robustness under various simulation settings than IPS-PBM and PRS with offline propensity estimation.
  arXiv  Detail & Related papers  (2024-04-04T10:54:38Z)
• Model-Based RL for Mean-Field Games is not Statistically Harder than Single-Agent RL [57.745700271150454]
  We study the sample complexity of reinforcement learning in Mean-Field Games (MFGs) with model-based function approximation. We introduce the Partial Model-Based Eluder Dimension (P-MBED), a more effective notion to characterize the model class complexity.
  arXiv  Detail & Related papers  (2024-02-08T14:54:47Z)
• Latent class analysis with weighted responses [0.0]
  We propose a novel generative model, the weighted latent class model (WLCM) Our model allows data's response matrix to be generated from an arbitrary distribution with a latent class structure. We investigate the identifiability of the model and propose an efficient algorithm for estimating the latent classes and other model parameters.
  arXiv  Detail & Related papers  (2023-10-17T04:16:20Z)
• Rethinking Log Odds: Linear Probability Modelling and Expert Advice in Interpretable Machine Learning [8.831954614241234]
  We introduce a family of interpretable machine learning models, with two broad additions: Linearised Additive Models (LAMs) and SubscaleHedge. LAMs replace the ubiquitous logistic link function in General Additive Models (GAMs); and SubscaleHedge is an expert advice algorithm for combining base models trained on subsets of features called subscales.
  arXiv  Detail & Related papers  (2022-11-11T17:21:57Z)
• Dependent Latent Class Models [0.0]
  Latent Class Models (LCMs) are used to cluster multivariate categorical data. We develop a novel Bayesian model called a Dependent Latent Class Model (DLCM) We demonstrate the effectiveness of DLCMs in both simulations and real-world applications.
  arXiv  Detail & Related papers  (2022-05-18T01:23:05Z)
• Improving Label Quality by Jointly Modeling Items and Annotators [68.8204255655161]
  We propose a fully Bayesian framework for learning ground truth labels from noisy annotators. Our framework ensures scalability by factoring a generative, Bayesian soft clustering model over label distributions into the classic David and Skene joint annotator-data model.
  arXiv  Detail & Related papers  (2021-06-20T02:15:20Z)
• Improving the Reconstruction of Disentangled Representation Learners via Multi-Stage Modeling [54.94763543386523]
  Current autoencoder-based disentangled representation learning methods achieve disentanglement by penalizing the ( aggregate) posterior to encourage statistical independence of the latent factors. We present a novel multi-stage modeling approach where the disentangled factors are first learned using a penalty-based disentangled representation learning method. Then, the low-quality reconstruction is improved with another deep generative model that is trained to model the missing correlated latent variables.
  arXiv  Detail & Related papers  (2020-10-25T18:51:15Z)
• Robust Finite Mixture Regression for Heterogeneous Targets [70.19798470463378]
  We propose an FMR model that finds sample clusters and jointly models multiple incomplete mixed-type targets simultaneously. We provide non-asymptotic oracle performance bounds for our model under a high-dimensional learning framework. The results show that our model can achieve state-of-the-art performance.
  arXiv  Detail & Related papers  (2020-10-12T03:27:07Z)
• Learning Mixtures of Random Utility Models with Features from Incomplete Preferences [34.50516583809234]
  We consider RUMs with features and their mixtures, where each alternative has a vector of features, possibly different across agents. We extend mixtures of RUMs with features to models that generate incomplete preferences and characterize their identifiability. Our experiments on synthetic data demonstrate the effectiveness of MLE on PL with features with tradeoffs between statistical efficiency and computational efficiency.
  arXiv  Detail & Related papers  (2020-06-06T13:47:43Z)
• Explainable Matrix -- Visualization for Global and Local Interpretability of Random Forest Classification Ensembles [78.6363825307044]
  We propose Explainable Matrix (ExMatrix), a novel visualization method for Random Forest (RF) interpretability. It employs a simple yet powerful matrix-like visual metaphor, where rows are rules, columns are features, and cells are rules predicates. ExMatrix applicability is confirmed via different examples, showing how it can be used in practice to promote RF models interpretability.
  arXiv  Detail & Related papers  (2020-05-08T21:03:48Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.