arXiv:2512. 19510v2 Announce Type: replace Abstract: Conditional independence (CI) is central to causal inference, feature selection, and graphical modeling, yet it is untestable in many settings without additional assumptions.
arXiv:2504. 12594v2 Announce Type: replace Abstract: Conditional independence testing is a critical component of feature screening, invariant statistical models, and causal discovery.
arXiv:2608. 11156v1 Announce Type: cross Abstract: Conditional Independence (CI) tests are the statistical engine of constraint-based causal discovery: in algorithms such as PC (Peter-Clark) and FCI (Fast Causal Inference), skeleton pruning and key orientations follow directly from CI decisions.
arXiv:2606. 18011v1 Announce Type: cross Abstract: Constraint-based causal discovery relies on repeated conditional independence tests, but fast nonparametric tests often sacrifice calibration, especially when variables depend on the conditioning set through nonlinear relationships.
arXiv:2601.01368v2 Announce Type: replace Abstract: Score-based causal discovery in the presence of unobserved confounders requires both a consistent scoring criterion and an efficient search over gr...
arXiv:2606. 18993v1 Announce Type: cross Abstract: Testing conditional independence is fundamental yet intrinsically difficult: without additional assumptions, Type I error control is impossible in general.
arXiv:2610.00968v1 Announce Type: cross Abstract: Causal representation learning aims to discover robust features by exploiting the causal structure underlying data generation. Existing methods requi...
arXiv:2608.30644v1 Announce Type: cross Abstract: We develop a marginal coordinate test for regression with Euclidean predictors and a random-object response in a separable metric space. The goal is...
arXiv:2609.01322v1 Announce Type: cross Abstract: In many settings, studying causal questions based on text data requires adjusting for confounding information within texts. Yet there is a tradeoff i...
arXiv:2602. 23006v2 Announce Type: replace-cross Abstract: Simulating a Gaussian process requires sampling from a high-dimensional Gaussian distribution, which scales cubically with the number of sample locations.
arXiv:2603.05575v2 Announce Type: replace-cross Abstract: We study prediction-powered conditional inference in the setting where labeled data are scarce, unlabeled covariates are abundant, and a blac...
arXiv:2602. 01135v3 Announce Type: replace Abstract: Autoregressive models trained via next-token prediction implicitly learn the conditional independence structure of their data-generating process.
The paper introduces a framework that learns the kernel used in kernel methods through alignment, leveraging the Collaborative Learning and Inference (CLaI) approach. It demonstrates that CLaI can be interpreted as a kernel alignment process and that its inference stage is equivalent to kernel Bayes classification with Parzen-window density estimation. By replacing cosine similarity with a learned Mahalanobis distance, the authors extend CLaI to multiclass classification, achieving higher accuracy, faster convergence, and lower calibration error on datasets such as CIFAR-10, PathMNIST, and SleepEDF, while also showing connections to Gaussian processes and competitive calibration in sepsis prediction.