Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Qingguo Qi

dblp:439/3995 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Deep learning architectures and training · 60% Language models and text generation · 20% Efficient and distributed learning · 20%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
attention efficiency
1.012026
SCOPE: Boosting LLM Efficiency with Scoped Position Encoding · ACL (1) 2026
Natural language and speech › Language models and text generation › compositional generalization › length generalization
length extrapolation
1.012026
SCOPE: Boosting LLM Efficiency with Scoped Position Encoding · ACL (1) 2026
Machine learning › Deep learning architectures and training
positional encoding
1.012026
SCOPE: Boosting LLM Efficiency with Scoped Position Encoding · ACL (1) 2026
Machine learning › Deep learning architectures and training › attention mechanism
sparse attention
1.012026
SCOPE: Boosting LLM Efficiency with Scoped Position Encoding · ACL (1) 2026
Machine learning › Deep learning architectures and training
transformer
1.012026
SCOPE: Boosting LLM Efficiency with Scoped Position Encoding · ACL (1) 2026
YearPublicationVenuePosition
2026 SCOPE: Boosting LLM Efficiency with Scoped Position Encoding
abstract
Positional encodings are fundamental to Transformers, yet explicit methods like RoPE can degrade under length extrapolation and may incur extra arithmetic and memory-access overhead.In this paper, we propose Scoped Position Encoding (SCOPE), a novel framework that reimagines structured sparsity as an intrinsic position encoding mechanism.Instead of relying on explicit arithmetic signals, SCOPE assigns exponentially scaled look-back scopes to attention heads.We theoretically demonstrate that this simple topological constraint transforms multi-head attention into a hierarchical processor, yielding an order awareness horizon that grows exponentially with depth up to the sequence length.Consequently, SCOPE is parameter-free and avoids relying on fragile positional arithmetic.Empirically, it significantly enhances efficiency by masking the majority of attention computations, offering a theoretical 8× reduction in attention FLOPs at long contexts.Extensive evaluations on LLaMA-3-8B architectures reveal that SCOPE achieves superior native length extrapolation and robust retrieval fidelity compared to RoPE, all while substantially reducing training and inference latency.The code is available at https://github.com/oncemoe/ScoPE.
Qingguo Qi, Hongyang Chen 0001, Zhao Li 0007
ACL (1)1