Papers by Siyuan Xu
Taming LLMs with Gradient Grouping (2025.acl-long)
Copied to clipboard
| Challenge: | a new study presents scaling with gradient grouping (SGG) the adaptive learning rate scaling approach is based on per-parameter statistics, which incurs memory overhead. |
| Approach: | They propose an optimizer wrapper that improves adaptive learning rate estimation by dynamic grouping and group-specific scaling. |
| Outcome: | The proposed algorithm improves learning rate estimation on diverse models with different model sizes and batch sizes. |
SOLAR: Serendipity Optimized Language Model Aligned for Recommendation (2025.findings-emnlp)
Copied to clipboard
Zichen Yuan, Lifan Sun, Yucen Zhuang, Yue Wang, Xinyuan Song, Tianqi Xu, Siyuan Li, Junchen Fu, Youhua Li, Sirui Hong, Jiaqi Chen, Joemon M. Jose, Yongxin Ni
| Challenge: | Large Language Models have shown strong potential in recommendation tasks . however, their application to serendipity-oriented recommendations remains challenging . |
| Approach: | They propose a domain-adaptive instruction tuning method that aligns Large Language Models with recommendation tasks. |
| Outcome: | The proposed framework bridges the domain gap between LLMs and recommendation tasks. |
Data Augmentation for Multiclass Utterance Classification – A Systematic Study (2020.coling-main)
Copied to clipboard
| Challenge: | a lack of sufficient training data for some categories can cause imbalanced data distributions . a weak classifier may miscategorize a request, resulting in customer dissatisfaction . |
| Approach: | They propose to use random resampling, word-level transformations and neural text generation to augment existing data to cope with imbalanced data. |
| Outcome: | The proposed methods improve utterance classification results by drawing on utterant variation. |
A Systematic Assessment of Language Models with Linguistic Minimal Pairs in Chinese (2026.tacl-1)
Copied to clipboard
Yikang Liu, Yeting Shen, Hongao Zhu, Lilong Xu, Zhiheng Qian, Siyuan Song, Kejia Zhang, Jialong Tang, Pei Zhang, Baosong Yang, Rui Wang, Hai Hu
| Challenge: | Using sub-linear length normalized log-probabilities (SLLN-LP), we find unequal lengths of sentences in minimal pairs difficult for LMs even up to 32B parameters. |
| Approach: | They propose to use ZhoBLiMP as a linguistic minimal pair benchmark for Chinese language models to mitigate biases. |
| Outcome: | The proposed metric mitigates biases in Chinese language models with over 100 paradigms . Anaphor, Quantifiers, and Ellipsis are difficult for LMs even up to 32B parameters . |
Not All Experts are Equal: Efficient Expert Pruning and Skipping for Mixture-of-Experts Large Language Models (2024.acl-long)
Copied to clipboard
| Challenge: | Mixture-of-Experts (MoE) LLMs achieve higher performance with fewer active parameters, but are still difficult to deploy due to their immense parameter sizes. |
| Approach: | They propose expert-level sparsification techniques to enhance the deployment efficiency of large language models by introducing plug-and-play expert pruning and skipping techniques. |
| Outcome: | The proposed methods reduce model sizes and increase inference speed while maintaining satisfactory performance across a wide range of tasks. |
PreAct: Prediction Enhances Agent’s Planning Ability (2025.coling-main)
Copied to clipboard
| Challenge: | Existing methods to analyze Markov decision processes (MDPs) are based on chain-of-thought (COT) and historical thought, action, and observation. |
| Approach: | They propose a model that integrates prediction, reasoning, and action with other models to provide a wider range of reasoning and more efficient actions. |
| Outcome: | The proposed model outperforms the ReAct method in completing complex tasks and is more efficient when paired with other memory or selection strategy techniques. |
Reinforcement Learning for Large Language Models via Group Preference Reward Shaping (2025.emnlp-main)
Copied to clipboard
Huaisheng Zhu, Siyuan Xu, Hangfan Zhang, Teng Xiao, Zhimeng Guo, Shijie Zhou, Shuyue Hu, Vasant G. Honavar
| Challenge: | Existing methods for fine-tuning Large Language Models (LLMs) are expensive and sensitive to reward model quality. |
| Approach: | They propose a method that leverages preference-based comparisons rather than precise numerical rewards. |
| Outcome: | Experiments show that GPRS outperforms critic-model-free RL algorithms on RLHF and reasoning tasks. |
EasyEdit: An Easy-to-use Knowledge Editing Framework for Large Language Models (2024.acl-demos)
Copied to clipboard
Peng Wang, Ningyu Zhang, Bozhong Tian, Zekun Xi, Yunzhi Yao, Ziwen Xu, Mengru Wang, Shengyu Mao, Xiaohan Wang, Siyuan Cheng, Kangwei Liu, Yuansheng Ni, Guozhou Zheng, Huajun Chen
| Challenge: | Large Language Models (LLMs) suffer from knowledge cutoff or fallacy issues, which means they are unaware of unseen events or generate text with incorrect facts owing to outdated/noisy data. |
| Approach: | They propose an easy-to-use knowledge editing framework for Large Language Models that allows users to easily edit updated knowledge and adjust undesired behavior while minimizing the impact on unrelated inputs. |
| Outcome: | The proposed framework surpasses traditional fine-tuning in terms of reliability and generalization. |
Analytical Reasoning of Text (2022.findings-naacl)
Copied to clipboard
Wanjun Zhong, Siyuan Wang, Duyu Tang, Zenan Xu, Daya Guo, Yining Chen, Jiahai Wang, Jian Yin, Ming Zhou, Nan Duan
| Challenge: | Existing models with implicit reasoning ability struggle to solve analytical reasoning of text. |
| Approach: | They propose an approach to analyze text and use it to perform reasoning over it. |
| Outcome: | The proposed approach outperforms pre-trained models on an analysis of the Law School Admission Test dataset. |