CORTEXA
← Browse
arxivcs.LGstat.MEstat.ML2026-07-09

Structure Learning on Clustered Data

Ryan Thompson, Matt P. Wand, Veerabhadran Baladandayuthapani

Recent algorithmic advances have made directed acyclic graph (DAG) structure learning scalable for causal discovery. Yet, the currently available techniques assume a completely homogeneous population, precluding their application to clustered data where cluster-specific variations (e.g., patient-specific effects) are common. We address this issue by introducing a new approach that estimates a global structure while accounting for local cluster-level effects. The key idea is to extend the fixed- and random-effects framework of classical mixed models to the structure learning setting. Towards this end, we present a differentiable graph coupling mechanism that guarantees the union of the fixed- and random-effects graphs remains acyclic. Computationally, we provide a provably convergent first-order method and leverage efficient batched updates across clusters. Statistically, we establish identifiability of the model and show that our approach recovers the true structure asymptotically. In experiments on real and synthetic data, our proposal detects dependencies missed by alternative estimators, underscoring its value for structure learning in clustered settings.

View free PDFSource page

Related papers

arxivstat.MEcs.LGstat.APstat.COstat.ML2026-07-23

Distributional Determinantal Point Process for Repulsive Clustering of Distributions

Khai Nguyen, Yang Ni, Elizabeth Juarez-Colunga, Peter Mueller

We introduce the distributional determinantal point process (dDPP) as a novel repulsive point process whose atoms are probability distributions rather than points in a real space. The dDPP is constructed via an L-ensemble with a sliced Wasserstein (SW) kernel between distribution…

View free PDFSource page
arxivstat.MLcs.LGstat.COstat.ME2026-07-16

cGAP: Generalized Association Plots with HOMALS-Guided Heatmaps for Visualization of High-Dimensional Categorical Data

Chun-houh Chen, Shun-Chuan Chang, Chiun-How Kao, Yi-Ju Lee, Shang-Ying Shiu, Yin-Jing Tien, et al.

High-dimensional categorical data arise in genetics, biomedicine, and the social sciences, yet visualization tools for such data remain far less developed than those for continuous variables. Existing methods either scale poorly, rely heavily on low-dimensional displays detached…

View free PDFSource page
arxivstat.MLcs.LGmath.NAstat.ME2026-07-17

Cluster-Aware Matching via Laplacian Optimal Transport

Gabriel Samberg, YoonHaeng Hur, Yuehaw Khoo, Nir Sharon

In many applications of matching, the point clouds to be matched are not merely unstructured sets of points but rather samples from distributions with an intrinsic cluster structure. In such cases, as individual points are often interchangeable within a coherent region, finding a…

View free PDFSource page
arxivstat.MLcs.LGmath.PRstat.ME2026-07-07

A Convex Approximation Framework for Neural Likelihood-Based Bayesian Inverse Problems

Fabian Schneider, Tapio Helin, Leila Taghizadeh

Many problems in science and engineering are difficult to model accurately, either due to unknown physical mechanisms, poorly quantified measurement uncertainty, or prohibitive computational costs of high-fidelity simulations. These challenges limit the applicability of classical…

View free PDFSource page