CORTEXA
← Browse
arxivstat.MEstat.ML2026-07-23

Reconstruction of Enhanced Causal Omnidirectional Network (RECON)

Praveen Niranda, Peter T. McKenney, Guifang Fu

Learning a dynamical system and reconstructing the underlying regulatory network from $p$ discretely observed state trajectories remain challenging problems. Existing approaches often produced a large number of spurious edges and suffered from several methodological limitations. We propose a new approach, Reconstruction of Enhanced Causal Omnidirectional Network (RECON), that leverages an integral-based additive nonparametric ODE model to reconstruct regulatory networks from $p$ time-course data. RECON incorporates five methodological advances. First, it incorporates a new data-driven edge selection procedure that substantially reduces spurious edges while preserving true regulatory edges. Second, it reconstructs an omnidirectional network that captures causal regulatory relationships rather than merely statistical associations or noise artifacts. Third, it substantially broadens the applicability of standard ODE-based approaches by accommodating both dense regular and sparse irregular longitudinal sampling scenarios. Fourth, it models both node trajectories and edge regulatory effects as time-varying functions, emphasizing a dynamic regulatory network. Fifth, it reconstructs a signed and weighted regulatory network and provides comprehensive network interpretation through two-way direction, activatory/inhibitory indicator, and strength, together with keystone node identification and topological structure. Across five simulation studies, RECON consistently outperforms GRADE by removing nearly all spurious edges while retaining nearly all true regulatory edges, resulting in highly accurate network reconstruction. In the most challenging scenario, the number of spurious edges is reduced from 239 to 0.

View free PDFSource page

Related papers

arxivcs.CVeess.IVstat.MEstat.ML2026-07-23

Toward High-Fidelity 3D Point-Cloud Learning for Brain Folding Morphology Prediction Using Trans-Unet

Geran Zhao, Xiaotian Li, Poorya Chavoshnejad, Mir Jalil Razavi, Akbar Solhtalab, Lijun Yin, et al.

Learning high-fidelity point-cloud features in the 3D space poses significant challenges, including permutation invariance, lack of local context, difficulty in fine-grained surface reconstruction, and high computational cost. In this article, we propose Trans-Unet, a novel frame…

View free PDFSource page
arxivstat.MLcs.LGmath.STstat.COstat.ME2026-07-10

Deep Gaussian Processes on Directed Acyclic Graphs

Federico L. Perlino, Oliver Hamelijnck, Adam M. Johansen, Theodoros Damoulas

Many real-world processes can be represented as compositions of functions along a directed acyclic graph (DAG). In causal modelling, these correspond to the underlying mechanisms; in engineering, to multiple fidelity levels; and in gene-regulatory networks, to transcription facto…

View free PDFSource page
arxivstat.MEmath.STstat.ML2026-07-03

Outcome-adapted Automatic Debiased Machine Learning

Asger Waagepetersen, Asbjørn Risom, Niels Richard Hansen, Anton Rask Lundborg

Parameters of interest in causal inference, such as treatment or policy effects, can often be expressed as linear functionals of an outcome regression function. Automatic debiased machine learning (AutoDML) is a unified framework for obtaining asymptotically normal estimators of…

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