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.

Christoph Schultheiss

dblp:331/3479 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 1 first-author · 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
2 papers
Probabilistic and Bayesian machine learning · 95% Deep learning architectures and training · 5%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning
causal inference
1.422024
Assessing the Overall and Partial Causal Well-Specification of Nonlinear Additive Noise Models · J. Mach. Learn. Res. 2024
On the Identifiability and Estimation of Causal Location-Scale Noise Models · ICML 2023
Machine learning › Probabilistic and Bayesian machine learning › causal inference › causal discovery
additive noise model
0.812024
Assessing the Overall and Partial Causal Well-Specification of Nonlinear Additive Noise Models · J. Mach. Learn. Res. 2024
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
model misspecification
0.812024
Assessing the Overall and Partial Causal Well-Specification of Nonlinear Additive Noise Models · J. Mach. Learn. Res. 2024
Machine learning › Probabilistic and Bayesian machine learning › causal inference
causal discovery
0.712023
On the Identifiability and Estimation of Causal Location-Scale Noise Models · ICML 2023
Machine learning › Deep learning architectures and training
neural network estimator
0.212023
On the Identifiability and Estimation of Causal Location-Scale Noise Models · ICML 2023

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

nonlinear additive noise models · 0.8neural network · 0.7maximum likelihood estimation · 0.7feature maps · 0.7
YearPublicationVenuePosition
2024 Assessing the Overall and Partial Causal Well-Specification of Nonlinear Additive Noise Models
abstract
We propose a method to detect model misspecifications in nonlinear causal additive and potentially heteroscedastic noise models. We aim to identify predictor variables for which we can infer the causal effect even in cases of such misspecification. We develop a general framework based on knowledge of the multivariate observational data distribution. We then propose an algorithm for finite sample data, discuss its asymptotic properties, and illustrate its performance on simulated and real data.
Christoph Schultheiss, Peter Bühlmann
J. Mach. Learn. Res.1
2023 On the Identifiability and Estimation of Causal Location-Scale Noise Models
abstract
We study the class of location-scale or heteroscedastic noise models (LSNMs), in which the effect $Y$ can be written as a function of the cause $X$ and a noise source $N$ independent of $X$, which may be scaled by a positive function $g$ over the cause, i.e., $Y = f(X) + g(X)N$. Despite the generality of the model class, we show the causal direction is identifiable up to some pathological cases. To empirically validate these theoretical findings, we propose two estimators for LSNMs: an estimator based on (non-linear) feature maps, and one based on neural networks. Both model the conditional distribution of $Y$ given $X$ as a Gaussian parameterized by its natural parameters. When the feature maps are correctly specified, we prove that our estimator is jointly concave, and a consistent estimator for the cause-effect identification task. Although the the neural network does not inherit those guarantees, it can fit functions of arbitrary complexity, and reaches state-of-the-art performance across benchmarks.
Alexander Immer, Christoph Schultheiss, Julia E. Vogt, Bernhard Schölkopf, Peter Bühlmann, Alexander Marx 0001
ICML2