Search Results for author: Urmi Ninad

Found 5 papers, 1 papers with code

Invariance & Causal Representation Learning: Prospects and Limitations

no code implementations6 Dec 2023 Simon Bing, jonas Wahl, Urmi Ninad, Jakob Runge

In causal models, a given mechanism is assumed to be invariant to changes of other mechanisms.

Representation Learning

Identifying Linearly-Mixed Causal Representations from Multi-Node Interventions

1 code implementation5 Nov 2023 Simon Bing, Urmi Ninad, jonas Wahl, Jakob Runge

The task of inferring high-level causal variables from low-level observations, commonly referred to as causal representation learning, is fundamentally underconstrained.

Representation Learning

Projecting infinite time series graphs to finite marginal graphs using number theory

no code implementations9 Oct 2023 Andreas Gerhardus, jonas Wahl, Sofia Faltenbacher, Urmi Ninad, Jakob Runge

In this work, we develop a method for projecting infinite time series graphs with repetitive edges to marginal graphical models on a finite time window.

Causal Discovery Causal Inference +1

Conditional Independence Testing with Heteroskedastic Data and Applications to Causal Discovery

no code implementations20 Jun 2023 Wiebke Günther, Urmi Ninad, jonas Wahl, Jakob Runge

We frame heteroskedasticity in a structural causal model framework and present an adaptation of the partial correlation CI test that works well in the presence of heteroskedastic noise, given that expert knowledge about the heteroskedastic relationships is available.

Causal Discovery

Discovering Causal Relations and Equations from Data

no code implementations21 May 2023 Gustau Camps-Valls, Andreas Gerhardus, Urmi Ninad, Gherardo Varando, Georg Martius, Emili Balaguer-Ballester, Ricardo Vinuesa, Emiliano Diaz, Laure Zanna, Jakob Runge

Discovering equations, laws and principles that are invariant, robust and causal explanations of the world has been fundamental in physical sciences throughout the centuries.

Philosophy

Cannot find the paper you are looking for? You can Submit a new open access paper.