3 papers
stat.ME2026
A Topological Sorting Criterion for Random Causal Directed Acyclic Graphs
Alexander G. Reisach, Antoine Chambaz, Gilles Blanchard +1
Random directed acyclic graphs (DAGs) based on imposing an order on Erdős-Rényi and scale free random graphs are widely used for evaluating causal discovery algorithms. We show tha…
stat.ML2025
Transforming Conditional Density Estimation Into a Single Nonparametric Regression Task
Alexander G. Reisach, Olivier Collier, Alex Luedtke +1
We propose a way of transforming the problem of conditional density estimation into a single nonparametric regression task via the introduction of auxiliary samples. This allows le…
stat.ME2025
The Case for Time in Causal DAGs
Alexander G. Reisach, Alberto Suárez, Sebastian Weichwald +1
We make the case for incorporating a notion of time into causal directed acyclic graphs (DAGs). We demonstrate that nontemporal causal DAGs are ambiguous and obstruct justification…