REVIEW 4 cited by
Explaining black box text modules in natural language with language models
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Large language models (LLMs) have demonstrated remarkable prediction performance for a growing array of tasks. However, their rapid proliferation and increasing opaqueness have created a growing need for interpretability. Here, we ask whether we can automatically obtain natural language explanations for black box text modules. A "text module" is any function that maps text to a scalar continuous value, such as a submodule within an LLM or a fitted model of a brain region. "Black box" indicates that we only have access to the module's inputs/outputs. We introduce Summarize and Score (SASC), a method that takes in a text module and returns a natural language explanation of the module's selectivity along with a score for how reliable the explanation is. We study SASC in 3 contexts. First, we evaluate SASC on synthetic modules and find that it often recovers ground truth explanations. Second, we use SASC to explain modules found within a pre-trained BERT model, enabling inspection of the model's internals. Finally, we show that SASC can generate explanations for the response of individual fMRI voxels to language stimuli, with potential applications to fine-grained brain mapping. All code for using SASC and reproducing results is made available on Github.
Forward citations
Cited by 4 Pith papers
-
Ratas framework: A comprehensive genai-based approach to rubric-based marking of real-world textual exams
RATAS decomposes rubrics into simplified rules, scores each rule with GPT-4o, and cascades scores to grade long textual exam answers with reported near-human accuracy.
-
Data-Efficient Adaptation of LLMs via Attention Head Reweighting
Learning a single scalar per attention head lets LLMs adapt to few-shot text classification better than LoRA, with 200–1000x fewer trainable parameters.
-
Adaptive Graph of Thoughts: Test-Time Adaptive Reasoning Unifying Chain, Tree, and Graph Structures
AGoT is a recursive graph-based prompting framework that decomposes LLM queries into nested subgraphs and reports large relative gains on some benchmarks, though headline GPQA gains rely on a shuffled subset.
-
Trustworthy AI in Digital Health: A Comprehensive Review of Robustness and Explainability
A survey of robustness and explainability methods for digital health AI, proposing a taxonomy and illustrating known XAI tools, without new empirical or theoretical results.
Discussion (0). Continue with ORCID to comment.