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

Mateusz Pach

dblp:362/0917 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 first-author · 2 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
2 papers
Trustworthy machine learning · 71% Vision and language · 14% Language models and text generation · 14%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
interpretability
1.722025
Sparse Autoencoders Learn Monosemantic Features in Vision-Language Models · NeurIPS 2025
LucidPPN: Unambiguous Prototypical Parts Network for User-centric Interpretable Computer Vision · ICLR 2025
Machine learning › Trustworthy machine learning › interpretability › mechanistic interpretability
monosemanticity
0.912025
Sparse Autoencoders Learn Monosemantic Features in Vision-Language Models · NeurIPS 2025
Machine learning › Trustworthy machine learning › interpretability › example-based explanation › prototype-based explanation
prototypical part network
0.912025
LucidPPN: Unambiguous Prototypical Parts Network for User-centric Interpretable Computer Vision · ICLR 2025
Natural language and speech › Language models and text generation › model steering
representation steering
0.912025
Sparse Autoencoders Learn Monosemantic Features in Vision-Language Models · NeurIPS 2025
Machine learning › Trustworthy machine learning › interpretability › mechanistic interpretability
sparse autoencoder
0.912025
Sparse Autoencoders Learn Monosemantic Features in Vision-Language Models · NeurIPS 2025
Computer vision › Vision and language
vision-language model
0.912025
Sparse Autoencoders Learn Monosemantic Features in Vision-Language Models · NeurIPS 2025

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

sparse autoencoder · 0.9prototypical parts · 0.9case-based reasoning · 0.9
YearPublicationVenuePosition
2025 LucidPPN: Unambiguous Prototypical Parts Network for User-centric Interpretable Computer Vision
abstract
Prototypical parts networks combine the power of deep learning with the explainability of case-based reasoning to make accurate, interpretable decisions. They follow the this looks like that reasoning, representing each prototypical part with patches from training images. However, a single image patch comprises multiple visual features, such as color, shape, and texture, making it difficult for users to identify which feature is important to the model. To reduce this ambiguity, we introduce the Lucid Prototypical Parts Network (LucidPPN), a novel prototypical parts network that separates color prototypes from other visual features. Our method employs two reasoning branches: one for non-color visual features, processing grayscale images, and another focusing solely on color information. This separation allows us to clarify whether the model's decisions are based on color, shape, or texture. Additionally, LucidPPN identifies prototypical parts corresponding to semantic parts of classified objects, making comparisons between data classes more intuitive, e.g., when two bird species might differ primarily in belly color. Our experiments demonstrate that the two branches are complementary and together achieve results comparable to baseline methods. More importantly, LucidPPN generates less ambiguous prototypical parts, enhancing user understanding.
Mateusz Pach, Koryna Lewandowska, Jacek Tabor, Bartosz Zielinski 0001, Dawid Rymarczyk
ICLR1
2025 Sparse Autoencoders Learn Monosemantic Features in Vision-Language Models
abstract
Sparse Autoencoders (SAEs) have recently gained attention as a means to improve the interpretability and steerability of Large Language Models (LLMs), both of which are essential for AI safety. In this work, we extend the application of SAEs to Vision-Language Models (VLMs), such as CLIP, and introduce a comprehensive framework for evaluating monosemanticity at the neuron-level in visual representations. To ensure that our evaluation aligns with human perception, we propose a benchmark derived from a large-scale user study. Our experimental results reveal that SAEs trained on VLMs significantly enhance the monosemanticity of individual neurons, with sparsity and wide latents being the most influential factors. Further, we demonstrate that applying SAE interventions on CLIP's vision encoder directly steers multimodal LLM outputs (e.g., LLaVA), without any modifications to the underlying language model. These findings emphasize the practicality and efficacy of SAEs as an unsupervised tool for enhancing both interpretability and control of VLMs. Code and benchmark data are available at https://github.com/ExplainableML/sae-for-vlm.
Mateusz Pach, Shyamgopal Karthik, Quentin Bouniot, Serge J. Belongie, Zeynep Akata
NeurIPS1
2025 TORE: Token Recycling in Vision Transformers for Efficient Active Visual Exploration
abstract
Active Visual Exploration (AVE) optimizes the utilization of robotic resources in real-world scenarios by sequentially selecting the most informative observations. However, modern methods require a high computational budget due to processing the same observations multiple times through the autoencoder transformers. As a remedy, we introduce a novel approach to AVE called TOken REcycling (TORE). It divides the encoder into extractor and aggregator components. The extractor processes each observation sepa-rately, enabling the reuse of tokens passed to the aggrega-tor. Moreover, to further reduce the computations, we de-crease the decoder to only one block. Through extensive experiments, we demonstrate that TORE outperforms state-of-the-art methods while reducing computational overhead by up to 90%.
Jan Olszewski, Dawid Rymarczyk, Piotr Wójcik, Mateusz Pach, Bartosz Zielinski 0001
WACV4