Demo Data from EDBT 2026 / reviewers in the wild / expert
Marah Ghoummaid
dblp:345/8137
· DBLP profile ↗
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 · 71% Reinforcement learning · 14% Multi-agent systems · 14% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Probabilistic and Bayesian machine learning
causal inference |
1.4 | 2 | 2024 | When to Act and When to Ask: Policy Learning With Deferral Under Hidden Confounding · NeurIPS 2024 B-Learner: Quasi-Oracle Bounds on Heterogeneous Causal Effects Under Hidden Confounding · ICML 2023 |
Machine learning › Probabilistic and Bayesian machine learning › causal inference
latent confounders |
1.4 | 2 | 2024 | When to Act and When to Ask: Policy Learning With Deferral Under Hidden Confounding · NeurIPS 2024 B-Learner: Quasi-Oracle Bounds on Heterogeneous Causal Effects Under Hidden Confounding · ICML 2023 |
Knowledge, reasoning and agents › Multi-agent systems › human-agent interaction › human-AI decision making
learning to defer |
0.8 | 1 | 2024 | When to Act and When to Ask: Policy Learning With Deferral Under Hidden Confounding · NeurIPS 2024 |
Machine learning › Reinforcement learning
policy learning |
0.8 | 1 | 2024 | When to Act and When to Ask: Policy Learning With Deferral Under Hidden Confounding · NeurIPS 2024 |
Machine learning › Probabilistic and Bayesian machine learning › causal inference
heterogeneous treatment effect estimation |
0.7 | 1 | 2023 | B-Learner: Quasi-Oracle Bounds on Heterogeneous Causal Effects Under Hidden Confounding · ICML 2023 |
Machine learning › Probabilistic and Bayesian machine learning › causal inference
causal model |
0.2 | 1 | 2024 | When to Act and When to Ask: Policy Learning With Deferral Under Hidden Confounding · NeurIPS 2024 |
Methods — techniques the papers use, named apart from their topics
surrogate loss · 0.8cost-sensitive classification · 0.8causal modeling · 0.8random forest · 0.7meta-learner · 0.7deep neural network · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | When to Act and When to Ask: Policy Learning With Deferral Under Hidden ConfoundingabstractWe consider the task of learning how to act in collaboration with a human expert based on observational data. The task is motivated by high-stake scenarios such as healthcare and welfare where algorithmic action recommendations are made to a human expert, opening the option of deferring making a recommendation in cases where the human might act better on their own.
This task is especially challenging when dealing with observational data, as using such data runs the risk of hidden confounders whose existence can lead to biased and harmful policies. However, unlike standard policy learning, the presence of a human expert can mitigate some of these risks. We build on the work of Mozannar and Sontag (2020) on consistent surrogate loss for learning with the option of deferral to an expert, where they solve a cost-sensitive supervised classification problem. Since we are solving a causal problem, where labels don’t exist, we use a causal model to learn costs which are robust to a bounded degree of hidden confounding.
We prove that our approach can take advantage of the strengths of both the model and the expert to obtain a better policy than either. We demonstrate our results by conducting experiments on synthetic and semi-synthetic data and show the advantages of our method compared to baselines. Marah Ghoummaid, Uri Shalit |
NeurIPS | 1 |
| 2023 | B-Learner: Quasi-Oracle Bounds on Heterogeneous Causal Effects Under Hidden ConfoundingabstractEstimating heterogeneous treatment effects from observational data is a crucial task across many fields, helping policy and decision-makers take better actions. There has been recent progress on robust and efficient methods for estimating the conditional average treatment effect (CATE) function, but these methods often do not take into account the risk of hidden confounding, which could arbitrarily and unknowingly bias any causal estimate based on observational data. We propose a meta-learner called the B-Learner, which can efficiently learn sharp bounds on the CATE function under limits on the level of hidden confounding. We derive the B-Learner by adapting recent results for sharp and valid bounds of the average treatment effect (Dorn et al., 2021) into the framework given by Kallus & Oprescu (2023) for robust and model-agnostic learning of conditional distributional treatment effects. The B-Learner can use any function estimator such as random forests and deep neural networks, and we prove its estimates are valid, sharp, efficient, and have a quasi-oracle property with respect to the constituent estimators under more general conditions than existing methods. Semi-synthetic experimental comparisons validate the theoretical findings, and we use real-world data demonstrate how the method might be used in practice. Miruna Oprescu, Jacob Dorn, Marah Ghoummaid, Andrew Jesson, Nathan Kallus, Uri Shalit |
ICML | 3 |