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

Zehuan Li

dblp:325/9593 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
0009-0001-0586-3601ORCID · reported

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

Artificial intelligence and machine learning · 1 · 1 since 2021Security and privacy · 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 · 70% Language models and text generation · 30%

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

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
attention mechanism
1.012026
Every Token Counts: Generalizing 16M Ultra-Long Context in Large Language Models · ACL (1) 2026
Natural language and speech › Language models and text generation › language modeling › long-context language modeling › context utilization
long-context modeling
1.012026
Every Token Counts: Generalizing 16M Ultra-Long Context in Large Language Models · ACL (1) 2026
Machine learning › Deep learning architectures and training › attention mechanism
sparse attention
1.012026
Every Token Counts: Generalizing 16M Ultra-Long Context in Large Language Models · ACL (1) 2026
Machine learning › Deep learning architectures and training
mixture of experts
0.312026
Every Token Counts: Generalizing 16M Ultra-Long Context in Large Language Models · ACL (1) 2026

Methods — techniques the papers use, named apart from their topics

hierarchical sparse attention · 1.0
YearPublicationVenuePosition
2026 Every Token Counts: Generalizing 16M Ultra-Long Context in Large Language Models
abstract
This work explores efficient ultra-long context modeling.We posit that an effective solution requires three fundamental properties: sparsity, random-access flexibility, and length generalization.To achieve this, we leverage Hierarchical Sparse Attention (HSA), a novel attention mechanism that satisfies all three properties.We integrate HSA into the Transformer architecture to develop HSA-UltraLong, an 8B-parameter Mixture-of-Experts (MoE) model trained on over 8 trillion tokens.We rigorously evaluate the model across tasks with both in-domain and out-of-domain context lengths to validate its capabilities.Our model demonstrates comparable performance to full-attention baselines on in-domain sequence lengths.Crucially, it achieves over 90% accuracy on most in-context retrieval tasks with contexts up to 512 times the pre-training context length.This work reports our findings and remaining issues throughout the experiments, offering insights for future research in ultralong context modeling.
Zhanchao Zhou, Ruiqi Liang, Zehuan Li
ACL (1)4
2025 A novel symbolic model for analyzing Internet of Things protocols based on event logic
abstract
The unique characteristics of the Internet of Things (IoT) make IoT protocols more vulnerable to security risks compared to traditional security protocols. Formal methods are widely used to analyze and verify the security properties of IoT protocols, but existing methods often fail to address the special security mechanisms required in the complex IoT network environment. A novel symbolic model based on event logic is proposed to implement the comprehensive analysis of secure IoT protocols. The model enhances the description of message flow and match, while also extending the inference capabilities of equivalence and injectivity. Aiming at the pre-shared key, cookie, raw public key, and certificate authority in the IoT protocols, a proof system of the model is proposed to prove the security properties of these mechanisms. To improve efficiency, the match buffer reduction method is also presented to eliminate the redundant proof steps. Formal analysis and verification of protocols, including DTLS, SRTP, CoAP, and PUF, uncover several attacks that violate security properties. The results reveal that the proposed symbolic model is an effective method for the formal analysis and proof of IoT protocols.
Zehuan Li, Meihua Xiao, Yangping Xu, Fangping Chen, Huaibin Shao, Sufen Yan
Comput. Secur.1