Papers by Rongxiang Zhang
Multiscale Collaborative Deep Models for Neural Machine Translation (2020.acl-main)
Copied to clipboard
| Challenge: | Neural machine translation models with deeper neural networks are difficult to train. |
| Approach: | They propose a MultiScale Collaborative framework to boost gradient back-propagation . they let each encoder block learn a fine-grained representation and enhance it . |
| Outcome: | The proposed framework outperforms baseline models on translation tasks with three translation directions and achieves a BLEU score of 30.56 on the English-to-German task. |
ManuSearch: Democratizing Deep Search in Large Language Models with a Transparent and Open Multi-Agent Framework (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing systems with opaque architectures are limiting deep search capabilities for web-augmented large language models. |
| Approach: | They propose a transparent and modular multi-agent framework to democratize deep search for LLMs. |
| Outcome: | The proposed framework outperforms open-source systems in deep reasoning tasks. |
Large-Scale Diverse Synthesis for Mid-Training (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing data synthesis methods generate simplistic and homogeneous QA pairs with limited scale and diversity. |
| Approach: | They propose a framework to synthesize large-scale, diverse, and high-quality QA data for mid-training. |
| Outcome: | The proposed framework improves on 500B-token BoostQA data over pre-training benchmarks. |
Multi-Programming Language Sandbox for LLMs (2025.acl-demo)
Copied to clipboard
Shihan Dou, Jiazheng Zhang, Jianxiang Zang, Yunbo Tao, Weikang Zhou, Haoxiang Jia, Shichun Liu, Yuming Yang, Shenxi Wu, Zhiheng Xi, Muling Wu, Rui Zheng, Changze Lv, Limao Xiong, Shaoqing Zhang, Lin Zhang, Wenyu Zhan, Rongxiang Weng, Jingang Wang, Xunliang Cai, Yueming Wu, Ming Wen, Yixin Cao, Tao Gui, Xipeng Qiu, Qi Zhang, Xuanjing Huang
| Challenge: | MPLSandbox is an out-of-the-box multi-programming language sandbox designed to provide unified and comprehensive feedback from compiler and analysis tools for Large Language Models (LLMs). |
| Approach: | They propose a multi-programming language sandbox that provides unified feedback from compilers and analysis tools for Large Language Models. |
| Outcome: | The proposed multi-language sandbox can provide comprehensive feedback from compilers and analysis tools for large language models (LLMs). |
LinkQA: Synthesizing Diverse QA from Multiple Seeds Strongly Linked by Knowledge Points (2026.acl-long)
Copied to clipboard
| Challenge: | Existing training data is limited in high-quality training data, limiting the ability to produce high-performance LLMs. |
| Approach: | They propose a KP-graph-based synthesis framework that extracts KPs from QA seed data and constructs a graph of KP data from multiple seeds strongly linked by KP. |
| Outcome: | The proposed framework enables flexible control over discipline and difficulty distributions while balancing KP coverage and popularity. |
FRAME: Boosting LLMs with A Four-Quadrant Multi-Stage Pretraining Strategy (2025.findings-acl)
Copied to clipboard
Xuemiao Zhang, Feiyu Duan, Xu Liangyu, Yongwei Zhou, Sirui Wang, Rongxiang Weng, Jingang Wang, Xunliang Cai
| Challenge: | Multi-stage pretraining methods lack quantitative criteria for data partitioning and instead rely on intuitive heuristics. |
| Approach: | They propose a Four-quadRAnt Multi-stage prEtraining strategy that partitions data into four quadrants to achieve significant loss reductions four times. |
| Outcome: | The proposed strategy achieves 16.8% improvement over random across MMLU and CMMLU for the 3B model. |
FIRE: Flexible Integration of Data Quality Ratings for Effective Pretraining (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods to evaluate data quality rely on heuristic techniques or single quality signals. |
| Approach: | They propose a framework for integrating multiple data quality raters that integrates multiple quality signals into a unified space and provides a comprehensive quality signal for each data point. |
| Outcome: | The proposed framework outperforms existing methods and boosts model performance across a wide range of downstream tasks while requiring less than 37.5% tokens to reach the target performance. |
G-Tuning: Improving Generalization of Pre-trained Language Models with Generative Adversarial Network (2023.findings-acl)
Copied to clipboard
| Challenge: | Empirical evaluations on the GLUE benchmark demonstrate that fine-tuning can enhance the generalization performance of pre-trained language models (PLMs) in downstream tasks. |
| Approach: | They propose a fine-tuning framework that transforms the latent representation of pre-trained language models from a universal space to a target space and integrates a generative adversarial network into the fine-untun process. |
| Outcome: | Empirical evaluations on the GLUE benchmark and two additional demanding scenarios show that the proposed framework can improve the generalization performance of pre-trained language models (PLMs) in downstream tasks. |
Preference Curriculum: LLMs Should Always Be Pretrained on Their Preferred Data (2025.findings-acl)
Copied to clipboard
Xuemiao Zhang, Xu Liangyu, Feiyu Duan, Yongwei Zhou, Sirui Wang, Rongxiang Weng, Jingang Wang, Xunliang Cai
| Challenge: | Existing methods of uniformly sampling data throughout the pretraining process are suboptimal because they overlook the model's evolving data preferences. |
| Approach: | They propose a Perplexity Difference (PD) based Preference Curriculum learning framework which perceives and uses the data preferred by LLMs as their capabilities improve . they propose PDPC to complete the arrangement of the dataset offline and ensure continuous training without interruption. |
| Outcome: | The proposed framework surpasses baselines on 1.3B and 3B models and achieves an increased average accuracy of over 8.1% across MMLU and CMMLU. |
Learning Representation Mapping for Relation Detection in Knowledge Base Question Answering (P19-1)
Copied to clipboard
| Challenge: | Existing approaches to detect relation detection only get high accuracy for questions whose relations have been seen in training data. |
| Approach: | They propose a method to learn representation mapping for both seen and unseen relations based on previously learned relation embedding. |
| Outcome: | The proposed method improves the performance of unseen relations while keeping the performance comparable to the state-of-the-art. |