English

Heterogeneous Ordinal Structure Learning with Bayesian Nonparametric Complexity Discovery

Machine Learning 2026-05-07 v1 Computers and Society Machine Learning

Abstract

Public attitudes toward artificial intelligence are heterogeneous, ordinally measured, and poorly captured by any single dependency graph. Existing ordinal structure learners assume a shared directed acyclic graph (DAG) across all respondents; recent heterogeneous ordinal graphical-model approaches focus on subgroup discovery rather than confirmatory cluster-specific DAG estimation; and latent profile analyses discard dependency structure entirely. We introduce a heterogeneous ordinal structure-learning framework combining monotone Gaussian score embedding, Bayesian nonparametric (BNP) complexity discovery via a truncated stick-breaking prior, and confirmatory fixed-K estimation with cluster-specific sparse DAG learning. The key methodological insight is a discovery-to-confirmation workflow: the nonparametric stage calibrates plausible archetype complexity, while inner-validated confirmatory refitting yields stable, interpretable structural estimates. On the 2024 Pew American Trends Panel AI attitudes survey, Wave 152 (W152) survey, (N = 4,788, 8 ordinal items), the confirmatory K*=5 model reduces holdout transformed-score mean squared error (MSE) by 25.8% over a single-graph baseline and by 4.6% over mixture-only clustering. A controlled tiered semi-synthetic benchmark calibrated to W152 structure validates recovery across difficulty regimes and transparently reveals failure modes under stress conditions.

Keywords

Cite

@article{arxiv.2605.04191,
  title  = {Heterogeneous Ordinal Structure Learning with Bayesian Nonparametric Complexity Discovery},
  author = {Amir Rafe and Subasish Das},
  journal= {arXiv preprint arXiv:2605.04191},
  year   = {2026}
}
R2 v1 2026-07-01T12:51:39.884Z