Loading
Life sciences · Preprint
arXiv · September 3, 2026
Raises a question worth testing. It does not answer one.
This preprint describes FedRCD, a family of federated algorithms for causal discovery using higher-order cumulant tensors, designed to overcome limitations of existing methods under privacy constraints. The authors demonstrate that cumulant-based methods rank variables by variance ladders rather than population asymmetry, with numerical experiments suggesting marginal standardisation affects performance. The work is methodological and lacks peer review, clinical validation, or real-world deployment evidence.
Preprint. Intervention: FedRCD family of causal discovery algorithms using higher-order cumulant tensors, with three variants trading off communication rounds against algebraic noise. Compared with: FedISHC (prior federated method) and centralised DirectLiNGAM algorithm.
FedRCD algorithms enable causal discovery in federated environments with single communication round sufficiency in horizontal, vertical, and hybrid partitions FedISHC, the prior federated method, breaks down under near-symmetric noise; FedRCD variants overcome this limitation At typical real-deployment sample sizes, cumulant-based methods rank variables by variance ladder induced by directed acyclic graph, not population asymmetry
Safety was not reported in the material analysed. Check the source before drawing any conclusion about harm.
The source did not state who this applies to in practice.
This is a methodological paper presenting new computational algorithms for federated causal discovery; it reports numerical experiments on simulated data but does not test clinical or real-world outcomes, and lacks peer review.
As stated by the source record.
Graded across the dimensions that decide whether you should act, each from what the source actually supports. There is no single score, and where a dimension was not assessed it says so.
What is missing. This record has no reported figures. That is a gap in the analysis, not a judgement about the study.
In this paper we study linear non-Gaussian acyclic models (LiNGAM) when used in federated environments. These causal models allow one to go beyond Markov equivalence. However, in many domains data are scarce, and increasing the sample size by centralising data from different clients is not advisable due to regulations such as the GDPR. The federated environment offers an attractive option to balance privacy and causal discovery accuracy. Unfortunately, the standard centralised estimator in the LiNGAM setting, i.e., DirectLiNGAM, cannot be straightforwardly federated. Higher-order cumulant tensors offer a way around this obstacle: they depend only on the joint distribution of the variables involved and add exactly across independent sample groups, so a single communication round suffices in horizontal, vertical, and hybrid partitions. However, FedISHC, i.e., the current federated method along these lines, breaks down under near-symmetric noise. To overcome the above limitation, we introduce the FedRCD family of causal discovery algorithms, and investigate three variants that trade off communication rounds against algebraic noise; two of them are exact federated counterparts of the centralised high-order cumulant (HC) and HC-LiNGAM algorithms, and the single-round variants further effectively support exact unlearning at any granularity, from a single observation to a whole client. Numerical experiments show that at sample sizes typical of real deployments, the entire cumulant-based federated family does not actually rank variables by the population asymmetry that the scores encode at zero. It ranks them by a variance ladder induced by the DAG along its directed paths, the cumulant counterpart of varsortability. Marginal standardisation collapses every cumulant method to near-random ordering, while scale-invariant DirectLiNGAM, not federable under this protocol, is unaffected.
Taken from the source record, never inferred. Follow any of these and new work involving them reaches your briefing.