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

Hexuan Deng

dblp:335/1449 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
5since 2021 · last 2025
0009-0006-5513-928XORCID · verified

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

Artificial intelligence and machine learning · 5 · 3 first-author · 5 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
5 papers
Language models and text generation · 46% Efficient and distributed learning · 22% Trustworthy machine learning · 18%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › robustness
distributionally robust optimization
0.912025
DRPruning: Efficient Large Language Model Pruning through Distributionally Robust Optimization · ACL (1) 2025
Natural language and speech › Language models and text generation › instruction tuning
instruction data generation
0.912025
AQuilt: Weaving Logic and Self-Inspection into Low-Cost, High-Relevance Data Synthesis for Specialist LLMs · EMNLP 2025
Machine learning › Efficient and distributed learning
model compression
0.912025
DRPruning: Efficient Large Language Model Pruning through Distributionally Robust Optimization · ACL (1) 2025
Machine learning › Efficient and distributed learning › model compression › pruning
structured pruning
0.912025
DRPruning: Efficient Large Language Model Pruning through Distributionally Robust Optimization · ACL (1) 2025
Natural language and speech › Language models and text generation › text generation
conditional text generation
0.812024
Curriculum Consistency Learning for Conditional Sentence Generation · EMNLP 2024
Natural language and speech › Language models and text generation
large language model evaluation
0.812024
NewTerm: Benchmarking Real-Time New Terms for Large Language Models with Annual Updates · NeurIPS 2024
Machine learning › Trustworthy machine learning
robustness
0.812024
Curriculum Consistency Learning for Conditional Sentence Generation · EMNLP 2024
Natural language and speech › Machine translation
monolingual data augmentation
0.712023
Improving Simultaneous Machine Translation with Monolingual Data · AAAI 2023
Natural language and speech › Machine translation
simultaneous machine translation
0.712023
Improving Simultaneous Machine Translation with Monolingual Data · AAAI 2023
Natural language and speech › Language models and text generation
multilingual language models
0.312025
DRPruning: Efficient Large Language Model Pruning through Distributionally Robust Optimization · ACL (1) 2025

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

self-inspection · 0.9logic-based reasoning · 0.9distributionally robust optimization · 0.9continued pretraining · 0.9curriculum learning · 0.8consistency learning · 0.8benchmark construction · 0.8adaptive updating · 0.8sequence-level knowledge distillation · 0.7neural machine translation · 0.7
YearPublicationVenuePosition
2025 DRPruning: Efficient Large Language Model Pruning through Distributionally Robust Optimization
abstract
Large language models (LLMs) deliver impressive results but face challenges from increasing model sizes and computational costs.Structured pruning reduces model size and speeds up inference but often causes uneven degradation across domains, leading to biased performance.To address this, we propose DR-Pruning, a method that dynamically adjusts the data distribution during training to restore balanced performance across heterogeneous and multi-tasking data.Experiments in monolingual and multilingual settings show that DR-Pruning surpasses similarly sized models in both pruning and continued pretraining over perplexity, downstream tasks, and instruction tuning.Further analysis demonstrates the robustness of DRPruning towards various domains and distribution shifts.Furthermore, DRPruning can determine optimal reference losses and data ratios automatically, suggesting potential for broader applications.
Hexuan Deng, Wenxiang Jiao, Xuebo Liu 0002, Min Zhang 0005, Zhaopeng Tu
ACL (1)1
2025 AQuilt: Weaving Logic and Self-Inspection into Low-Cost, High-Relevance Data Synthesis for Specialist LLMs
abstract
Despite the impressive performance of large language models (LLMs) in general domains, they often underperform in specialized domains.Existing approaches typically rely on data synthesis methods and yield promising results by using unlabeled data to capture domain-specific features.However, these methods either incur high computational costs or suffer from performance limitations, while also demonstrating insufficient generalization across different tasks.To address these challenges, we propose AQuilt, a framework for constructing instruction-tuning data for any specialized domains from corresponding unlabeled data, including Answer, Question, Unlabeled data, Inspection, Logic, and Task type.By incorporating logic and inspection, we encourage reasoning processes and self-inspection to enhance model performance.Moreover, customizable task instructions enable high-quality data generation for any task.As a result, we construct a dataset of 703k examples to train a powerful data synthesis model.Experiments show that AQuilt is comparable to DeepSeek-V3 while utilizing just 17% of the production cost.Further analysis demonstrates that our generated data exhibits higher relevance to downstream tasks.
Xiaopeng Ke, Hexuan Deng, Xuebo Liu 0002, Jun Rao, Zhenxi Song, Jun Yu 0002, Min Zhang 0005
EMNLP2
2024 Curriculum Consistency Learning for Conditional Sentence Generation
abstract
Consistency learning (CL) has proven to be a valuable technique for improving the robustness of models in conditional sentence generation (CSG) tasks by ensuring stable predictions across various input data forms.However, models augmented with CL often face challenges in optimizing consistency features, which can detract from their efficiency and effectiveness.To address these challenges, we introduce Curriculum Consistency Learning (CCL), a novel strategy that guides models to learn consistency in alignment with their current capacity to differentiate between features.CCL is designed around the inherent aspects of CL-related losses, promoting task independence and simplifying implementation.Implemented across four representative CSG tasks, including instruction tuning (IT) for large language models and machine translation (MT) in three modalities (text, speech, and vision), CCL demonstrates marked improvements.Specifically, it delivers +2.0 average accuracy point improvement compared with vanilla IT and an average increase of +0.7 in COMET scores over traditional CL methods in MT tasks.Our comprehensive analysis further indicates that models utilizing CCL are particularly adept at managing complex instances, showcasing the effectiveness and efficiency of CCL in improving CSG models.Code and scripts are available at https://github.com/xinxinxing/ Curriculum-Consistency-Learning.
Liangxin Liu, Xuebo Liu 0002, Lian Lian, Shengjun Cheng, Jun Rao, Tengfei Yu, Hexuan Deng, Min Zhang 0005
EMNLP7
2024 NewTerm: Benchmarking Real-Time New Terms for Large Language Models with Annual Updates
abstract
Despite their remarkable abilities in various tasks, large language models (LLMs) still struggle with real-time information (e.g., new facts and terms) due to the knowledge cutoff in their development process. However, existing benchmarks focus on outdated content and limited fields, facing difficulties in real-time updating and leaving new terms unexplored. To address this problem, we propose an adaptive benchmark, NewTerm, for real-time evaluation of new terms. We design a highly automated construction method to ensure high-quality benchmark construction with minimal human effort, allowing flexible updates for real-time information. Empirical results on various LLMs demonstrate over 20% performance reduction caused by new terms. Additionally, while updates to the knowledge cutoff of LLMs can cover some of the new terms, they are unable to generalize to more distant new terms. We also analyze which types of terms are more challenging and why LLMs struggle with new terms, paving the way for future research. Finally, we construct NewTerm 2022 and 2023 to evaluate the new terms updated each year and will continue updating annually. The benchmark and codes can be found at https://anonymous.4open.science/r/NewTerms.
Hexuan Deng, Wenxiang Jiao, Xuebo Liu 0002, Min Zhang 0005, Zhaopeng Tu
NeurIPS1
2023 Improving Simultaneous Machine Translation with Monolingual Data
abstract
Simultaneous machine translation (SiMT) is usually done via sequence-level knowledge distillation (Seq-KD) from a full-sentence neural machine translation (NMT) model. However, there is still a significant performance gap between NMT and SiMT. In this work, we propose to leverage monolingual data to improve SiMT, which trains a SiMT student on the combination of bilingual data and external monolingual data distilled by Seq-KD. Preliminary experiments on En-Zh and En-Ja news domain corpora demonstrate that monolingual data can significantly improve translation quality (e.g., +3.15 BLEU on En-Zh). Inspired by the behavior of human simultaneous interpreters, we propose a novel monolingual sampling strategy for SiMT, considering both chunk length and monotonicity. Experimental results show that our sampling strategy consistently outperforms the random sampling strategy (and other conventional typical NMT monolingual sampling strategies) by avoiding the key problem of SiMT -- hallucination, and has better scalability. We achieve +0.72 BLEU improvements on average against random sampling on En-Zh and En-Ja. Data and codes can be found at https://github.com/hexuandeng/Mono4SiMT.
Hexuan Deng, Liang Ding 0006, Xuebo Liu 0002, Meishan Zhang, Dacheng Tao, Min Zhang 0005
AAAI1