English
Related papers

Related papers: Causal Dimensionality of Transformer Representatio…

200 papers

Sparse autoencoders (SAEs) have been applied to large language models and protein language models, but not systematically to electronic health record (EHR) foundation models. We train TopK SAEs on FlatASCEND, a 14.5-million-parameter…

Machine Learning · Computer Science 2026-05-07 Chris Sainsbury , Feng Dong , Andreas Karwath

Sparse autoencoders (SAEs) operationalise the linear representation hypothesis: they reconstruct model activations as sparse linear combinations of interpretable dictionary atoms, on the implicit assumption that activation space is well…

Machine Learning · Computer Science 2026-05-12 Eslam Zaher , Maciej Trzaskowski , Quan Nguyen , Fred Roosta

Decomposing model activations into interpretable components is a key open problem in mechanistic interpretability. Sparse autoencoders (SAEs) are a popular method for decomposing the internal activations of trained transformers into sparse,…

Machine Learning · Computer Science 2024-06-26 Connor Kissane , Robert Krzyzanowski , Joseph Isaac Bloom , Arthur Conmy , Neel Nanda

Understanding how generative models represent and transform data is a foundational problem in deep learning interpretability. While mechanistic interpretability of discriminative architectures has yielded substantial insights, relatively…

Machine Learning · Computer Science 2026-04-07 Dip Roy , Rajiv Misra , Sanjay Kumar Singh , Anisha Roy

Motivation: Sparse autoencoders (SAEs) decompose foundation model activations into interpretable features, but causal feature-to-feature interactions across network depth remain unknown for biological foundation models. Results: We…

Machine Learning · Computer Science 2026-03-05 Ihor Kendiukhov

Sparse Autoencoders (SAEs) decompose large language model representations into interpretable features, but how these features interact under uncertainty remains poorly understood. We introduce Feature Rivalry -- negatively correlated SAE…

Machine Learning · Computer Science 2026-05-12 Harshavardhan

Traditional transformer-based semantic segmentation relies on quantized embeddings. However, our analysis reveals that autoencoder accuracy on segmentation mask using quantized embeddings (e.g. VQ-VAE) is 8% lower than continuous-valued…

Computer Vision and Pattern Recognition · Computer Science 2025-03-21 Masud Ahmed , Zahid Hasan , Syed Arefinul Haque , Abu Zaher Md Faridee , Sanjay Purushotham , Suya You , Nirmalya Roy

Standard statistical learning theory predicts that Large Language Models (LLMs) should overfit because their parameter counts vastly exceed the number of training tokens. Yet, in practice, they generalize robustly. We propose that the…

Machine Learning · Computer Science 2026-02-13 Dibyanayan Bandyopadhyay , Asif Ekbal

Positional encoding is essential for supplementing transformer with positional information of tokens. Existing positional encoding methods demand predefined token/feature order, rendering them unsuitable for real-world data with…

Machine Learning · Computer Science 2025-09-25 Kaichen Xu , Yihang Du , Mianpeng Liu , Zimu Yu , Xiaobo Sun

The $\alpha$-$\eta$-$\kappa$-$\mu$ is one of the most generalized and flexible channel models having an excellent fit to experimental data from diverse propagation environments. The existing statistical results on the envelope of…

Information Theory · Computer Science 2023-06-13 Pranay Bhardwaj , Eesha Santosh Karnawat , S. M. Zafaruddin

Sparse neural networks are often hypothesized to be more interpretable than dense models, motivated by findings that weight sparsity can produce compact circuits in language models. However, it remains unclear whether structural sparsity…

Computer Vision and Pattern Recognition · Computer Science 2026-03-24 Siyu Zhang

The Schramm-Loewner evolution (SLE_\kappa) is a candidate for the scaling limit of random curves arising in two-dimensional critical phenomena. When \kappa < 8, an instance of SLE_\kappa is a random planar curve with almost sure Hausdorff…

Probability · Mathematics 2009-06-23 Gregory F. Lawler , Scott Sheffield

Sparse autoencoders (SAEs) have emerged as a promising approach in language model interpretability, offering unsupervised extraction of sparse features. For interpretability methods to succeed, they must identify abstract features across…

Machine Learning · Computer Science 2025-09-08 Lovis Heindrich , Philip Torr , Fazl Barez , Veronika Thost

Sparse Autoencoders (SAEs) have emerged as a predominant tool in mechanistic interpretability, aiming to identify interpretable monosemantic features. However, how does sparse encoding organize the representations of activation vector from…

Machine Learning · Computer Science 2025-05-29 Wenjie Sun , Bingzhe Wu , Zhile Yang , Chengke Wu

LLMs increasingly require surgical model editing to enhance domain-specific capabilities without incurring the computational cost or catastrophic forgetting associated with full fine-tuning. Sparse Autoencoders (SAEs) have emerged as a…

Machine Learning · Computer Science 2026-05-28 Li Lei , Madalina Ciobanu , Qingqing Mao , Ritankar Das

We show that if \kappa\ is a weakly compact cardinal then the embeddability relation on (generalized) trees of size \kappa\ is invariantly universal. This means that for every analytic quasi-order R on the generalized Cantor space 2^\kappa\…

Logic · Mathematics 2013-06-28 Luca Motto Ros

Transformers trained in low precision can suffer forward-error amplification. We give a first-order, module-wise theory that predicts when and where errors grow. For self-attention we derive a per-layer bound that factorizes into three…

Machine Learning · Computer Science 2025-10-28 Jinwoo Baek

We test whether the causal inner product of \citet{park2024linear} -- defined by the unembedding covariance $\Sigma$ -- enables cross-lingual concept transport. Across 17 models and 4 language pairs, a matched-spectrum randomization test…

Machine Learning · Computer Science 2026-05-05 Pratyush Acharya , Nuraj Rimal , Habish Dhakal

Analyzing the similarity of internal representations has been an important technique for understanding the behavior of deep neural networks. Most existing methods for analyzing the similarity between representations of high dimensions, such…

Artificial Intelligence · Computer Science 2025-05-26 Jiachen Jiang , Jinxin Zhou , Zhihui Zhu

Appreciation of Stochastic Loewner evolution (SLE$_\kappa$), as a powerful tool to check for conformal invariant properties of geometrical features of critical systems has been rising. In this paper we use this method to check conformal…

Statistical Mechanics · Physics 2012-07-30 A. A. Saberi , S. Moghimi-Araghi , H. Dashti-Naserabadi , S. Rouhani
‹ Prev 1 2 3 10 Next ›