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

Thea Brüsch

dblp:348/6810 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 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 · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
interpretability
0.912025
REPEAT: Improving Uncertainty Estimation in Representation Learning Explainability · AAAI 2025
Machine learning › Trustworthy machine learning › interpretability
interpretable representation learning
0.912025
REPEAT: Improving Uncertainty Estimation in Representation Learning Explainability · AAAI 2025
Machine learning › Trustworthy machine learning
uncertainty estimation
0.912025
REPEAT: Improving Uncertainty Estimation in Representation Learning Explainability · AAAI 2025

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

stochastic importance estimation · 0.9bernoulli random variable modeling · 0.9
YearPublicationVenuePosition
2025 REPEAT: Improving Uncertainty Estimation in Representation Learning Explainability
abstract
Incorporating uncertainty is crucial to provide trustworthy explanations of deep learning models. Recent works have demonstrated how uncertainty modeling can be particularly important in the unsupervised field of representation learning explainable artificial intelligence (R-XAI). Current R-XAI methods provide uncertainty by measuring variability in the importance score. However, they fail to provide meaningful estimates of whether a pixel is certainly important or not. In this work, we propose a new R-XAI method called REPEAT that addresses the key question of whether or not a pixel is certainly important. REPEAT leverages the stochasticity of current R-XAI methods to produce multiple estimates of importance, thus considering each pixel in an image as a Bernoulli random variable that is either important or unimportant. From these Bernoulli random variables we can directly estimate the importance of a pixel and its associated certainty, thus enabling users to determine certainty in pixel importance. Our extensive evaluation shows that REPEAT gives certainty estimates that are more intuitive, better at detecting out-of-distribution data, and more concise.
Kristoffer Wickstrøm, Thea Brüsch, Michael Kampffmeyer, Robert Jenssen
AAAI2