VLDB 2026 Research / reviewers in the wild / expert
Urmi Ninad
dblp:346/1025
· DBLP profile ↗
6ranked-venue papers
0as first author
6since 2021 · last 2025
0000-0001-6138-5643ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 6 · 6 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
4 papers |
Probabilistic and Bayesian machine learning · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Probabilistic and Bayesian machine learning › causal inference
causal discovery |
2.9 | 4 | 2025 | SPACETIME: Causal Discovery from Non-Stationary Time Series · AAAI 2025 Causal discovery with endogenous context variables · NeurIPS 2024 Vector Causal Inference between Two Groups of Variables · AAAI 2023 |
Machine learning › Probabilistic and Bayesian machine learning
causal inference |
2.0 | 3 | 2024 | Causal discovery with endogenous context variables · NeurIPS 2024 Vector Causal Inference between Two Groups of Variables · AAAI 2023 Conditional Independence Testing with Heteroskedastic Data and Applications to Causal Discovery · NeurIPS 2022 |
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models › conditional independence
conditional independence testing |
1.3 | 2 | 2024 | Causal discovery with endogenous context variables · NeurIPS 2024 Conditional Independence Testing with Heteroskedastic Data and Applications to Causal Discovery · NeurIPS 2022 |
Machine learning › Probabilistic and Bayesian machine learning › structured models
graphical models |
0.7 | 1 | 2023 | Vector Causal Inference between Two Groups of Variables · AAAI 2023 |
Machine learning › Probabilistic and Bayesian machine learning › causal inference › causal discovery
constraint-based causal discovery |
0.6 | 1 | 2022 | Conditional Independence Testing with Heteroskedastic Data and Applications to Causal Discovery · NeurIPS 2022 |
Methods — techniques the papers use, named apart from their topics
constraint-based causal discovery · 1.4structural causal model · 1.3non-parametric functional modeling · 0.9minimum description length · 0.9kernelized discrepancy testing · 0.9sparsity estimation · 0.7graphical model · 0.7partial correlation test · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | SPACETIME: Causal Discovery from Non-Stationary Time SeriesabstractUnderstanding causality is challenging and often complicated by changing causal relationships over time and across environments. Climate patterns, for example, shift over time with recurring seasonal trends, while also depending on geographical characteristics such as ecosystem variability. Existing methods for discovering causal graphs from time series either assume stationarity, do not permit both temporal and spatial distribution changes, or are unaware of locations with the same causal relationships. In this work, we therefore unify the three tasks of causal graph discovery in the non-stationary multi-context setting, of reconstructing temporal regimes, and of partitioning datasets and time intervals into those where invariant causal relationships hold. To construct a consistent score that forms the basis of our method, we employ the Minimum Description Length principle. Our resulting algorithm SPACETIME simultaneously accounts for heterogeneity across space and non-stationarity over time. Given multiple time series, it discovers regime changepoints and a temporal causal graph using non-parametric functional modeling and kernelized discrepancy testing. We also show that our method provides insights into real-world phenomena such as river-runoff measured at different catchments and biosphere-atmosphere interactions across ecosystems. Sarah Mameche, Lénaïg Cornanguer, Urmi Ninad, Jilles Vreeken |
AAAI | 3 |
| 2024 | Causal discovery with endogenous context variablesabstractSystems with variations of the underlying generating mechanism between different contexts, i.e., different environments or internal states in which the system operates, are common in the real world, such as soil moisture regimes in Earth science. Besides understanding the shared properties of the system, in practice, the question of context-specific properties, i.e., the change in causal relationships between contexts, arises. For real-world data, contexts are often driven by system variables, e.g., precipitation highly influences soil moisture. Nevertheless, this setup needs to be studied more. To account for such endogenous contexts in causal discovery, our work proposes a constraint-based method that can efficiently discover context-specific causal graphs using an adaptive testing approach. Our approach tests conditional independence on the pooled datasets to infer the dependence between system variables, including the context, to avoid introducing selection bias. To yield context-specific insights, conditional independence is tested on context-specific data. We work out the theoretical framework for this adaptive testing approach and give a detailed discussion of the connection to structural causal models, including sufficiency assumptions, which allow to prove the soundness of our algorithm and to interpret the results causally. A simulation study to evaluate numerical properties shows that our approach behaves as expected, but also leads to a further understanding of current limitations and viable extensions. Wiebke Günther, Oana-Iuliana Popescu, Martin Rabel, Urmi Ninad, Andreas Gerhardus, Jakob Runge |
NeurIPS | 4 |
| 2023 | Vector Causal Inference between Two Groups of VariablesabstractMethods to identify cause-effect relationships currently mostly assume the variables to be scalar random variables. However, in many fields the objects of interest are vectors or groups of scalar variables. We present a new constraint-based non-parametric approach for inferring the causal relationship between two vector-valued random variables from observational data. Our method employs sparsity estimates of directed and undirected graphs and is based on two new principles for groupwise causal reasoning that we justify theoretically in Pearl's graphical model-based causality framework. Our theoretical considerations are complemented by two new causal discovery algorithms for causal interactions between two random vectors which find the correct causal direction reliably in simulations even if interactions are nonlinear. We evaluate our methods empirically and compare them to other state-of-the-art techniques. Jonas Wahl, Urmi Ninad, Jakob Runge |
AAAI | 2 |
| 2023 | Causal Discovery for time series from multiple datasets with latent contextsabstractCausal discovery from time series data is a typical problem setting across the sciences. Often, multiple datasets of the same system variables are available, for instance, time series of river runoff from different catchments. The local catchment systems then share certain causal parents, such as time-dependent large-scale weather over all catchments, but differ in other catchment-specific drivers, such as the altitude of the catchment. These drivers can be called temporal and spatial contexts, respectively, and are often partially unobserved. Pooling the datasets and considering the joint causal graph among system, context, and certain auxiliary variables enables us to overcome such latent confounding of system variables. In this work, we present a non-parametric time series causal discovery method, J(oint)-PCMCI$^+$, that efficiently learns such joint causal time series graphs when both observed and latent contexts are present, including time lags. We present asymptotic consistency results and numerical experiments demonstrating the utility and limitations of the method. Wiebke Günther, Urmi Ninad, Jakob Runge |
UAI | 2 |
| 2023 | Increasing effect sizes of pairwise conditional independence tests between random vectorsabstractA simple approach to test for conditional independence of two random vectors given a third random vector is to simultaneously test for conditional independence of every pair of components of the two random vectors given the third random vector. In this work, we show that conditioning on additional components of the two random vectors that are independent given the third one increases the tests’ effect sizes while leaving the validity of the overall approach unchanged. We leverage this result to derive a practical pairwise testing algorithm that first chooses tests with a relatively large effect size and then does the actual testing. We show both numerically and theoretically that our algorithm outperforms standard pairwise independence testing and other existing methods if the dependence within the two random vectors is sufficiently high. Tom Hochsprung, Jonas Wahl, Andreas Gerhardus, Urmi Ninad, Jakob Runge |
UAI | 4 |
| 2022 | Conditional Independence Testing with Heteroskedastic Data and Applications to Causal DiscoveryabstractConditional independence (CI) testing is frequently used in data analysis and machine learning for various scientific fields and it forms the basis of constraint-based causal discovery. Oftentimes, CI testing relies on strong, rather unrealistic assumptions. One of these assumptions is homoskedasticity, in other words, a constant conditional variance is assumed. 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. Further, we provide theoretical consistency results for the proposed CI test which carry over to causal discovery under certain assumptions. Numerical causal discovery experiments demonstrate that the adapted partial correlation CI test outperforms the standard test in the presence of heteroskedasticity and is on par for the homoskedastic case. Finally, we discuss the general challenges and limits as to how expert knowledge about heteroskedasticity can be accounted for in causal discovery. Wiebke Günther, Urmi Ninad, Jonas Wahl, Jakob Runge |
NeurIPS | 2 |