Heterogeneous Ordinal Structure Learning with Bayesian Nonparametric Complexity Discovery
Amir Rafe, Subasish Das

TL;DR
This paper proposes a novel framework for learning heterogeneous ordinal structures using Bayesian nonparametrics, combining complexity discovery and cluster-specific DAG estimation, demonstrated on AI attitude survey data.
Contribution
It introduces a discovery-to-confirmation workflow that calibrates archetype complexity and yields stable, interpretable structural estimates for heterogeneous ordinal data.
Findings
The model reduces holdout MSE by 25.8% over a single-graph baseline.
It achieves a 4.6% MSE reduction over mixture-only clustering.
Benchmark validation shows effective recovery across difficulty regimes.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
