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

Shaoshen Chen

dblp:361/2488 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
5since 2021 · last 2025
0009-0004-5836-981XORCID · corroborated

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

Artificial intelligence and machine learning · 4 · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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
3 papers
Language models and text generation · 36% Speech recognition and synthesis · 23% Efficient and distributed learning · 17%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › inference efficiency
context compression
0.912025
AdmTree: Compressing Lengthy Context with Adaptive Semantic Trees · NeurIPS 2025
Natural language and speech › Language models and text generation › language modeling › long-context language modeling › context utilization
long-context modeling
0.912025
AdmTree: Compressing Lengthy Context with Adaptive Semantic Trees · NeurIPS 2025
Knowledge, reasoning and agents › Knowledge representation and reasoning
semantic representation
0.912025
AdmTree: Compressing Lengthy Context with Adaptive Semantic Trees · NeurIPS 2025
Natural language and speech › Speech recognition and synthesis › spoken language understanding
multi-intent detection
0.812024
ELSF: Entity-Level Slot Filling Framework for Joint Multiple Intent Detection and Slot Filling · IEEE ACM Trans. Audio Speech Lang. Process. 2024
Natural language and speech › Information extraction and text analysis
slot filling
0.812024
ELSF: Entity-Level Slot Filling Framework for Joint Multiple Intent Detection and Slot Filling · IEEE ACM Trans. Audio Speech Lang. Process. 2024
Natural language and speech › Speech recognition and synthesis
spoken language understanding
0.812024
ELSF: Entity-Level Slot Filling Framework for Joint Multiple Intent Detection and Slot Filling · IEEE ACM Trans. Audio Speech Lang. Process. 2024
Natural language and speech › Language models and text generation
text correction
0.812024
Towards Real-World Writing Assistance: A Chinese Character Checking Benchmark with Faked and Misspelled Characters · ACL (1) 2024
Machine learning › Efficient and distributed learning
token reduction
0.312025
AdmTree: Compressing Lengthy Context with Adaptive Semantic Trees · NeurIPS 2025

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

semantic binary tree · 0.9hierarchical aggregation · 0.9gist token · 0.9multi-task learning · 0.8human annotation · 0.8entity type assignment · 0.8entity boundary detection · 0.8benchmark construction · 0.8
YearPublicationVenuePosition
2025 AdmTree: Compressing Lengthy Context with Adaptive Semantic Trees
abstract
The quadratic complexity of self-attention limits Large Language Models (LLMs) in processing long contexts, a capability vital for many advanced applications. Context compression aims to mitigate this computational barrier while preserving essential semantic information. However, existing methods often falter: explicit methods can sacrifice local detail, while implicit ones may exhibit positional biases, struggle with information degradation, or fail to capture long-range semantic dependencies. We introduce AdmTree, a novel framework for adaptive, hierarchical context compression designed with a core focus on maintaining high semantic fidelity while keep efficiency. AdmTree dynamically segments input based on information density, employing gist tokens to summarize variable-length segments as leaves in a semantic binary tree. This structure, combined with a lightweight aggregation mechanism and a frozen backbone LLM (minimizing new trainable parameters), enables efficient hierarchical abstraction of the context. By effectively preserving fine-grained details alongside global semantic coherence, mitigating position bias, and adapting dynamically to content, AdmTree comprehensively preserves the semantic information of lengthy context.
Yangning Li, Shaoshen Chen, Yankai Chen 0001, Hai-Tao Zheng 0002, Hui Wang 0030, Philip S. Yu
NeurIPS2
2025 Correct like humans: Progressive learning framework for Chinese text error correction
Shirong Ma, Shaoshen Chen, Haojing Huang 0001, Shulin Huang, Yangning Li, Hai-Tao Zheng 0002, Ying Shen 0001
Expert Syst. Appl.3
2024 Towards Real-World Writing Assistance: A Chinese Character Checking Benchmark with Faked and Misspelled Characters
abstract
Yinghui Li, Zishan Xu, Shaoshen Chen, Haojing Huang, Yangning Li, Shirong Ma, Yong Jiang, Zhongli Li, Qingyu Zhou, Hai-Tao Zheng, Ying Shen. Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2024.
Zishan Xu, Shaoshen Chen, Haojing Huang 0001, Yangning Li, Shirong Ma, Yong Jiang 0001, Zhongli Li, Qingyu Zhou, Hai-Tao Zheng 0002, Ying Shen 0001
ACL (1)3
2024 Robust Multi-Prototypes Aware Integration for Zero-Shot Cross-Domain Slot Filling
abstract
Cross-domain slot filling is a widely explored problem in spoken language understanding (SLU), which requires the model to transfer between different domains under data sparsity conditions. Dominant two-step hierarchical models first extract slot entities and then calculate the similarity score between slot description-based prototypes and the last hidden layer of the slot entity, selecting the closest prototype as the predicted slot type. However, these models only use slot descriptions as prototypes, which lacks robustness. Moreover, these approaches have less regard for the inherent knowledge in the slot entity embedding to suffer from the issue of overfitting. In this letter, we propose a Robust Multi-prototypes Aware Integration (RMAI) method for zero-shot cross-domain slot filling. In RMAI, more robust slot entity-based prototypes and inherent knowledge in the slot entity embedding are utilized to improve the classification performance and alleviate the risk of overfitting. Furthermore, a multi-prototypes aware integration approach is proposed to effectively integrate both our proposed slot entity-based prototypes and the slot description-based prototypes. Experimental results on the SNIPS dataset demonstrate the well performance of RMAI.
Shaoshen Chen, Peijie Huang, Zhanbiao Zhu, Yexing Zhang, Yuhong Xu
IEEE Signal Process. Lett.1
2024 ELSF: Entity-Level Slot Filling Framework for Joint Multiple Intent Detection and Slot Filling
abstract
Multi-intent spoken language understanding (SLU) that can handle multiple intents in an utterance has attracted increasing attention. Previous studies treat the slot filling task as a token-level sequence labeling task, which results in a lack of entity-related information. In our paper, we propose anEntity-LevelSlotFilling (ELSF) framework for joint multiple intent detection and slot filling. In our framework, two entity-oriented auxiliary tasks, entity boundary detection and entity type assignment, are introduced as the regularization to capture the entity boundary and the context of type, respectively. Besides, to better utilize the entity interaction, we design an effective entity-level coordination mechanism for modeling the interaction in both entity-entity and intent-entity relationships. Experiments on five datasets demonstrate the effectiveness and generalizability of our ELSF.
Zhanbiao Zhu, Peijie Huang, Haojing Huang 0001, Yuhong Xu, Piyuan Lin, Leyi Lao, Shaoshen Chen, Haojie Xie, Shangjian Yin
IEEE ACM Trans. Audio Speech Lang. Process.7