Papers by Ning Xie
Few-shot Classification with Hypersphere Modeling of Prototypes (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for fewshot learning use embeddings in space, but they lack expressivity and are difficult to perform statistically. |
| Approach: | They propose a method where class information is represented by hyperspheres with dynamic sizes with two sets of learnable parameters: the hypersphere’s center and the radius. |
| Outcome: | The proposed method is much more expressive than embeddings and performs better than statistical modeling. |
Exploring Lottery Prompts for Pre-trained Language Models (2023.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to optimize pre-trained language models are expensive and slow to scale. |
| Approach: | They propose to search for instance-level lottery prompts and generalize them to unseen data . they validate the assumption that for every instance, there is almost always a lottery prompt that induces the correct prediction from the PLM . |
| Outcome: | The proposed method can achieve comparable results with other gradient-free and optimization-free baselines. |
Few-NERD: A Few-shot Named Entity Recognition Dataset (2021.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to few-shot named entity recognition (NER) focus on coarse-grained entities with few examples, while most unseen entities are fine-grounded. |
| Approach: | They present a human-annotated few-shot named entity recognition dataset . they construct benchmark tasks to assess the generalization capability of models . |
| Outcome: | The proposed model is the first few-shot NER dataset and the largest human-crafted NER data set. |
Controllable Preference Optimization: Toward Controllable Multi-Objective Alignment (2024.emnlp-main)
Copied to clipboard
Yiju Guo, Ganqu Cui, Lifan Yuan, Ning Ding, Zexu Sun, Bowen Sun, Huimin Chen, Ruobing Xie, Jie Zhou, Yankai Lin, Zhiyuan Liu, Maosong Sun
| Challenge: | Existing algorithms for achieving optimal alignment are mostly unidirectional . a recent study suggests that large language models can be ground with evident preferences . |
| Approach: | They propose to ground large language models with evident preferences . they propose to use controllable preference optimization to specify different objectives . |
| Outcome: | The proposed models can provide responses that match various preferences among the ”3H” desiderata. |
LongLeader: A Comprehensive Leaderboard for Large Language Models in Long-context Scenarios (2025.naacl-long)
Copied to clipboard
Pei Chen, Hongye Jin, Cheng-Che Lee, Rulin Shao, Jingfeng Yang, Mingyu Zhao, Zhaoyu Zhang, Qin Lu, Kaiwen Men, Ning Xie, Huasheng Li, Bing Yin, Han Li, Lingyun Wang
| Challenge: | LongLeader aims to assess different LLMs' long-context comprehension abilities . long-constext comprehension is a key bottleneck for many use cases . |
| Approach: | They propose a leaderboard to assess different LLMs' long-context comprehension abilities . they offer open-source access to the benchmarks and maintain a dedicated website . |
| Outcome: | The proposed model assesses different LLMs on selected benchmarks and provides open-source access to the benchmarks. |
Fusing Highly Specialized Language Models for Comprehensive Expertise (2025.acl-long)
Copied to clipboard
Ning Ding, Yulin Chen, Ganqu Cui, Xingtai Lv, Weilin Zhao, Kaiyan Zhang, Ruobing Xie, Bowen Zhou, Zhiyuan Liu, Maosong Sun
| Challenge: | Existing models that focus on language, programming code, and mathematical symbols are not able to achieve mastery of all three domains simultaneously. |
| Approach: | They propose to fuse highly-specialized models that are already sufficiently trained on different domains to achieve a highly-specific model. |
| Outcome: | The proposed model could achieve mastery of the three crucial domains simultaneously. |
Beyond Rejection Sampling: Trajectory Fusion for Scaling Mathematical Reasoning (2026.findings-acl)
Copied to clipboard
| Challenge: | Large language models (LLMs) fine-tuned using rejection sampling retain only correct reasoning trajectories . however, this paradigm treats supervision as a binary filter that systematically excludes teacher-generated errors, leaving a gap in how reasoning failures are modeled during training. |
| Approach: | They propose a fine-tuning strategy that reframes rejection sampling as a structured supervision construction process. |
| Outcome: | The proposed approach outperforms RFT on multiple math benchmarks while retaining only correct reasoning trajectories. |
Hierarchy-Aware Global Model for Hierarchical Text Classification (2020.acl-main)
Copied to clipboard
| Challenge: | Existing methods for hierarchical text classification are limited and lack holistic structural information. |
| Approach: | They propose a hierarchy-aware global model with two variants that learn hierarchy-based label embeddings through an encoder and conduct inductive fusion of label-alike text features. |
| Outcome: | The proposed model improves on three benchmark datasets. |
Exploring the Impact of Model Scaling on Parameter-Efficient Tuning (2023.emnlp-main)
Copied to clipboard
Yusheng Su, Chi-Min Chan, Jiali Cheng, Yujia Qin, Yankai Lin, Shengding Hu, Zonghan Yang, Ning Ding, Xingzhi Sun, Guotong Xie, Zhiyuan Liu, Maosong Sun
| Challenge: | Parameter-efficient tuning (PET) methods can drive large pre-trained language models by training only minimal parameters. |
| Approach: | They propose a parameter-efficient tuning method that is compatible with a tunable module and uses a random number generator to optimize fewer table parameters. |
| Outcome: | The proposed method is compatible with a tunable module and tested on 11 NLP tasks. |
STARD: A Chinese Statute Retrieval Dataset Derived from Real-life Queries by Non-professionals (2024.findings-emnlp)
Copied to clipboard
Weihang Su, Yiran Hu, Anzhe Xie, Qingyao Ai, Quezi Bing, Ning Zheng, Yun Liu, Weixing Shen, Yiqun Liu
| Challenge: | Existing statute retrieval benchmarks emphasize formal and professional queries from sources like bar exams and legal case documents . existing retrieval approaches that lack domain-specific knowledge may struggle to capture the meanings of specialized terms accurately. |
| Approach: | They propose a dataset that captures the complexity and diversity of real queries from the general public. |
| Outcome: | The proposed dataset captures the complexity and diversity of real queries from the general public. |
Negating Negatives: Alignment with Human Negative Samples via Distributional Dispreference Optimization (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods to steer LLMs towards human preference suffer from noisy positive-negative training pairs. |
| Approach: | They propose a distributional preference optimization method which maximizes discrepancy between dispreferred responses and generated non-negative ones. |
| Outcome: | The proposed method achieves comparable generation quality and surpasses the latest strong baselines in producing less harmful and more informative responses with better training stability and faster convergence. |
WebCPM: Interactive Web Search for Chinese Long-form Question Answering (2023.acl-long)
Copied to clipboard
Yujia Qin, Zihan Cai, Dian Jin, Lan Yan, Shihao Liang, Kunlun Zhu, Yankai Lin, Xu Han, Ning Ding, Huadong Wang, Ruobing Xie, Fanchao Qi, Zhiyuan Liu, Maosong Sun, Jie Zhou
| Challenge: | Long-form question answering requires two procedures: information retrieval and information synthesis. |
| Approach: | They propose a Chinese long-form question answering dataset called WebCPM . the dataset is based on a web search interface that engages with a search engine in real time . |
| Outcome: | The proposed dataset generates answers that are no worse than human-written ones . the dataset is the first Chinese LFQA dataset . |
Collective Human Opinions in Semantic Textual Similarity (2023.tacl-1)
Copied to clipboard
| Challenge: | Existing benchmarks for semantic textual similarity (STS) use averaged human ratings as gold standard. |
| Approach: | They propose to use a Chinese sentence-to-sentence dataset to study collective human opinions in semantic textual similarity (STS) neither a scalar nor a single Gaussian fits a set of observed judgments adequately, they argue . |
| Outcome: | The proposed dataset does not capture disagreements on individual instances, but rather the confidence over the aggregate dataset. |
AutoFigure-Edit: Generating Editable Scientific Illustrations via Reference-Guided Styling (2026.acl-demo)
Copied to clipboard
Zhen Lin, Qiujie Xie, Minjun Zhu, Shichen Li, QiYao Sun, Enhao Gu, Yiran Ding, Ke Sun, Fang Guo, Panzhong Lu, Zhiyuan Ning, Yixuan Weng, Yue Zhang
| Challenge: | Existing automated systems for scientific illustrations are limited in editability, stylistic controllability, and efficiency. |
| Approach: | They propose an end-to-end system that generates fully editable scientific illustrations from long-form scientific text while enabling flexible style adaptation through user-provided reference images. |
| Outcome: | The proposed system generates fully editable scientific illustrations from long-form scientific texts while enabling flexible style adaptation through user-provided reference images. |
Prompt-learning for Fine-grained Entity Typing (2022.findings-emnlp)
Copied to clipboard
Ning Ding, Yulin Chen, Xu Han, Guangwei Xu, Xiaobin Wang, Pengjun Xie, Haitao Zheng, Zhiyuan Liu, Juanzi Li, Hong-Gee Kim
| Challenge: | Extensive experiments on fine-grained entity typing under fully supervised, few-shot, and zero-shot settings show the effectiveness of prompt-learning. |
| Approach: | They propose a prompt-learning pipeline that stimulates versatile knowledge of pre-trained language models (PLMs) by constructing entity-oriented verbalizers and templates and conducting masked language modeling. |
| Outcome: | The proposed approach can be applied to fine-grained entity typing in fully supervised, few-shot, and zero-shot scenarios. |
Coupling Distant Annotation and Adversarial Training for Cross-Domain Chinese Word Segmentation (2020.acl-main)
Copied to clipboard
| Challenge: | Fully supervised neural approaches have achieved significant progress in the task of Chinese word segmentation (CWS) however, they suffer from the cross-domain issue when they come to processing of out-of-domain data. |
| Approach: | They propose to use Chinese word as a target domain for distant annotation and adversarial training to reduce noise and maximize utilization of the source domain information. |
| Outcome: | The proposed method outperforms existing state-of-the-art methods on real-world datasets and significantly outperformed previous state- of-the art methods. |