CORTEXA
← Browse
arxivmath.STstat.ML2026-07-14

MixCIT: A Kernel Based Local-Polynomial Debiased Test for Conditional Independence on Mixed-Type Data

Mengxiao Gao, Kyra Gan, Promit Ghosal

Conditional independence testing (CIT) is fundamental to modern statistical inference in areas related to causal discovery and variable selection. While marginal independence is relatively well-understood, despite multiple advances, no existing non-parametric CIT provides a unified, efficient, and statistically guaranteed solution across heterogeneous data. We introduce a graph-based test statistic comparing kernel similarities of the response within composite neighborhoods that use exact matching on discrete components and $k_n$-nearest-neighbor matching on continuous ones. The raw statistic, related to prior constructions, suffices under fully discrete conditioning. However, when at least one conditioning variable is continuous, we instead use a local-polynomial debiased variant that cancels the local smoothing bias. We rigorously establish its asymptotic null distribution across all data-type combinations. We further prove a dimension-free $n^{-1/4}$ detection threshold under local alternatives, eliminating the phase transition that affects geometric estimators in high dimensions. Finally, we develop efficient algorithms with near-quadratic complexity and analytic graph-based calibration, bypassing the cubic bottlenecks of global kernel methods.

View free PDFSource page

Related papers

arxivcs.DSmath.STstat.ML2026-07-10

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests

Jiale Cheng, Ziao Wang, Lei Ying

This paper studies graph matching under the correlated $\text{Erdős-Rényi}$ (ER) graph pair model. This model first samples an $\mathrm{ER}(n,\fracλ{ns})$ base graph, whose edges are then independently subsampled twice with probability $s$ to produce two correlated $\mathrm{ER}(n…

View free PDFSource page
arxivstat.MLcs.LGmath.ST2026-07-20

Mixing-Free and Signal-Optimal Learning of Gaussian Graphical Models from Glauber Dynamics

Vignesh Tirukkonda, Gautam Dasarathy

Gaussian graphical model selection is usually studied under independent sampling, but in many applications the data arise as a single trajectory of a dependent stochastic process. We study exact recovery of the graph from one trajectory of random-scan Gaussian Glauber dynamics. E…

View free PDFSource page
arxivmath.STstat.ML2026-07-13

Causal Graphs, Markov Properties and Do-calculus for Stochastic Differential Equations

Philip Boeken, Joris M. Mooij

Stochastic differential equations (SDEs) are widely used to model continuous-time dynamical systems, but graphical causal models for them are not yet well-understood. We consider systems of causal SDEs that are equipped with an explicit causal semantics. We pose solvability condi…

View free PDFSource page