Demo Data from EDBT 2026 / reviewers in the wild / expert
Tatsuro Inaba
dblp:348/6541
· DBLP profile ↗
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 · 39% Representation and self-supervised learning · 30% Deep learning architectures and training · 30% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Representation and self-supervised learning › representation learning
feature discovery |
0.9 | 1 | 2025 | Transformer Key-Value Memories Are Nearly as Interpretable as Sparse Autoencoders · NeurIPS 2025 |
Machine learning › Trustworthy machine learning
interpretability |
0.9 | 1 | 2025 | Transformer Key-Value Memories Are Nearly as Interpretable as Sparse Autoencoders · NeurIPS 2025 |
Machine learning › Deep learning architectures and training
transformer |
0.9 | 1 | 2025 | Transformer Key-Value Memories Are Nearly as Interpretable as Sparse Autoencoders · NeurIPS 2025 |
Machine learning › Trustworthy machine learning › interpretability › mechanistic interpretability
sparse autoencoder |
0.3 | 1 | 2025 | Transformer Key-Value Memories Are Nearly as Interpretable as Sparse Autoencoders · NeurIPS 2025 |
Methods — techniques the papers use, named apart from their topics
sparse autoencoder · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Transformer Key-Value Memories Are Nearly as Interpretable as Sparse AutoencodersabstractRecent interpretability work on large language models (LLMs) has been increasingly dominated by a feature-discovery approach with the help of proxy modules. Then, the quality of features learned by, e.g., sparse auto-encoders (SAEs), is evaluated.
This paradigm naturally raises a critical question: do such learned features have better properties than those already represented within the original model parameters, and unfortunately, only a few studies have made such comparisons systematically so far.
In this work, we revisit the interpretability of feature vectors stored in feed-forward (FF) layers, given the perspective of FF as key-value memories, with modern interpretability benchmarks.
Our extensive evaluation revealed that SAE and FFs exhibits a similar range of interpretability, although SAEs displayed an observable but minimal improvement in some aspects.
Furthermore, in certain aspects, surprisingly, even vanilla FFs yielded better interpretability than the SAEs, and features discovered in SAEs and FFs diverged.
These bring questions about the advantage of SAEs from both perspectives of feature quality and faithfulness, compared to directly interpreting FF feature vectors, and FF key-value parameters serve as a strong baseline in modern interpretability research. Mengyu Ye, Jun Suzuki 0001, Tatsuro Inaba, Tatsuki Kuribayashi |
NeurIPS | 3 |