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

Thomas Decker 0004

dblp:351/4532 · DBLP profile ↗
← Back
8ranked-venue papers
6as first author
8since 2021 · last 2026
0009-0003-4868-988XORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 5 · 3 first-author · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Security and privacy · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 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
3 papers
Trustworthy machine learning · 86% Transfer learning and domain adaptation · 8% Language models and text generation · 2%

Topics — the 11 heaviest of 12, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
interpretability
1.522024
Explanatory Model Monitoring to Understand the Effects of Feature Shifts on Performance · KDD 2024
Provably Better Explanations with Optimized Aggregation of Feature Attributions · ICML 2024
Machine learning › Trustworthy machine learning › uncertainty estimation
large language model uncertainty
1.012026
Fine-grained Uncertainty Decomposition in Large Language Models: A Spectral Approach · AAAI 2026
Machine learning › Trustworthy machine learning › uncertainty estimation
uncertainty decomposition
1.012026
Fine-grained Uncertainty Decomposition in Large Language Models: A Spectral Approach · AAAI 2026
Machine learning › Trustworthy machine learning
uncertainty estimation
1.012026
Fine-grained Uncertainty Decomposition in Large Language Models: A Spectral Approach · AAAI 2026
Machine learning › Trustworthy machine learning
robustness
1.022024
Explanatory Model Monitoring to Understand the Effects of Feature Shifts on Performance · KDD 2024
Provably Better Explanations with Optimized Aggregation of Feature Attributions · ICML 2024
Machine learning › Trustworthy machine learning › interpretability
explanation aggregation
0.812024
Provably Better Explanations with Optimized Aggregation of Feature Attributions · ICML 2024
Machine learning › Trustworthy machine learning › interpretability › attribution methods
feature attribution
0.812024
Provably Better Explanations with Optimized Aggregation of Feature Attributions · ICML 2024
Machine learning › Transfer learning and domain adaptation › domain shift
feature shift
0.812024
Explanatory Model Monitoring to Understand the Effects of Feature Shifts on Performance · KDD 2024
Machine learning › Trustworthy machine learning
model monitoring
0.812024
Explanatory Model Monitoring to Understand the Effects of Feature Shifts on Performance · KDD 2024
Natural language and speech › Language models and text generation › trustworthy language model › large language model reliability
faithfulness
0.212024
Provably Better Explanations with Optimized Aggregation of Feature Attributions · ICML 2024
Machine learning › Optimization for machine learning
optimal transport
0.212024
Explanatory Model Monitoring to Understand the Effects of Feature Shifts on Performance · KDD 2024

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

von neumann entropy · 1.0spectral methods · 1.0semantic similarity · 1.0shapley value · 0.8optimal transport · 0.8feature attribution methods · 0.8convex combination · 0.8
YearPublicationVenuePosition
2026 Fine-grained Uncertainty Decomposition in Large Language Models: A Spectral Approach
abstract
As Large Language Models (LLMs) are increasingly integrated in diverse applications, obtaining reliable measures of their predictive uncertainty has become critically important. A precise distinction between aleatoric uncertainty, arising from inherent ambiguities within input data, and epistemic uncertainty, originating exclusively from model limitations, is essential to effectively address each uncertainty source. In this paper, we introduce Spectral Uncertainty, a novel approach to quantifying and decomposing uncertainties in LLMs. Leveraging the Von Neumann entropy from quantum information theory, Spectral Uncertainty provides a rigorous theoretical foundation for separating total uncertainty into distinct aleatoric and epistemic components. Unlike existing baseline methods, our approach incorporates a fine-grained representation of semantic similarity, enabling nuanced differentiation among various semantic interpretations in model responses. Empirical evaluations demonstrate that Spectral Uncertainty outperforms state-of-the-art methods in estimating both aleatoric and total uncertainty across diverse models and benchmark datasets.
Nassim Walha, Sebastian Gruber 0001, Thomas Decker 0004, Yinchong Yang, Alireza Javanmardi, Eyke Hüllermeier, Florian Buettner 0001
AAAI3
2025 Incremental Uncertainty-aware Performance Monitoring with Active Labeling Intervention
abstract
We study the problem of monitoring machine learning models under gradual distribution shifts, where circumstances change slowly over time, often leading to unnoticed yet significant declines in accuracy. To address this, we propose Incremental Uncertainty-aware Performance Monitoring (IUPM), a novel label-free method that estimates performance changes by modeling gradual shifts using optimal transport. In addition, IUPM quantifies the uncertainty in the performance prediction and introduces an active labeling procedure to restore a reliable estimate under a limited labeling budget. Our experiments show that IUPM outperforms existing performance estimation baselines in various gradual shift scenarios and that its uncertainty awareness guides label acquisition more effectively compared to other strategies.
Alexander Koebler, Thomas Decker 0004, Ingo Thon, Volker Tresp, Florian Buettner 0001
AISTATS2
2025 Improving Perturbation-based Explanations by Understanding the Role of Uncertainty Calibration
abstract
Perturbation-based explanations are widely utilized to enhance the transparency of machine-learning models in practice. However, their reliability is often compromised by the unknown model behavior under the specific perturbations used. This paper investigates the relationship between uncertainty calibration - the alignment of model confidence with actual accuracy - and perturbation-based explanations. We show that models systematically produce unreliable probability estimates when subjected to explainability-specific perturbations and theoretically prove that this directly undermines global and local explanation quality. To address this, we introduce ReCalX, a novel approach to recalibrate models for improved explanations while preserving their original predictions. Empirical evaluations across diverse models and datasets demonstrate that ReCalX consistently reduces perturbation-specific miscalibration most effectively while enhancing explanation robustness and the identification of globally important input features.
Thomas Decker 0004, Volker Tresp, Florian Buettner 0001
NeurIPS1
2024 Provably Better Explanations with Optimized Aggregation of Feature Attributions
abstract
Using feature attributions for post-hoc explanations is a common practice to understand and verify the predictions of opaque machine learning models. Despite the numerous techniques available, individual methods often produce inconsistent and unstable results, putting their overall reliability into question. In this work, we aim to systematically improve the quality of feature attributions by combining multiple explanations across distinct methods or their variations. For this purpose, we propose a novel approach to derive optimal convex combinations of feature attributions that yield provable improvements of desired quality criteria such as robustness or faithfulness to the model behavior. Through extensive experiments involving various model architectures and popular feature attribution techniques, we demonstrate that our combination strategy consistently outperforms individual methods and existing baselines.
Thomas Decker 0004, Ananta R. Bhattarai, Jindong Gu, Volker Tresp, Florian Buettner 0001
ICML1
2024 Explanatory Model Monitoring to Understand the Effects of Feature Shifts on Performance
abstract
Monitoring and maintaining machine learning models are among the most critical challenges in translating recent advances in the field into real-world applications. However, current monitoring methods lack the capability of provide actionable insights answering the question of why the performance of a particular model really degraded. In this work, we propose a novel approach to explain the behavior of a black-box model under feature shifts by attributing an estimated performance change to interpretable input characteristics. We refer to our method that combines concepts from Optimal Transport and Shapley Values as Explanatory Performance Estimation (XPE). We analyze the underlying assumptions and demonstrate the superiority of our approach over several baselines on different data sets across various data modalities such as images, audio, and tabular data. We also indicate how the generated results can lead to valuable insights, enabling explanatory model monitoring by revealing potential root causes for model deterioration and guiding toward actionable countermeasures.
Thomas Decker 0004, Alexander Koebler, Michael Lebacher, Ingo Thon, Volker Tresp, Florian Buettner 0001
KDD1
2023 Does Your Model Think Like an Engineer? Explainable AI for Bearing Fault Detection with Deep Learning
abstract
Deep Learning has already been successfully applied to analyze industrial sensor data in a variety of relevant use cases. However, the opaque nature of many well-performing methods poses a major obstacle for real-world deployment. Explainable AI (XAI) and especially feature attribution techniques promise to enable insights about how such models form their decision. But the plain application of such methods often fails to provide truly informative and problem-specific insights to domain experts. In this work, we focus on the specific task of detecting faults in rolling element bearings from vibration signals. We propose a novel and domain-specific feature attribution framework that allows us to evaluate how well the underlying logic of a model corresponds with expert reasoning. Utilizing the framework we are able to validate the trustworthiness and to successfully anticipate the generalization ability of different wellperforming deep learning models. Our methodology demonstrates how signal processing tools can effectively be used to enhance Explainable AI techniques and acts as a template for similar problems.
Thomas Decker 0004, Michael Lebacher, Volker Tresp
ICASSP1
2023 Explaining Deep Neural Networks for Bearing Fault Detection with Vibration Concepts
abstract
Concept-based explanation methods, such as Concept Activation Vectors, are potent means to quantify how abstract or high-level characteristics of input data influence the predictions of complex deep neural networks. However, applying them to industrial prediction problems is challenging as it is not immediately clear how to define and access appropriate concepts for individual use cases and specific data types. In this work, we investigate how to leverage established concept-based explanation techniques in the context of bearing fault detection with deep neural networks trained on vibration signals. Since bearings are prevalent in almost every rotating equipment, ensuring the reliability of intransparent fault detection models is crucial to prevent costly repairs and downtimes of industrial machinery. Our evaluations demonstrate that explaining opaque models in terms of vibration concepts enables human-comprehensible and intuitive insights about their inner workings, but the underlying assumptions need to be carefully validated first.
Thomas Decker 0004, Michael Lebacher, Volker Tresp
INDIN1
2023 Towards Scenario-Based Safety Validation for Autonomous Trains with Deep Generative Models
Thomas Decker 0004, Ananta R. Bhattarai, Michael Lebacher
SAFECOMP1