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

Julia Kostin

dblp:342/8159 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
—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 · 46% Trustworthy machine learning · 36% Representation and self-supervised learning · 18%

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.122025
Doubly robust identification of treatment effects from multiple environments · ICLR 2025
Achievable distributional robustness when the robust risk is only partially identified · NeurIPS 2024
Machine learning › Probabilistic and Bayesian machine learning › causal inference › causal effect estimation
treatment effect estimation
0.912025
Doubly robust identification of treatment effects from multiple environments · ICLR 2025
Machine learning › Trustworthy machine learning › robustness
distributional robustness
0.812024
Achievable distributional robustness when the robust risk is only partially identified · NeurIPS 2024
Machine learning › Representation and self-supervised learning › causal representation learning
identifiability
0.812024
Achievable distributional robustness when the robust risk is only partially identified · NeurIPS 2024
Machine learning › Trustworthy machine learning
robustness
0.812024
Achievable distributional robustness when the robust risk is only partially identified · NeurIPS 2024

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

structural causal model · 0.8minimax analysis · 0.8
YearPublicationVenuePosition
2025 Doubly robust identification of treatment effects from multiple environments
abstract
Practical and ethical constraints often require the use of observational data for causal inference, particularly in medicine and social sciences. Yet, observational datasets are prone to confounding, potentially compromising the validity of causal conclusions. While it is possible to correct for biases if the underlying causal graph is known, this is rarely a feasible ask in practical scenarios. A common strategy is to adjust for all available covariates, yet this approach can yield biased treatment effect estimates, especially when post-treatment or unobserved variables are present. We propose RAMEN, an algorithm that produces unbiased treatment effect estimates by leveraging the heterogeneity of multiple data sources without the need to know or learn the underlying causal graph. Notably, RAMEN achieves *doubly robust identification*: it can identify the treatment effect whenever the causal parents of the treatment or those of the outcome are observed, and the node whose parents are observed satisfies an invariance assumption. Empirical evaluations across synthetic, semi-synthetic, and real-world datasets show that our approach significantly outperforms existing methods.
Piersilvio De Bartolomeis, Julia Kostin, Javier Abad, Fanny Yang
ICLR2
2024 Achievable distributional robustness when the robust risk is only partially identified
abstract
In safety-critical applications, machine learning models should generalize well under worst-case distribution shifts, that is, have a small robust risk. Invariance-based algorithms can provably take advantage of structural assumptions on the shifts when the training distributions are heterogeneous enough to identify the robust risk. However, in practice, such identifiability conditions are rarely satisfied – a scenario so far underexplored in the theoretical literature. In this paper, we aim to fill the gap and propose to study the more general setting of partially identifiable robustness. In particular, we define a new risk measure, the identifiable robust risk, and its corresponding (population) minimax quantity that is an algorithm-independent measure for the best achievable robustness under partial identifiability. We introduce these concepts broadly, and then study them within the framework of linear structural causal models for concreteness of the presentation. We use the introduced minimax quantity to show how previous approaches provably achieve suboptimal robustness in the partially identifiable case. We confirm our findings through empirical simulations and real-world experiments and demonstrate how the test error of existing robustness methods grows increasingly suboptimal as the proportion of previously unseen test directions increases.
Julia Kostin, Nicola Gnecco, Fanny Yang
NeurIPS1