Demo Data from EDBT 2026 / reviewers in the wild / expert
Erfan Hajihashemi
dblp:393/0509
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2024
—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 |
Trustworthy machine learning · 83% Learning theory · 17% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Trustworthy machine learning › uncertainty estimation › conformal prediction
adaptive conformal inference |
0.8 | 1 | 2024 | Multi-model Ensemble Conformal Prediction in Dynamic Environments · NeurIPS 2024 |
Machine learning › Trustworthy machine learning › uncertainty estimation
conformal prediction |
0.8 | 1 | 2024 | Multi-model Ensemble Conformal Prediction in Dynamic Environments · NeurIPS 2024 |
Machine learning › Trustworthy machine learning
uncertainty estimation |
0.8 | 1 | 2024 | Multi-model Ensemble Conformal Prediction in Dynamic Environments · NeurIPS 2024 |
Machine learning › Learning theory › online learning › regret bounds
adaptive regret |
0.2 | 1 | 2024 | Multi-model Ensemble Conformal Prediction in Dynamic Environments · NeurIPS 2024 |
Machine learning › Learning theory
online learning |
0.2 | 1 | 2024 | Multi-model Ensemble Conformal Prediction in Dynamic Environments · NeurIPS 2024 |
Methods — techniques the papers use, named apart from their topics
regret analysis · 0.8model selection · 0.8conformal prediction · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Multi-model Ensemble Conformal Prediction in Dynamic EnvironmentsabstractConformal prediction is an uncertainty quantification method that constructs a prediction set for a previously unseen datum, ensuring the true label is included with a predetermined coverage probability. Adaptive conformal prediction has been developed to address data distribution shifts in dynamic environments. However, the efficiency of prediction sets varies depending on the learning model used. Employing a single fixed model may not consistently offer the best performance in dynamic environments with unknown data distribution shifts. To address this issue, we introduce a novel adaptive conformal prediction framework, where the model used for creating prediction sets is selected ‘on the fly’ from multiple candidate models. The proposed algorithm is proven to achieve strongly adaptive regret over all intervals while maintaining valid coverage. Experiments on both real and synthetic datasets corroborate that the proposed approach consistently yields more efficient prediction sets while maintaining valid coverage, outperforming alternative methods. Erfan Hajihashemi, Yanning Shen |
NeurIPS | 1 |