Yao Shu
2026
Self-Reflective Generation at Test Time
Jian Mu | Qixin Zhang | Zhiyong Wang | Menglin Yang | Shuang Qiu | Chengwei Qin | Zhongxiang Dai | Yao Shu
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Jian Mu | Qixin Zhang | Zhiyong Wang | Menglin Yang | Shuang Qiu | Chengwei Qin | Zhongxiang Dai | Yao Shu
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Large language models (LLMs) increasingly solve complex reasoning tasks via long chain-of-thought, but their forward-only autoregressive generation process is fragile; early token errors can cascade, which creates a clear need for self-reflection mechanisms. However, existing self-reflection either performs revisions over full drafts or learns self-correction via expensive training, both fundamentally reactive and inefficient. To address this, we propose Self-Reflective Generation at Test Time (SRGen), a lightweight test-time framework that reflects before generating at uncertain points. During token generation, SRGen utilizes dynamic entropy thresholding to identify high-uncertainty tokens. For each identified token, it trains a specific corrective vector, which fully exploits the already generated context for a self-reflective generation to correct the token probability distribution. By retrospectively analyzing the partial output, this self-reflection enables more trustworthy decisions, thereby significantly reducing the probability of errors at highly uncertain points. Evaluated on challenging mathematical reasoning benchmarks and a diverse set of LLMs, SRGen can significantly strengthen model reasoning. Moreover, our findings position SRGen as a plug-and-play method that integrates reflection into the generation process for reliable LLM reasoning, achieving consistent gains with bounded overhead and can be combined with other training-time (e.g., RLHF) and test-time (e.g., SLOT) techniques.
2025
PAFT: Prompt-Agnostic Fine-Tuning
Chenxing Wei | Mingwen Ou | Ying He | Yao Shu | Fei Yu
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Chenxing Wei | Mingwen Ou | Ying He | Yao Shu | Fei Yu
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Fine-tuning large language models (LLMs) often causes overfitting to specific prompt wording, where minor phrasing variations drastically reduce performance. To address this, we propose Prompt-Agnostic Fine-Tuning (PAFT), a method that enhances robustness through dynamic prompt variation during training. PAFT first generates diverse synthetic prompts, then continuously samples from this set to construct training instances, forcing models to learn fundamental task principles rather than surface-level patterns. Across systematic evaluations using both supervised fine-tuning (SFT) and reinforcement learning fine-tuning (RLFT), PAFT consistently demonstrates improved performance on benchmarks for question answering, mathematical reasoning, and tool use. It achieves 7% higher generalization accuracy on unseen prompts than standard methods with similar training efficiency. Notably, models trained with PAFT attain 3.2× faster inference speeds due to reduced prompt sensitivity. Ablation studies further validate effectiveness of PAFT, while theoretical analysis reveals that PAFT can effectively enhance the cross-domain generalization ability of LLM.
Flexora: Flexible Low-Rank Adaptation for Large Language Models
Chenxing Wei | Yao Shu | Ying Tiffany He | Fei Yu
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Chenxing Wei | Yao Shu | Ying Tiffany He | Fei Yu
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Large language models (LLMs) have revolutionized artificial intelligence, but their performance on specific tasks is often limited by knowledge boundaries. While fine-tuning techniques like low-rank adaptation (LoRA) aim to address this, they can suffer from overfitting. We propose flexible low-rank adaptation (Flexora), a novel method that automatically selects the most critical layers for fine-tuning to optimize performance across diverse downstream tasks. Flexora formulates layer selection as a hyperparameter optimization problem, employs unrolled differentiation for efficient solving, and identifies the most impactful layers based on optimized hyperparameters. Extensive experiments across various pre-trained models and natural language tasks demonstrate that Flexora consistently outperforms existing baselines. We provide theoretical insights and comprehensive ablation studies to elucidate the effectiveness of Flexora. Therefore, Flexora offers a robust solution to enhance LoRA fine-tuning for LLMs, potentially advancing the field of adaptive language model optimization.
2024
Position Paper: Data-Centric AI in the Age of Large Language Models
Xinyi Xu | Zhaoxuan Wu | Rui Qiao | Arun Verma | Yao Shu | Jingtan Wang | Xinyuan Niu | Zhenfeng He | Jiangwei Chen | Zijian Zhou | Gregory Kang Ruey Lau | Hieu Dao | Lucas Agussurja | Rachael Hwee Ling Sim | Xiaoqiang Lin | Wenyang Hu | Zhongxiang Dai | Pang Wei Koh | Bryan Kian Hsiang Low
Findings of the Association for Computational Linguistics: EMNLP 2024
Xinyi Xu | Zhaoxuan Wu | Rui Qiao | Arun Verma | Yao Shu | Jingtan Wang | Xinyuan Niu | Zhenfeng He | Jiangwei Chen | Zijian Zhou | Gregory Kang Ruey Lau | Hieu Dao | Lucas Agussurja | Rachael Hwee Ling Sim | Xiaoqiang Lin | Wenyang Hu | Zhongxiang Dai | Pang Wei Koh | Bryan Kian Hsiang Low
Findings of the Association for Computational Linguistics: EMNLP 2024
This position paper proposes a data-centric viewpoint of AI research, focusing on large language models (LLMs). We start by making a key observation that data is instrumental in the developmental (e.g., pretraining and fine-tuning) and inferential stages (e.g., in-context learning) of LLMs, and advocate that data-centric research should receive more attention from the community. We identify four specific scenarios centered around data, covering data-centric benchmarks and data curation, data attribution, knowledge transfer, and inference contextualization. In each scenario, we underscore the importance of data, highlight promising research directions, and articulate the potential impacts on the research community and, where applicable, the society as a whole. For instance, we advocate for a suite of data-centric benchmarks tailored to the scale and complexity of data for LLMs. These benchmarks can be used to develop new data curation methods and document research efforts and results, which can help promote openness and transparency in AI and LLM research.
Search
Fix author
Co-authors
- Zhongxiang Dai 2
- Chenxing Wei 2
- Fei Yu 2
- Lucas Agussurja 1
- Jiangwei Chen 1
- Hieu Dao 1
- Ying He 1
- Ying Tiffany He 1
- Zhenfeng He 1
- Wenyang Hu 1
- Pang Wei Koh 1
- Gregory Kang Ruey Lau 1
- Xiaoqiang Lin 1
- Bryan Kian Hsiang Low 1
- Jian Mu 1
- Xinyuan Niu 1
- Mingwen Ou 1
- Rui Qiao 1
- Chengwei Qin 1
- Shuang Qiu 1
- Rachael Hwee Ling Sim 1
- Arun Verma 1
- Jingtan Wang 1
- Zhiyong Wang 1
- Zhaoxuan Wu 1
- Xinyi Xu 1
- Menglin Yang 1
- Qixin Zhang 1
- Zijian Zhou 1