Enes Causal Discovery

• URL: http://arxiv.org/abs/2603.24436v3
• Date: Tue, 31 Mar 2026 10:17:55 GMT
• Title: Enes Causal Discovery
• Abstract summary: The proposed architecture is a mixture of experts, which allows for the model entities, such as the causal relationships, to be further parameterized.<n>An attempt is made to exploit a neural net as implementing neurons poses a great challenge for this dataset.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Enes The proposed architecture is a mixture of experts, which allows for the model entities, such as the causal relationships, to be further parameterized. More specifically, an attempt is made to exploit a neural net as implementing neurons poses a great challenge for this dataset. To explain, a simple and fast Pearson coefficient linear model usually achieves good scores. An aggressive baseline that requires a really good model to overcome that is. Moreover, there are major limitations when it comes to causal discovery of observational data. Unlike the sachs one did not use interventions but only prior knowledge; the most prohibiting limitation is that of the data which is addressed. Thereafter, the method and the model are described and after that the results are presented.

Related papers

• NeuronTune: Towards Self-Guided Spurious Bias Mitigation [26.544938760265136]
  Deep neural networks often develop spurious bias, reliance on correlations between non-essential features and classes for predictions.<n>Existing mitigation approaches typically depend on external annotations of spurious correlations.<n>We propose NeuronTune, a post hoc method that directly intervenes in a model's internal decision process.
  arXiv  Detail & Related papers  (2025-05-29T22:33:00Z)
• Why Do More Experts Fail? A Theoretical Analysis of Model Merging [51.18155031364046]
  Model merging dramatically reduces storage and computational resources by combining multiple expert models into a single multi-task model.<n>Recent model merging methods have shown promising results, but struggle to maintain performance gains as the number of merged models increases.<n>We show that the limited effective parameter space imposes a strict constraint on the number of models that can be successfully merged.
  arXiv  Detail & Related papers  (2025-05-27T14:10:46Z)
• CAnDOIT: Causal Discovery with Observational and Interventional Data from Time-Series [4.008958683836471]
  CAnDOIT is a causal discovery method to reconstruct causal models using both observational and interventional data. The use of interventional data in the causal analysis is crucial for real-world applications, such as robotics. A Python implementation of CAnDOIT has also been developed and is publicly available on GitHub.
  arXiv  Detail & Related papers  (2024-10-03T13:57:08Z)
• Sample, estimate, aggregate: A recipe for causal discovery foundation models [28.116832159265964]
  Causal discovery has the potential to uncover mechanistic insights from biological experiments.<n>We propose a supervised model trained on large-scale, synthetic data to predict causal graphs.<n>Our approach is enabled by the observation that typical errors in the outputs of a discovery algorithm remain comparable across datasets.
  arXiv  Detail & Related papers  (2024-02-02T21:57:58Z)
• Layer-wise Linear Mode Connectivity [52.6945036534469]
  Averaging neural network parameters is an intuitive method for the knowledge of two independent models. It is most prominently used in federated learning. We analyse the performance of the models that result from averaging single, or groups.
  arXiv  Detail & Related papers  (2023-07-13T09:39:10Z)
• Advancing Counterfactual Inference through Nonlinear Quantile Regression [77.28323341329461]
  We propose a framework for efficient and effective counterfactual inference implemented with neural networks. The proposed approach enhances the capacity to generalize estimated counterfactual outcomes to unseen data. Empirical results conducted on multiple datasets offer compelling support for our theoretical assertions.
  arXiv  Detail & Related papers  (2023-06-09T08:30:51Z)
• On the Generalization and Adaption Performance of Causal Models [99.64022680811281]
  Differentiable causal discovery has proposed to factorize the data generating process into a set of modules. We study the generalization and adaption performance of such modular neural causal models. Our analysis shows that the modular neural causal models outperform other models on both zero and few-shot adaptation in low data regimes.
  arXiv  Detail & Related papers  (2022-06-09T17:12:32Z)
• Causal discovery for observational sciences using supervised machine learning [1.6631602844999722]
  Causal inference can estimate causal effects, but unless data are collected experimentally, statistical analyses must rely on pre-specified causal models. Severalally correct methods already exist, but they generally struggle on smaller samples. Most methods focus on very sparse causal models, which may not always be a realistic representation of real-life data generating mechanisms. We propose a new causal discovery method that addresses these three shortcomings: Supervised learning discovery (SLdisco)
  arXiv  Detail & Related papers  (2022-02-25T16:44:00Z)
• Efficient Causal Inference from Combined Observational and Interventional Data through Causal Reductions [68.6505592770171]
  Unobserved confounding is one of the main challenges when estimating causal effects. We propose a novel causal reduction method that replaces an arbitrary number of possibly high-dimensional latent confounders. We propose a learning algorithm to estimate the parameterized reduced model jointly from observational and interventional data.
  arXiv  Detail & Related papers  (2021-03-08T14:29:07Z)
• Causal Expectation-Maximisation [70.45873402967297]
  We show that causal inference is NP-hard even in models characterised by polytree-shaped graphs. We introduce the causal EM algorithm to reconstruct the uncertainty about the latent variables from data about categorical manifest variables. We argue that there appears to be an unnoticed limitation to the trending idea that counterfactual bounds can often be computed without knowledge of the structural equations.
  arXiv  Detail & Related papers  (2020-11-04T10:25:13Z)
• Amortized learning of neural causal representations [10.140457813764554]
  Causal models can compactly and efficiently encode the data-generating process under all interventions. These models are often represented as Bayesian networks and learning them scales poorly with the number of variables. We represent a novel algorithm called textitcausal relational networks (CRN) for learning causal models using neural networks.
  arXiv  Detail & Related papers  (2020-08-21T04:35:06Z)
• Learning Causal Models Online [103.87959747047158]
  Predictive models can rely on spurious correlations in the data for making predictions. One solution for achieving strong generalization is to incorporate causal structures in the models. We propose an online algorithm that continually detects and removes spurious features.
  arXiv  Detail & Related papers  (2020-06-12T20:49:20Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.