Spectral Attention Steering for Prompt Highlighting
Weixian Waylon Li, Yuchen Niu, Yongxin Yang, Keshuang Li, Tiejun Ma, Shay B. Cohen

TL;DR
This paper introduces Spectral Editing Key Amplification (SEKA), a training-free method for attention steering that enhances model focus on specific tokens without high memory costs, outperforming existing techniques.
Contribution
The paper proposes SEKA and its adaptive variant AdaSEKA, enabling efficient, training-free attention steering compatible with memory-efficient implementations.
Findings
SEKA significantly improves prompt highlighting performance.
Both methods reduce latency and memory overhead.
Methods outperform strong baselines on standard benchmarks.
Abstract
Attention steering is an important technique for controlling model focus, enabling capabilities such as prompt highlighting, where the model prioritises user-specified text. However, existing attention steering methods require explicit storage of the full attention matrix, making them incompatible with memory-efficient implementations like FlashAttention. We introduce Spectral Editing Key Amplification (SEKA), a training-free steering method that tackles this by directly editing key embeddings before attention computation. SEKA uses spectral decomposition to steer key embeddings towards latent directions that amplify attention scores for certain tokens. We extend this to Adaptive SEKA (AdaSEKA), a query-adaptive variant that uses a training-free routing mechanism to dynamically combine multiple expert subspaces based on the prompt's semantic intent. Our experiments show both methods…
Peer Reviews
Decision·ICLR 2026 Poster
- High Originality. Achieves a paradigm breakthrough by shifting from "editing attention output" to "editing attention input." The concept is novel. - Exceptional Efficiency and Compatibility \par Near-zero latency overhead and full compatibility with Flash Attention represent a decisive advantage over methods like PASTA, showing great practical potential. - Comprehensive and Robust Experiments \par Validation across multiple tasks, models, and metrics consistently demonstrates the met
- While the geometric interpretation is intuitive, the paper would be further strengthened by a linguistic or semantic characterization of the learned relevance subspace, for instance, by analyzing the most affected tokens or nearest neighbors in embedding space. Suggestion: Incorporate semantic analysis of the projection directions (e.g., via nearest-neighbor word analysis of projected keys). - The construction of experts in AdaSEKA relies on manual task division. Currently, experts are constru
1. It is a clever integration of attention steering and spectral editing. The implementation of the method is well presented in the paper and is easy to reproduce. 2. The SEKA is compatible with advanced attention implementation that does not compute the full attention matrix. As a result, the method also has lower computation overhead compared to PASTA and SPA that require full attention editing. 3. The adaptive expert projection routing reduce the overhead in fine-tuning steering hyperparamete
1. Generalizability to unseen instructionw? The paper showed their method's generalizability in CounterFact tasks through paraphrase scores that measure performance on human-rewritten versions of the original questions. However, does the projection learned on one task or a collection of tasks generalize to the unseen instruction types. 2. It is unclear what's the relationship between the amount of data used in finding "relevance subspace" for a given instruction and the performance of the SEKA m
1. By editing keys before attention, the approach avoids material incompatibilities with FlashAttention‐style kernels and sidesteps full matrix storage required by prior post-hoc methods. 2. Offline spectral learning over contrastive triplets is training-free at run time and generalizes across model sizes and two model families. 3. Strong empirical results with ablations and overhead accounting.
1. The approach relies on constructing synthetic contrastive triplets and performing SVD computations for each layer and head, as well as for every expert in the AdaSEKA variant. 2. Relevance triplets are synthetically constructed, and the steering effectiveness may hinge on these triplets. 3. The method involves tuning several thresholds and gain parameters for each model and task using dev sets. However, the paper provides limited analysis of parameter sensitivity or stability, and the optimal
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopic Modeling · Multimodal Machine Learning Applications · Personal Information Management and User Behavior
