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 Norrenbrock

dblp:344/0668 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
4since 2021 · last 2025
—ORCID · unresolved

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

Artificial intelligence and machine learning · 4 · 3 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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 · 50% Efficient and distributed learning · 23% Image recognition and object detection · 13%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
interpretability
1.622025
QPM: Discrete Optimization for Globally Interpretable Image Classification · ICLR 2025
Q-SENN: Quantized Self-Explaining Neural Networks · AAAI 2024
Computer vision › Image recognition and object detection
image classification
0.912025
QPM: Discrete Optimization for Globally Interpretable Image Classification · ICLR 2025
Computer vision › Segmentation and scene understanding
semantic segmentation
0.912025
UncertainSAM: Fast and Efficient Uncertainty Quantification of the Segment Anything Model · ICML 2025
Machine learning › Trustworthy machine learning
uncertainty estimation
0.912025
UncertainSAM: Fast and Efficient Uncertainty Quantification of the Segment Anything Model · ICML 2025
Machine learning › Efficient and distributed learning
model compression
0.812024
Q-SENN: Quantized Self-Explaining Neural Networks · AAAI 2024
Machine learning › Efficient and distributed learning › model compression
quantization
0.812024
Q-SENN: Quantized Self-Explaining Neural Networks · AAAI 2024
Machine learning › Trustworthy machine learning › interpretability › explainable AI
self-explaining neural networks
0.812024
Q-SENN: Quantized Self-Explaining Neural Networks · AAAI 2024
Mathematical optimization
discrete optimization
0.312025
QPM: Discrete Optimization for Globally Interpretable Image Classification · ICLR 2025

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

quadratic programming · 1.7discrete optimization · 1.7post-hoc uncertainty quantification · 0.9bayesian entropy formulation · 0.9quantization · 0.8feature alignment · 0.8
YearPublicationVenuePosition
2025 QPM: Discrete Optimization for Globally Interpretable Image Classification
abstract
Understanding the classifications of deep neural networks, e.g. used in safety-critical situations, is becoming increasingly important. While recent models can locally explain a single decision, to provide a faithful global explanation about an accurate model’s general behavior is a more challenging open task. Towards that goal, we introduce the Quadratic Programming Enhanced Model (QPM), which learns globally interpretable class representations. QPM represents every class with a binary assignment of very few, typically 5, features, that are also assigned to other classes, ensuring easily comparable contrastive class representations. This compact binary assignment is found using discrete optimization based on predefined similarity measures and interpretability constraints. The resulting optimal assignment is used to fine-tune the diverse features, so that each of them becomes the shared general concept between the assigned classes. Extensive evaluations show that QPM delivers unprecedented global interpretability across small and large-scale datasets while setting the state of the art for the accuracy of interpretable models.
Thomas Norrenbrock, Timo Kaiser, Sovan Biswas, Ramesh Manuvinakurike, Bodo Rosenhahn
ICLR1
2025 UncertainSAM: Fast and Efficient Uncertainty Quantification of the Segment Anything Model
abstract
The introduction of the Segment Anything Model (SAM) has paved the way for numerous semantic segmentation applications. For several tasks, quantifying the uncertainty of SAM is of particular interest. However, the ambiguous nature of the class-agnostic foundation model SAM challenges current uncertainty quantification (UQ) approaches. This paper presents a theoretically motivated uncertainty quantification model based on a Bayesian entropy formulation jointly respecting aleatoric, epistemic, and the newly introduced task uncertainty. We use this formulation to train USAM, a lightweight post-hoc UQ method. Our model traces the root of uncertainty back to under-parameterised models, insufficient prompts or image ambiguities. Our proposed deterministic USAM demonstrates superior predictive capabilities on the SA-V, MOSE, ADE20k, DAVIS, and COCO datasets, offering a computationally cheap and easy-to-use UQ alternative that can support user-prompting, enhance semi-supervised pipelines, or balance the tradeoff between accuracy and cost efficiency.
Timo Kaiser, Thomas Norrenbrock, Bodo Rosenhahn
ICML2
2025 CHiQPM: Calibrated Hierarchical Interpretable Image Classification
abstract
Globally interpretable models are a promising approach for trustworthy AI in safety-critical domains. Alongside global explanations, detailed local explanations are a crucial complement to effectively support human experts during inference. This work proposes the Calibrated Hierarchical QPM (CHiQPM) which offers uniquely comprehensive global and local interpretability, paving the way for human-AI complementarity. CHiQPM achieves superior global interpretability by contrastively explaining the majority of classes and offers novel hierarchical explanations that are more similar to how humans reason and can be traversed to offer a built-in interpretable Conformal prediction (CP) method. Our comprehensive evaluation shows that CHiQPM achieves state-of-the-art accuracy as a point predictor, maintaining 99% accuracy of non-interpretable models. This demonstrates a substantial improvement, where interpretability is incorporated without sacrificing overall accuracy. Furthermore, its calibrated set prediction is competitively efficient to other CP methods, while providing interpretable predictions of coherent sets along its hierarchical explanation.
Thomas Norrenbrock, Timo Kaiser, Sovan Biswas, Neslihan Kose, Ramesh Manuvinakurike, Bodo Rosenhahn
NeurIPS1
2024 Q-SENN: Quantized Self-Explaining Neural Networks
abstract
Explanations in Computer Vision are often desired, but most Deep Neural Networks can only provide saliency maps with questionable faithfulness. Self-Explaining Neural Networks (SENN) extract interpretable concepts with fidelity, diversity, and grounding to combine them linearly for decision-making. While they can explain what was recognized, initial realizations lack accuracy and general applicability. We propose the Quantized-Self-Explaining Neural Network “Q-SENN”. Q-SENN satisfies or exceeds the desiderata of SENN while being applicable to more complex datasets and maintaining most or all of the accuracy of an uninterpretable baseline model, outperforming previous work in all considered metrics. Q-SENN describes the relationship between every class and feature as either positive, negative or neutral instead of an arbitrary number of possible relations, enforcing more binary human-friendly features. Since every class is assigned just 5 interpretable features on average, Q-SENN shows convincing local and global interpretability. Additionally, we propose a feature alignment method, capable of aligning learned features with human language-based concepts without additional supervision. Thus, what is learned can be more easily verbalized. The code is published: https://github.com/ThomasNorr/Q-SENN
Thomas Norrenbrock, Marco Rudolph, Bodo Rosenhahn
AAAI1