English
Related papers

Related papers: Self-Ablating Transformers: More Interpretability,…

200 papers

Entailment has been recognized as an important metric for evaluating natural language understanding (NLU) models, and recent studies have found that entailment pretraining benefits weakly supervised fine-tuning. In this work, we design a…

Computation and Language · Computer Science 2023-05-30 Jiaxin Ge , Hongyin Luo , Yoon Kim , James Glass

Mechanistic interpretability aims to understand how neural networks generalize beyond their training data by reverse-engineering their internal structures. We introduce patterning as the dual problem: given a desired form of generalization,…

Machine Learning · Computer Science 2026-01-21 George Wang , Daniel Murfet

Recovering meaningful concepts from language model activations is a central aim of interpretability. While existing feature extraction methods aim to identify concepts that are independent directions, it is unclear if this assumption can…

In this work, we investigate how Large Language Models (LLMs) adapt their internal representations when encountering inputs of increasing difficulty, quantified as the degree of out-of-distribution (OOD) shift. We reveal a consistent and…

Computation and Language · Computer Science 2026-03-20 Mingyu Jin , Yutong Yin , Jingcheng Niu , Qingcheng Zeng , Wujiang Xu , Mengnan Du , Wei Cheng , Zhaoran Wang , Tianlong Chen , Dimitris N. Metaxas

Large Language Models (LLMs) have achieved unprecedented breakthroughs in various natural language processing domains. However, the enigmatic ``black-box'' nature of LLMs remains a significant challenge for interpretability, hampering…

Computation and Language · Computer Science 2023-12-27 Zhen Tan , Tianlong Chen , Zhenyu Zhang , Huan Liu

In this paper, a sparsity-aware adaptive algorithm for distributed learning in diffusion networks is developed. The algorithm follows the set-theoretic estimation rationale. At each time instance and at each node of the network, a closed…

Information Theory · Computer Science 2015-06-03 Symeon Chouvardas , Konstantinos Slavakis , Yannis Kopsinis , Sergios Theodoridis

Self-attention serves as the core foundation of large-scale transformer pretraining, but its quadratic token interaction cost makes inference expensive. Replacing attention with simpler sequential modules is appealing, yet naive…

Machine Learning · Computer Science 2026-05-20 Yuxin Ren , Maxwell D Collins , Miao Hu , Huanrui Yang

Large language models often fail on tasks they seem to already understand. In our experiments, this appears to be less about missing knowledge and more about certain internal circuits not being strongly activated during inference. We…

Machine Learning · Computer Science 2026-05-12 Ryyan Akhtar , Payal Pahwa , Monika Arora

Sparse activation, which selectively activates only an input-dependent set of neurons in inference, is a useful technique to reduce the computing cost of Large Language Models (LLMs) without retraining or adaptation efforts. However,…

Computation and Language · Computer Science 2024-06-12 Jifeng Song , Kai Huang , Xiangyu Yin , Boyuan Yang , Wei Gao

Transformer models gain popularity because of their superior inference accuracy and inference throughput. However, the transformer is computation-intensive, causing a long inference time. The existing works on transformer inference…

Performance · Computer Science 2023-04-19 Yuan Feng , Hyeran Jeon , Filip Blagojevic , Cyril Guyot , Qing Li , Dong Li

Modern large-scale Pre-trained Language Models (PLMs) have achieved tremendous success on a wide range of downstream tasks. However, most of the LM pre-training objectives only focus on text reconstruction, but have not sought to learn…

Computation and Language · Computer Science 2022-10-28 Liliang Ren , Zixuan Zhang , Han Wang , Clare R. Voss , Chengxiang Zhai , Heng Ji

Transformers resist surgical control. Ablating an attention head identified as critical for capitalization produces minimal behavioral change because distributed redundancy compensates for damage. This Hydra effect renders interpretability…

Machine Learning · Computer Science 2026-03-20 J. Clayton Kerce

Self-attention in transformer models is an incremental associative memory that maps key vectors to value vectors. One way to speed up self-attention is to employ GPU-compatible vector search algorithms based on standard partitioning methods…

Computation and Language · Computer Science 2025-06-04 Pierre-Emmanuel Mazaré , Gergely Szilvasy , Maria Lomeli , Francisco Massa , Naila Murray , Hervé Jégou , Matthijs Douze

Transformers have achieved state-of-the-art results across multiple NLP tasks. However, the self-attention mechanism complexity scales quadratically with the sequence length, creating an obstacle for tasks involving long sequences, like in…

Computation and Language · Computer Science 2022-04-20 Belen Alastruey , Javier Ferrando , Gerard I. Gállego , Marta R. Costa-jussà

Attention mechanisms have improved the performance of NLP tasks while allowing models to remain explainable. Self-attention is currently widely used, however interpretability is difficult due to the numerous attention distributions. Recent…

Computation and Language · Computer Science 2020-10-30 Khalil Mrini , Franck Dernoncourt , Quan Tran , Trung Bui , Walter Chang , Ndapa Nakashole

Complex feature extractors are widely employed for text representation building. However, these complex feature extractors make the NLP systems prone to overfitting especially when the downstream training datasets are relatively small,…

Computation and Language · Computer Science 2023-09-11 Ming Li , Ruihong Huang

Transfer learning has fundamentally changed the landscape of natural language processing (NLP) research. Many existing state-of-the-art models are first pre-trained on a large text corpus and then fine-tuned on downstream tasks. However,…

Computation and Language · Computer Science 2021-09-10 Haoming Jiang , Pengcheng He , Weizhu Chen , Xiaodong Liu , Jianfeng Gao , Tuo Zhao

Sparse representation models a signal as a linear combination of a small number of dictionary atoms. As a generative model, it requires the dictionary to be highly redundant in order to ensure both a stable high sparsity level and a low…

Computer Vision and Pattern Recognition · Computer Science 2015-06-23 Xiaoxia Sun , Nasser M. Nasrabadi , Trac D. Tran

The high-level concepts that a neural network uses to perform computation need not be aligned to individual neurons (Smolensky, 1986). Language model interpretability research has thus turned to techniques such as \textit{sparse…

Computation and Language · Computer Science 2026-02-02 Aryaman Arora , Zhengxuan Wu , Jacob Steinhardt , Sarah Schwettmann

Transformer models have achieved state-of-the-art results in a wide range of NLP tasks including summarization. Training and inference using large transformer models can be computationally expensive. Previous work has focused on one…

Computation and Language · Computer Science 2021-09-10 Potsawee Manakul , Mark J. F. Gales