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

Shlomit Gur

dblp:222/7065 · 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 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 › logic-based explanation
abductive explanation
0.912025
Explain Yourself, Briefly! Self-Explaining Neural Networks with Concise Sufficient Reasons · ICLR 2025
Machine learning › Trustworthy machine learning
interpretability
0.912025
Explain Yourself, Briefly! Self-Explaining Neural Networks with Concise Sufficient Reasons · ICLR 2025
Machine learning › Trustworthy machine learning › interpretability › explainable AI
self-explaining neural networks
0.912025
Explain Yourself, Briefly! Self-Explaining Neural Networks with Concise Sufficient Reasons · ICLR 2025

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

self-supervised training · 0.9
YearPublicationVenuePosition
2025 Explain Yourself, Briefly! Self-Explaining Neural Networks with Concise Sufficient Reasons
abstract
*Minimal sufficient reasons* represent a prevalent form of explanation - the smallest subset of input features which, when held constant at their corresponding values, ensure that the prediction remains unchanged. Previous *post-hoc* methods attempt to obtain such explanations but face two main limitations: (1) Obtaining these subsets poses a computational challenge, leading most scalable methods to converge towards suboptimal, less meaningful subsets; (2) These methods heavily rely on sampling out-of-distribution input assignments, potentially resulting in counterintuitive behaviors. To tackle these limitations, we propose in this work a self-supervised training approach, which we term *sufficient subset training* (SST). Using SST, we train models to generate concise sufficient reasons for their predictions as an integral part of their output. Our results indicate that our framework produces succinct and faithful subsets substantially more efficiently than competing post-hoc methods while maintaining comparable predictive performance.
Shahaf Bassan, Ron Eliav, Shlomit Gur
ICLR3