Papers by Runxin Xu
Probing Structured Pruning on Multilingual Pre-trained Models: Settings, Algorithms, and Efficiency (2022.acl-long)
Copied to clipboard
| Challenge: | Structured pruning has been extensively studied on monolingual pre-trained models . but little attention has been paid to evaluating the effectiveness of structured pruning on multilingual models. |
| Approach: | They investigate settings, algorithms, and efficiency of structured pruning on multilingual models . authors propose a simple approach that allows training the model once and adapting to different model sizes at inference . |
| Outcome: | The proposed approach allows training the model once and adapting to different model sizes at inference. |
Bi-Drop: Enhancing Fine-tuning Generalization via Synchronous sub-net Estimation and Optimization (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Pretrained language models can be fine-tuned on limited training data, which can overfit and thus diminish performance. |
| Approach: | They propose a fine-tuning strategy that selectively updates model parameters using gradients from various sub-nets dynamically generated by dropout. |
| Outcome: | The proposed method outperforms existing methods on the GLUE benchmark and exhibits excellent generalization ability and robustness for domain transfer, data imbalance, and low-resource scenarios. |
Double Graph Based Reasoning for Document-level Relation Extraction (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for document-level relation extraction fail to recognize relations between entities across sentences. |
| Approach: | They propose a method to recognize relations for long paragraphs by a Graph Aggregation-and-Inference Network (GAIN) they propose to use a heterogeneous mention-level graph and an entity-level EG graph to analyze the relationships. |
| Outcome: | The proposed method achieves a significant performance improvement (2.85 on F1) over the previous state-of-the-art. |
Raise a Child in Large Language Model: Towards Effective and Generalizable Fine-tuning (2021.emnlp-main)
Copied to clipboard
| Challenge: | Recent pretrained language models extend from millions to billions of parameters. |
| Approach: | They propose a technique which forwards on a whole network while backwarding on resetting the gradients of the non-child network during the backward process. |
| Outcome: | The proposed technique outperforms the vanilla fine-tuning technique on various downstream tasks and can achieve better generalization performance by large margins. |
An Iteratively Parallel Generation Method with the Pre-Filling Strategy for Document-level Event Extraction (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods to generate event roles require a given generation order . parallel methods suffer from inadequate training and manifest zero accuracies on some event roles. |
| Approach: | They propose an iteratively parallel generation method with the Pre-Filling strategy to generate event roles in parallel to avoid order selection. |
| Outcome: | The proposed method outperforms other entity-enhanced models and achieves state-of-the-art performance on two public datasets. |
Xiaomingbot: A Multilingual Robot News Reporter (2020.acl-demos)
Copied to clipboard
Runxin Xu, Jun Cao, Mingxuan Wang, Jiaze Chen, Hao Zhou, Ying Zeng, Yuping Wang, Li Chen, Xiang Yin, Xijin Zhang, Songcheng Jiang, Yuxuan Wang, Lei Li
| Challenge: | Xiaomingbot is a multilingual and multimodal software robot with four capabilities: news generation, news translation, news reading and avatar animation. |
| Approach: | They propose to build a multilingual and multimodal software robot with four inte- gal capabilities: news generation, news translation, news reading and avatar animation. |
| Outcome: | The proposed system generates Chinese news, then reads it in multiple languages and generates an animated avatar reading it. |
LLM Critics Help Catch Bugs in Mathematics: Towards a Better Mathematical Verifier with Natural Language Feedback (2025.findings-acl)
Copied to clipboard
Bofei Gao, Zefan Cai, Runxin Xu, Peiyi Wang, Ce Zheng, Runji Lin, Keming Lu, Dayiheng Liu, Chang Zhou, Wen Xiao, Tianyu Liu, Baobao Chang
| Challenge: | Existing mathematical verifiers are trained with binary classification labels, which are not informative enough for the model to accurately assess the solutions. |
| Approach: | They propose a natural language feedback-enhanced verifier that can validate the correctness of response generated by policy models by constructing automatically generated training data and a two-stage training paradigm. |
| Outcome: | The proposed verifier significantly improves in verification and reinforcement learning and alleviates data-demanding problems of the reward model. |
S4-Tuning: A Simple Cross-lingual Sub-network Tuning Method (2022.acl-short)
Copied to clipboard
| Challenge: | Existing multilingual pre-trained language models allow to adapt to target languages with only few labeled examples. |
| Approach: | They propose a simple cross-lingual sub-network tuning method that detects the most essential sub-netzwork for each target language and updates it during fine-tuning. |
| Outcome: | The proposed method improves on three multi-lingual tasks involving 37 different languages. |
Document-level Event Extraction via Heterogeneous Graph-based Interaction Model with a Tracker (2021.acl-long)
Copied to clipboard
| Challenge: | Existing methods for document-level event extraction are not effective due to two challenges . existing methods fail to extract events whose arguments spread in multiple sentences . |
| Approach: | They propose a document-level event extraction model with a tracker to capture interdependency among the extracted events. |
| Outcome: | The proposed model outperforms existing models on a large-scale dataset by 2.8 F1 . it extracts multiple correlated events and event arguments that scatter across the document . |
A Two-Stream AMR-enhanced Model for Document-level Event Argument Extraction (2022.naacl-main)
Copied to clipboard
| Challenge: | Existing studies aim at extracting event arguments from a single sentence . document-level event extraction still remains under-explored . |
| Approach: | They propose a two-stream abstract meaning representation enhanced extraction model to extract event arguments from an entire document. |
| Outcome: | The proposed model outperforms state-of-the-art in extracting event arguments from documents by 2.54 F1 and 5.13 F1 on public RAMS and WikiEvents datasets. |
Focus on the Target’s Vocabulary: Masked Label Smoothing for Machine Translation (2022.acl-short)
Copied to clipboard
| Challenge: | Label smoothing and vocabulary sharing are widely used in neural machine translation models, but they can be conflicting and lead to suboptimal performance. |
| Approach: | They propose a mechanism that masks the soft label probability of source-side words to zero and integrates label smoothing with vocabulary sharing to improve translation quality. |
| Outcome: | The proposed mechanism improves translation quality and model calibration on bilingual and multilingual datasets, while retaining the original smoothing method. |
ATP: AMRize Then Parse! Enhancing AMR Parsing with PseudoAMRs (2022.findings-naacl)
Copied to clipboard
| Challenge: | Abstract Meaning Representation (AMR) implicitly involves compound semantic annotations. |
| Approach: | They propose to use auxiliary tasks which are semantically or formally related to enhance AMR parsing. |
| Outcome: | The proposed method achieves state-of-the-art performance on benchmarks especially in topology-related scores. |
An Enhanced Span-based Decomposition Method for Few-Shot Sequence Labeling (2022.naacl-main)
Copied to clipboard
| Challenge: | Existing approaches to tagging tasks are limited to predefined classes and require large-scale annotated data. |
| Approach: | They propose an Enhanced Span-based Decomposition method for Few-Shot Sequence Labeling to generalize on emerging, resource-scare domains. |
| Outcome: | The proposed method achieves state-of-the-art results on two popular FSSL benchmarks, FewNERD and SNIPS, and is more robust in noisy and nested tagging scenarios. |
Math-Shepherd: Verify and Reinforce LLMs Step-by-step without Human Annotations (2024.acl-long)
Copied to clipboard
| Challenge: | Existing methods for process-oriented math reward models rely on manual annotation. |
| Approach: | They propose a process-oriented math process reward model called Math-shepherd which assigns a reward score to each step of math problem solutions. |
| Outcome: | The proposed model breaks the bottleneck of manual supervision in two scenarios. |
Let the Expert Stick to His Last: Expert-Specialized Fine-Tuning for Sparse Architectural Large Language Models (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing studies on parameter-efficient fine-tuning (PEFT) for dense-architecture LLMs are lacking. |
| Approach: | They propose an expert-specialized fine-tuning method that tunes the experts most relevant to downstream tasks while freezing the other experts. |
| Outcome: | The proposed method matches or surpasses full-parameter fine-tuning. |
A Double-Graph Based Framework for Frame Semantic Parsing (2022.naacl-main)
Copied to clipboard
| Challenge: | Frame semantic parsing is a fundamental NLP task, which consists of three subtasks: frame identification, argument identification and role classification. |
| Approach: | They propose a frame semantic parser with a double-graph to derive knowledge-enhanced representations for frames and FEs. |
| Outcome: | The proposed method outperforms the state-of-the-art method by up to 1.7 F1-score on two FrameNet datasets. |