OrthoRank: Token Selection via Sink Token Orthogonality for Efficient LLM inference
Seungjun Shin, Jaehoon Oh, Dokwan Oh

TL;DR
OrthoRank introduces a novel token selection method for efficient LLM inference by leveraging sink token orthogonality, leading to improved performance and reduced computational cost.
Contribution
This paper proposes a dynamic token importance measure based on sink token orthogonality, enhancing token selection for efficient large language model inference.
Findings
Lower perplexity compared to layer pruning methods.
Higher zero-shot accuracy at the same sparsity ratio.
Superior performance on LongBench.
Abstract
Attention mechanisms are central to the success of large language models (LLMs), enabling them to capture intricate token dependencies and implicitly assign importance to each token. Recent studies have revealed the sink token, which receives disproportionately high attention despite their limited semantic role. In this paper, we first expand the relationship between the sink token and other tokens, moving beyond attention to explore their similarity in hidden states, considering the layer depth. We observe that as the layers get deeper, the cosine similarity between the normalized hidden states of the sink token and those of other tokens increases, and that the normalized hidden states of the sink token exhibit negligible changes. These imply that other tokens consistently are directed toward the sink token throughout the layers. Next, we propose a dynamic token selection method,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsNatural Language Processing Techniques · Speech Recognition and Synthesis · Handwritten Text Recognition Techniques
MethodsPruning · SPEED: Separable Pyramidal Pooling EncodEr-Decoder for Real-Time Monocular Depth Estimation on Low-Resource Settings
