Demo Data from EDBT 2026 / reviewers in the wild / expert
Caleb Ellington
dblp:305/3662 · also Caleb N. Ellington
· DBLP profile ↗
4ranked-venue papers
0as first author
4since 2021 · last 2024
0000-0001-7029-8023ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 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 |
Reinforcement learning · 53% Probabilistic and Bayesian machine learning · 23% Learning paradigms · 12% | |
| Interdisciplinary, comprehensive, and emerging computing
2 papers |
Bioinformatics and computational biology · 68% Medical and health informatics · 32% |
Topics — the 11 heaviest of 11, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning
imitation learning |
0.8 | 1 | 2024 | Contextualized Policy Recovery: Modeling and Interpreting Medical Decisions with Adaptive Imitation Learning · ICML 2024 |
Machine learning › Reinforcement learning › imitation learning
interpretable policy learning |
0.8 | 1 | 2024 | Contextualized Policy Recovery: Modeling and Interpreting Medical Decisions with Adaptive Imitation Learning · ICML 2024 |
Machine learning › Reinforcement learning
policy learning |
0.8 | 1 | 2024 | Contextualized Policy Recovery: Modeling and Interpreting Medical Decisions with Adaptive Imitation Learning · ICML 2024 |
Bioinformatics and computational biology › systems biology
genetic perturbation modeling |
0.8 | 1 | 2024 | AttentionPert: accurately modeling multiplexed genetic perturbations with multi-scale effects · Bioinform. 2024 |
Machine learning › Probabilistic and Bayesian machine learning › causal inference
causal discovery |
0.5 | 1 | 2021 | Multi-task Learning of Order-Consistent Causal Graphs · NeurIPS 2021 |
Knowledge, reasoning and agents › Knowledge representation and reasoning › causal reasoning
causal graph discovery |
0.5 | 1 | 2021 | Multi-task Learning of Order-Consistent Causal Graphs · NeurIPS 2021 |
Machine learning › Probabilistic and Bayesian machine learning › causal inference › causal discovery
directed acyclic graph learning |
0.5 | 1 | 2021 | Multi-task Learning of Order-Consistent Causal Graphs · NeurIPS 2021 |
Machine learning › Learning paradigms
multi-task learning |
0.5 | 1 | 2021 | Multi-task Learning of Order-Consistent Causal Graphs · NeurIPS 2021 |
Medical and health informatics
clinical decision support |
0.2 | 1 | 2024 | Contextualized Policy Recovery: Modeling and Interpreting Medical Decisions with Adaptive Imitation Learning · ICML 2024 |
Bioinformatics and computational biology › biological network › network biology › network inference
gene regulatory network inference |
0.2 | 1 | 2024 | AttentionPert: accurately modeling multiplexed genetic perturbations with multi-scale effects · Bioinform. 2024 |
Medical and health informatics › clinical decision support
treatment recommendation |
0.2 | 1 | 2024 | Contextualized Policy Recovery: Modeling and Interpreting Medical Decisions with Adaptive Imitation Learning · ICML 2024 |
Methods — techniques the papers use, named apart from their topics
multi-task learning · 1.5linear model · 1.5multi-scale modeling · 0.8attention-based neural network · 0.8regularized maximum likelihood · 0.5continuous optimization · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Contextualized Policy Recovery: Modeling and Interpreting Medical Decisions with Adaptive Imitation LearningabstractInterpretable policy learning seeks to estimate intelligible decision policies from observed actions; however, existing models force a tradeoff between accuracy and interpretability, limiting data-driven interpretations of human decision-making processes. Fundamentally, existing approaches are burdened by this tradeoff because they represent the underlying decision process as a universal policy, when in fact human decisions are dynamic and can change drastically under different contexts. Thus, we develop Contextualized Policy Recovery (CPR), which re-frames the problem of modeling complex decision processes as a multi-task learning problem, where each context poses a unique task and complex decision policies can be constructed piece-wise from many simple context-specific policies. CPR models each context-specific policy as a linear map, and generates new policy models on-demand as contexts are updated with new observations. We provide two flavors of the CPR framework: one focusing on exact local interpretability, and one retaining full global interpretability. We assess CPR through studies on simulated and real data, achieving state-of-the-art performance on predicting antibiotic prescription in intensive care units ($+22$% AUROC vs. previous SOTA) and predicting MRI prescription for Alzheimer’s patients ($+7.7$% AUROC vs. previous SOTA). With this improvement, CPR closes the accuracy gap between interpretable and black-box methods, allowing high-resolution exploration and analysis of context-specific decision models. Jannik Deuschel, Caleb Ellington, Yingtao Luo, Benjamin J. Lengerich, Pascal Friederich, Eric P. Xing |
ICML | 2 |
| 2024 | AttentionPert: accurately modeling multiplexed genetic perturbations with multi-scale effectsabstractMOTIVATION: Genetic perturbations (e.g. knockouts, variants) have laid the foundation for our understanding of many diseases, implicating pathogenic mechanisms and indicating therapeutic targets. However, experimental assays are fundamentally limited by the number of measurable perturbations. Computational methods can fill this gap by predicting perturbation effects under novel conditions, but accurately predicting the transcriptional responses of cells to unseen perturbations remains a significant challenge. RESULTS: We address this by developing a novel attention-based neural network, AttentionPert, which accurately predicts gene expression under multiplexed perturbations and generalizes to unseen conditions. AttentionPert integrates global and local effects in a multi-scale model, representing both the nonuniform system-wide impact of the genetic perturbation and the localized disturbance in a network of gene-gene similarities, enhancing its ability to predict nuanced transcriptional responses to both single and multi-gene perturbations. In comprehensive experiments, AttentionPert demonstrates superior performance across multiple datasets outperforming the state-of-the-art method in predicting differential gene expressions and revealing novel gene regulations. AttentionPert marks a significant improvement over current methods, particularly in handling the diversity of gene perturbations and in predicting out-of-distribution scenarios. AVAILABILITY AND IMPLEMENTATION: Code is available at https://github.com/BaiDing1234/AttentionPert. Ding Bai, Caleb Ellington, Shentong Mo, Eric P. Xing |
Bioinform. | 2 |
| 2022 | Automated interpretable discovery of heterogeneous treatment effectiveness: A COVID-19 case study
Benjamin J. Lengerich, Mark E. Nunnally, Yindalon Aphinyanagphongs, Caleb Ellington, Rich Caruana |
J. Biomed. Informatics | 4 |
| 2021 | Multi-task Learning of Order-Consistent Causal GraphsabstractWe consider the problem of discovering $K$ related Gaussian directed acyclic graphs (DAGs), where the involved graph structures share a consistent causal order and sparse unions of supports. Under the multi-task learning setting, we propose a $l_1/l_2$-regularized maximum likelihood estimator (MLE) for learning $K$ linear structural equation models. We theoretically show that the joint estimator, by leveraging data across related tasks, can achieve a better sample complexity for recovering the causal order (or topological order) than separate estimations. Moreover, the joint estimator is able to recover non-identifiable DAGs, by estimating them together with some identifiable DAGs. Lastly, our analysis also shows the consistency of union support recovery of the structures. To allow practical implementation, we design a continuous optimization problem whose optimizer is the same as the joint estimator and can be approximated efficiently by an iterative algorithm. We validate the theoretical analysis and the effectiveness of the joint estimator in experiments. Xinshi Chen, Caleb Ellington, Eric P. Xing |
NeurIPS | 3 |