Characterizing Identifiability in Boolean Factor Models

2026-10-01

AI Summary

This study addresses the long-standing reliance of Boolean factor model identifiability on the pure node assumption, which severely restricts the applicability of interpretable models. By leveraging Hasse diagrams to reformulate the identifiability problem as a graph isomorphism task and integrating Boolean satisfiability (SAT) algorithms, this work establishes necessary and sufficient conditions for identifiability without requiring pure nodes, further extending these results to probabilistic settings. The proposed framework transcends traditional pure node constraints by introducing novel graphical and algebraic identifiability theories alongside efficient verification tools. Ultimately, this research substantially broadens the class of interpretable Boolean factor models and equips practitioners with concrete methodologies for assessing identifiability in practice.

Abstract

Boolean factor models, including prominent subfamilies such as Boolean matrix decompositions and cognitive diagnosis models, find broad applications ranging from social sciences to engineering. Despite their flexibility, a key challenge lies in establishing the identifiability of their graphical structures, which specify how latent variables influence observed variables. Existing identifiability conditions typically rely on the strong assumption of pure nodes, which may be unrealistic in many applications. We develop a novel approach leveraging the Hasse diagram to represent the distribution of observed variables and transform identifiability into a graph isomorphism challenge. Based on this, we establish {\it sufficient and necessary} graphical identifiability conditions that do not require pure nodes. We further derive equivalent algebraic conditions and develop an efficient Boolean satisfiability (SAT)-based verification algorithm. We extend the analysis to probabilistic Boolean factor models, establishing conditions for jointly identifying the graphical structure and additional model parameters without requiring pure nodes. Our results substantially broaden the class of identifiable and interpretable Boolean factor models by removing the pure-node requirement, yielding new theoretical insights, while also providing practitioners with a concrete and easily implementable tool to assess model identifiability.

Problem

• Boolean factor models
• identifiability
• graphical structure
• pure nodes
• latent variables

Innovation

• Boolean factor models
• identifiability
• Hasse diagram
• graph isomorphism
• SAT-based algorithm