Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Juraj Bodik

dblp:383/9058 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 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
1 paper
Knowledge representation and reasoning · 50% Probabilistic and Bayesian machine learning · 25% Representation and self-supervised learning · 25%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › causal inference
causal discovery
0.912025
Identifiability of Causal Graphs under Non-Additive Conditionally Parametric Causal Models · J. Mach. Learn. Res. 2025
Knowledge, reasoning and agents › Knowledge representation and reasoning › causal reasoning
causal graphical model
0.912025
Identifiability of Causal Graphs under Non-Additive Conditionally Parametric Causal Models · J. Mach. Learn. Res. 2025
Knowledge, reasoning and agents › Knowledge representation and reasoning
causal reasoning
0.912025
Identifiability of Causal Graphs under Non-Additive Conditionally Parametric Causal Models · J. Mach. Learn. Res. 2025
Machine learning › Representation and self-supervised learning › causal representation learning
identifiability
0.912025
Identifiability of Causal Graphs under Non-Additive Conditionally Parametric Causal Models · J. Mach. Learn. Res. 2025

Methods — techniques the papers use, named apart from their topics

sufficient statistics · 0.9conditional parametric model · 0.9
YearPublicationVenuePosition
2025 Identifiability of Causal Graphs under Non-Additive Conditionally Parametric Causal Models
abstract
Existing approaches to causal discovery often rely on restrictive modeling assumptions that limit their applicability in real-world settings, particularly when data are heavy-tailed or contain a mixture of discrete and continuous variables. Identifiability of causal graphs has been established under several structural models, including linear non-Gaussian models, post-nonlinear models, and location-scale models. However, these frameworks may not capture the diversity of distributions observed in practice. To address this, we introduce Conditionally Parametric Causal Models (CPCM), a flexible class of models where the conditional distribution of the effect, given its cause, belongs to a known parametric family such as Gaussian, Poisson, Gamma, or Pareto. These models are adaptable to a wide range of practical situations, where the cause influences not only the mean but also the variance or tail behavior of the effect. We demonstrate the identifiability of CPCM by leveraging the concept of sufficient statistics. Furthermore, we propose an algorithm for estimating the causal structure from random samples drawn from CPCM. We evaluate the empirical properties of our methodology on various datasets, demonstrating state-of-the-art performance across multiple benchmarks.
Juraj Bodik, Valérie Chavez-Demoulin
J. Mach. Learn. Res.1