SLASH the Sink: Sharpening Structural Attention Inside LLMs
Not on the map. Why?
Abstract (arXiv)
Large Language Models (LLMs) show remarkable semantic understanding but often struggle with structural understanding when processing graph topologies in a serialized format. Existing solutions rely on training external graph-based adapters or fine-tuning, which incur high costs and lost generalizability. In this work, we investigate the internal mechanisms of LLMs and present a critical finding: LLMs spontaneously reconstruct the graph's topology internally, evidenced by a distinct "sawtooth" pattern in their attention maps that structurally aligns with the "token-level adjacency matrix". However, this intrinsic structural understanding is diluted by the attention sink. We theoretically formalize this dilution as a representation bottleneck, stemming from a fundamental conflict: the model's anisotropic bias, essential for language tasks, suppresses the topology-aware local aggregation required for graph reasoning. To address this, we propose a training-free solution, named StructuraL Attention SHarpening (SLASH), which amplifies this internal structural understanding via a plug-and-play attention redistribution. Experiments on pure graph tasks and molecular prediction validate that SLASH delivers significant and consistent performance gains across diverse LLMs.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 30 of its 36 references that are in the map. First posted on arXiv 11 May 2026.
Builds on
30 of 36 references.
References · 30
- 2017Attention Is All You Needcited by 59,932
- 2024The Llama 3 Herd of Modelscited by 14,192
- 2025Qwen3 Technical Reportcited by 8,195
- 2023Efficient Streaming Language Models with Attention Sinkscited by 2,115
- 2017MoleculeNet: A Benchmark for Molecular Machine Learningcited by 1,037
- 2019What Does BERT Look At? An Analysis of BERT's Attentioncited by 994
- 2019How Contextual are Contextualized Word Representations? Comparing the Geometry of BERT, ELMo, and GPT-2 Embeddingscited by 770
- 2020Explainability in Graph Neural Networks: A Taxonomic Surveycited by 383
- 2025Layer by Layer: Uncovering Hidden Representations in Language Modelscited by 293
- 2025Gated Attention for Large Language Models: Non-linearity, Sparsity, and Attention-Sink-Freecited by 266
- 2023Can Language Models Solve Graph Problems in Natural Language?cited by 249
- 2023One for All: Towards Training One Graph Model for All Classification Taskscited by 239
18 more
- 2023GraphGPT: Graph Instruction Tuning for Large Language Modelscited by 223
- 2024When Attention Sink Emerges in Language Models: An Empirical Viewcited by 200
- 2022Pure Transformers are Powerful Graph Learnerscited by 188
- 2024LLaGA: Large Language and Graph Assistantcited by 177
- 2023Talk like a Graph: Encoding Graphs for Large Language Modelscited by 175
- 2022Learning on Large-scale Text-attributed Graphs via Variational Inferencecited by 153
- 2025Why do LLMs attend to the first token?cited by 122
- 2024Unveiling and Harnessing Hidden Attention Sinks: Enhancing Large Language Models without Training through Attention Calibrationcited by 70
- 2023Augmenting Low-Resource Text Classification with Graph-Grounded Pre-training and Promptingcited by 62
- 2024InstructGraph: Boosting Large Language Models via Graph-centric Instruction Tuning and Preference Alignmentcited by 56
- 2025Do Language Models Use Their Depth Efficiently?cited by 48
- 2025Attention Sinks and Compression Valleys in LLMs are Two Sides of the Same Coincited by 47
- 2024HiGPT: Heterogeneous Graph Language Modelcited by 44
- 2025Towards Mechanistic Interpretability of Graph Transformers via Attention Graphscited by 12
- 2025ZeroTuning: Unlocking the Initial Token's Power to Enhance Large Language Models Without Trainingcited by 11
- 2023Graph Out-of-Distribution Generalization with Controllable Data Augmentationcited by 9
- 2025Graph-KV: Breaking Sequence via Injecting Structural Biases into Large Language Modelscited by 6
- 2026<SOG_k>: One LLM Token for Explicit Graph Structural Understandingcited by 2
Built on by
Not cited yet.