Skip to content

Causal Discovery in Equal Variance Linear Gaussian DAGs via SURE-Tuned Ridge Regression

Aug 2026 · 2 citations · 22 references
Computer Science Engineering Mathematics

TL;DR

This work proposes SURE-Ridge, a non-iterative, closed-form estimator for equal variance linear Gaussian SEM, which achieves the lowest structural Hamming distance in the small-sample regime and the lowest run time across all sample sizes tested, compared with NOTEARS, DAGMA, and GBNSL baselines.

Abstract

Recovering the directed acyclic graph (DAG) of a structural equation model (SEM) from observational data is a central problem in causal discovery. The iterative gradient descent and per-problem hyperparameter tuning of continuous-optimization methods are poorly suited to two practically important regimes: the sample-limited regime, where the number of samples is comparable to or smaller than the number of nodes in the DAG, and the compute-limited regime. This work proposes SURE-Ridge, a non-iterative, closed-form estimator for equal variance linear Gaussian SEM. The method performs parallel node-wise regressions with regularization parameters chosen adaptively by Stein's unbiased risk estimate (SURE), and applies an adaptive thresholding procedure to extract a DAG from the resulting soft adjacency matrix. Numerical results show that SURE-Ridge achieves the lowest structural Hamming distance in the small-sample regime and the lowest run time across all sample sizes tested, compared with NOTEARS, DAGMA, and GBNSL baselines.

View source

Similar papers

Preprint Jul 2026

Bayesian DAG Structure Learning with Simultaneous Shrinkage Covariance Estimation under Scale-Mixture Error Distributions in the Proportional High-Dimensional Regime

We propose a unified Bayesian framework namely robust DAG-Cholesky horseshoe (R-DACH) for joint directed acyclic graph (DAG) structure learning and precision matrix estimation in the high-dimensional proportional asymptotic regime $p/n \to c \in (0,\infty)$, under the scale mixture of normal errors. The construction pl...

Samaneh Nazari, Mohammad Arashi, Abdolnasser Sadeghkhani · 0 citations
Preprint Jul 2026

Contrast-Free ICA and Causal Inference via Wasserstein Distances to the Gaussian

This work defines empirical plug-in estimators and prove distribution-free uniform convergence under finite-moment assumptions, before detailing three practical solvers: a Picard-style orthogonal optimizer for ICA, an exhaustive dynamic program for causal order search, and a greedy order search variant.

F'elix Laplante, C. Ambroise, Pierre Humbert · 1 citation
Preprint Jul 2026

Structure Learning on Clustered Data

A new approach is introduced that estimates a global structure while accounting for local cluster-level effects, and presents a differentiable graph coupling mechanism that guarantees the union of the fixed- and random-effects graphs remains acyclic.

Ryan Thompson, Matt P. Wand, V. Baladandayuthapani · 0 citations
Preprint Jul 2026

Exact Generalization Error Curves of Kernel Ridge Regression for Functional Moment Estimation

Kernel ridge regression is a standard method for functional data analysis, but its exact behavior is less understood. We study tensor-product kernel ridge regression for estimating the $r$-th moment function of a random function based on noisy discrete observations. The formulation includes mean estimation, covariance...

Yi Ding, Yicheng Li · 0 citations
Preprint Jun 2026

Censored broken adaptive ridge rank regression via induced smoothing

Broken adaptive ridge (BAR) penalty approximates $L_0$-regularization through iterative reweighting of L2 penalties. This penalty enjoys both the oracle property and the grouping effect for highly correlated covariates, making it particularly attractive for penalized regression with complex dependence among predictors....

Su-Yeon Seon, Dipankar Bandyopadhyay, Seongoh Park et al. · 0 citations

Related blog posts

Microsoft Research Blog Oct 12, 2026

Simulating student learning for better AI tutoring

StudentSim is a research system for evaluating and improving AI tutoring tools before they are tested with learners. It models how individuals may engage with tutors, giving feedback to improve tutor performance across subjects like chess, writing, and mathematics. The post Simulating student learning for better AI tutoring appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.