Demo Data from EDBT 2026 / reviewers in the wild / expert
Andrea Bontempelli
dblp:269/4490
· DBLP profile ↗
4ranked-venue papers
3as first author
3since 2021 · last 2023
0000-0001-7037-5797ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 2 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author
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
3 papers |
Trustworthy machine learning · 75% Probabilistic and Bayesian machine learning · 11% Learning paradigms · 11% | |
| Software engineering, system software, and programming languages
1 paper |
Program analysis · 100% |
Topics — the 7 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Trustworthy machine learning
interpretability |
1.2 | 2 | 2023 | Concept-level Debugging of Part-Prototype Networks · ICLR 2023 Interactive Label Cleaning with Example-based Explanations · NeurIPS 2021 |
Machine learning › Trustworthy machine learning › interpretability
example-based explanation |
0.5 | 1 | 2021 | Interactive Label Cleaning with Example-based Explanations · NeurIPS 2021 |
Machine learning › Trustworthy machine learning › robustness
learning with noisy labels |
0.5 | 1 | 2021 | Interactive Label Cleaning with Example-based Explanations · NeurIPS 2021 |
Machine learning › Trustworthy machine learning › robustness › learning with noisy labels
noisy label correction |
0.5 | 1 | 2021 | Interactive Label Cleaning with Example-based Explanations · NeurIPS 2021 |
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes
gaussian process |
0.4 | 1 | 2020 | Learning in the Wild with Incremental Skeptical Gaussian Processes · IJCAI 2020 |
Machine learning › Learning paradigms
incremental learning |
0.4 | 1 | 2020 | Learning in the Wild with Incremental Skeptical Gaussian Processes · IJCAI 2020 |
Knowledge, reasoning and agents › Multi-agent systems › human-agent interaction
human-in-the-loop learning |
0.1 | 1 | 2021 | Interactive Label Cleaning with Example-based Explanations · NeurIPS 2021 |
Methods — techniques the papers use, named apart from their topics
part-prototype network · 1.3interactive relabeling · 0.5influence functions · 0.5fisher information matrix · 0.5skeptical learning · 0.4gaussian process · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Concept-level Debugging of Part-Prototype Networks
Andrea Bontempelli, Stefano Teso, Katya Tentori, Fausto Giunchiglia, Andrea Passerini |
ICLR | 1 |
| 2022 | Human-in-the-loop handling of knowledge driftabstractAbstract We introduce and study knowledge drift (KD), a special form of concept drift that occurs in hierarchical classification. Under KD the vocabulary of concepts, their individual distributions, and the is-a relations between them can all change over time. The main challenge is that, since the ground-truth concept hierarchy is unobserved, it is hard to tell apart different forms of KD. For instance, the introduction of a new is-a relation between two concepts might be confused with changes to those individual concepts, but it is far from equivalent. Failure to identify the right kind of KD compromises the concept hierarchy used by the classifier, leading to systematic prediction errors. Our key observation is that in human-in-the-loop applications like smart personal assistants the user knows what kind of drift occurred recently, if any. Motivated by this observation, we introduce trckd, a novel approach that combines two automated stages—drift detection and adaptation—with a new interactive disambiguation stage in which the user is asked to refine the machine’s understanding of recently detected KD. In addition, trckd implements a simple but effective knowledge-aware adaptation strategy. Our simulations show that, when the structure of the concept hierarchy drifts, a handful of queries to the user are often enough to substantially improve prediction performance on both synthetic and realistic data. Andrea Bontempelli, Fausto Giunchiglia, Andrea Passerini, Stefano Teso |
Data Min. Knowl. Discov. | 1 |
| 2021 | Interactive Label Cleaning with Example-based ExplanationsabstractWe tackle sequential learning under label noise in applications where a human supervisor can be queried to relabel suspicious examples. Existing approaches are flawed, in that they only relabel incoming examples that look "suspicious" to the model. As a consequence, those mislabeled examples that elude (or don't undergo) this cleaning step end up tainting the training data and the model with no further chance of being cleaned. We propose CINCER, a novel approach that cleans both new and past data by identifying \emph{pairs of mutually incompatible examples}. Whenever it detects a suspicious example, CINCER identifies a counter-example in the training set that - according to the model - is maximally incompatible with the suspicious example, and asks the annotator to relabel either or both examples, resolving this possible inconsistency. The counter-examples are chosen to be maximally incompatible, so to serve as \emph{explanations} of the model's suspicion, and highly influential, so to convey as much information as possible if relabeled. CINCER achieves this by leveraging an efficient and robust approximation of influence functions based on the Fisher information matrix (FIM). Our extensive empirical evaluation shows that clarifying the reasons behind the model's suspicions by cleaning the counter-examples helps in acquiring substantially better data and models, especially when paired with our FIM approximation. Stefano Teso, Andrea Bontempelli, Fausto Giunchiglia, Andrea Passerini |
NeurIPS | 2 |
| 2020 | Learning in the Wild with Incremental Skeptical Gaussian ProcessesabstractThe ability to learn from human supervision is fundamental for personal assistants and other interactive applications of AI. Two central challenges for deploying interactive learners in the wild are the unreliable nature of the supervision and the varying complexity of the prediction task. We address a simple but representative setting, incremental classification in the wild, where the supervision is noisy and the number of classes grows over time. In order to tackle this task, we propose a redesign of skeptical learning centered around Gaussian Processes (GPs). Skeptical learning is a recent interactive strategy in which, if the machine is sufficiently confident that an example is mislabeled, it asks the annotator to reconsider her feedback. In many cases, this is often enough to obtain clean supervision. Our redesign, dubbed ISGP , leverages the uncertainty estimates supplied by GPs to better allocate labeling and contradiction queries, especially in the presence of noise. Our experiments on synthetic and real-world data show that, as a result, while the original formulation of skeptical learning produces over-confident models that can fail completely in the wild, ISGP works well at varying levels of noise and as new classes are observed. Andrea Bontempelli, Stefano Teso, Fausto Giunchiglia, Andrea Passerini |
IJCAI | 1 |