Heterogeneous Ordinal Structure Learning with Bayesian Nonparametric Complexity Discovery

• URL: http://arxiv.org/abs/2605.04191v1
• Date: Tue, 05 May 2026 18:32:49 GMT
• Title: Heterogeneous Ordinal Structure Learning with Bayesian Nonparametric Complexity Discovery
• Abstract summary: Existing ordinal structure learners assume a shared directed acyclic graph (DAG) across all respondents.<n>Recent ordinal graphical-model approaches focus on subgroup discovery rather than confirmatory cluster-specific DAG estimation.
• Score: 1.089614199781423
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Integrating Implicit and Explicit Relational Biases through Graph-Based Multiple Instance Learning: A Case Study in Skin Lesion Diagnosis [0.0]
  This study investigates a dual-level framework for image classification.<n>It bridges the gap between implicit representation learning and explicit structural modelling.<n> Experimental results show that combining implicit interpatch modelling with explicit graph-based messages yields the best results.
  arXiv  Detail & Related papers  (2026-08-06T13:47:18Z)
• Imputation Meets Clustering: Exploiting Latent Subgroup Structure for Missing Data Recovery [52.29866804948133]
  We propose CAGI (Cluster-Aware Generative Imputation), a framework that reformulates clustering and imputation as a mutually reinforcing co-optimization process.<n>Experiments on 14 benchmark datasets with 15 representative baselines demonstrate the superiority of CAGI.
  arXiv  Detail & Related papers  (2026-07-08T02:50:02Z)
• SVC-Probe: A Framework for Evaluating Perturbation Generalization in Spatial Foundation-Model Embeddings [3.884856136722027]
  This work examines generalization in spatial foundation-model embeddings derived from fluorescence microscopy images.<n>We introduce SVC-Probe, a perturbation-aware framework that combines Subcellular Embedding Atlas Stability, Mondrian Neighborhood Graphs, and a Foundation Model Perturbation Probe.
  arXiv  Detail & Related papers  (2026-06-26T13:46:36Z)
• Sparse Network Inference under Imperfect Detection and its Application to Ecological Networks [2.7065664375961274]
  We propose a framework for structured sparse non-negative low-rank factorization with detection estimation.<n>We develop an ADMM-based algorithm with scale-aware and similarity-aware factors and establish its feasibility.<n>Experiments on synthetic and real-world ecological clusters demonstrate improved recovery of latent structure and similarity/connectivity.
  arXiv  Detail & Related papers  (2026-04-20T20:41:23Z)
• Causal Discovery with Mixed Latent Confounding via Precision Decomposition [0.0]
  Differentiable and score-based DAG learners can misinterpret global latent effects as causal edges, while latent-variable graphical models recover only undirected structure.<n>We propose textscDCL-DECOR, a modular, precision-led pipeline that separates these roles.
  arXiv  Detail & Related papers  (2025-12-31T08:03:41Z)
• Noise & pattern: identity-anchored Tikhonov regularization for robust structural anomaly detection [58.535473924035365]
  Anomaly detection plays a pivotal role in automated industrial inspection, aiming to identify subtle or rare defects in otherwise uniform visual patterns.<n>We tackle structural anomaly detection using a self-supervised autoencoder that learns to repair corrupted inputs.<n>We introduce a corruption model that injects artificial disruptions into training images to mimic structural defects.
  arXiv  Detail & Related papers  (2025-11-10T15:48:50Z)
• DAG DECORation: Continuous Optimization for Structure Learning under Hidden Confounding [0.0]
  We study structure learning for linear Gaussian SEMs in the presence of latent confounding.<n>We propose textscDECOR, a single likelihood-based estimator that jointly learns a DAG and a correlated noise model.
  arXiv  Detail & Related papers  (2025-10-02T15:23:30Z)
• Structured Basis Function Networks: Loss-Centric Multi-Hypothesis Ensembles with Controllable Diversity [46.60221265861393]
  Existing approaches to predictive uncertainty rely on multi-hypothesis prediction, which promotes diversity but lacks principled aggregation.<n>The Structured Basis Function Network addresses this gap by linking multi-hypothesis prediction and ensembling through centroidal aggregation induced by Bregman divergences.<n>A tunable diversity mechanism provides parametric control of the bias-variance-diversity trade-off, connecting multi-hypothesis generalisation with loss-aware ensemble aggregation.
  arXiv  Detail & Related papers  (2025-09-02T19:53:43Z)
• Last-Iterate Convergence of Adaptive Riemannian Gradient Descent for Equilibrium Computation [52.73824786627612]
  This paper establishes new convergence results for textitgeodesic strongly monotone games.<n>Our key result shows that RGD attains last-iterate linear convergence in a textitgeometry-agnostic fashion.<n>Overall, this paper presents the first geometry-agnostic last-iterate convergence analysis for games beyond the Euclidean settings.
  arXiv  Detail & Related papers  (2023-06-29T01:20:44Z)
• dotears: Scalable, consistent DAG estimation using observational and interventional data [1.220743263007369]
  Causal gene regulatory networks can be represented by directed acyclic graph (DAG) We present $texttdotears$ [doo-tairs], a continuous optimization framework to infer a single causal structure. We show that $texttdotears$ is a provably consistent estimator of the true DAG under mild assumptions.
  arXiv  Detail & Related papers  (2023-05-30T17:03:39Z)
• Amortized Inference for Causal Structure Learning [72.84105256353801]
  Learning causal structure poses a search problem that typically involves evaluating structures using a score or independence test. We train a variational inference model to predict the causal structure from observational/interventional data. Our models exhibit robust generalization capabilities under substantial distribution shift.
  arXiv  Detail & Related papers  (2022-05-25T17:37:08Z)
• CASTLE: Regularization via Auxiliary Causal Graph Discovery [89.74800176981842]
  We introduce Causal Structure Learning (CASTLE) regularization and propose to regularize a neural network by jointly learning the causal relationships between variables. CASTLE efficiently reconstructs only the features in the causal DAG that have a causal neighbor, whereas reconstruction-based regularizers suboptimally reconstruct all input features.
  arXiv  Detail & Related papers  (2020-09-28T09:49:38Z)
• Good Classifiers are Abundant in the Interpolating Regime [64.72044662855612]
  We develop a methodology to compute precisely the full distribution of test errors among interpolating classifiers. We find that test errors tend to concentrate around a small typical value $varepsilon*$, which deviates substantially from the test error of worst-case interpolating model. Our results show that the usual style of analysis in statistical learning theory may not be fine-grained enough to capture the good generalization performance observed in practice.
  arXiv  Detail & Related papers  (2020-06-22T21:12:31Z)

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.