Papers by Xiaoliang Cong
MASPO: Unifying Gradient Utilization, Probability Mass, and Signal Reliability for Robust and Sample-Efficient LLM Reasoning (2026.acl-long)
Copied to clipboard
Xiaoliang Fu, Jiaye Lin, Yangyi Fang, Binbin Zheng, Chaowen Hu, Zekai Shao, Cong Qin, Lu Pan, Ke Zeng, Xunliang Cai
| Challenge: | Existing RLVR algorithms rely on rigid, uniform, and symmetric trust region mechanisms . current algorithms lack robustness, asymmetric signal reliability and inefficient gradient utilization . |
| Approach: | They propose a framework to harmonize three dimensions of RLVR algorithms, a paper argues . a binary cutoff is used to discard valuable reinforcement signals, they argue . |
| Outcome: | The proposed framework outperforms baselines in evaluating a robust RLVR solution. |
From log 𝜋 to 𝜋: Taming Divergence in Soft Clipping via Bilateral Decoupled Decay of Probability Gradient Weight (2026.acl-long)
Copied to clipboard
Xiaoliang Fu, Jiaye Lin, Yangyi Fang, Chaowen Hu, Cong Qin, Zekai Shao, Binbin Zheng, Lu Pan, Ke Zeng
| Challenge: | Standard algorithms for Large Language Models (LLMs) enforce stability via "hard clipping" but relying on log-probability gradient yields divergent weights as probabilities vanish, destabilizing LLM training. |
| Approach: | They propose a decoupled gradient policy optimization that uses a decay mechanism to decouple the probability of a boundary token. |
| Outcome: | The proposed algorithm outperforms baselines on various mathematical benchmarks. |
CodeRise: Bootstrapping LLMs for Ultra Low-Resource Programming Languages via Progressive Self-Refinement Curriculum (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for training data generation for low-resource languages suffer from a cold-start problem and lack diversity. |
| Approach: | They propose a two-stage framework that generates a high-quality, diverse, and progressively complex curriculum for Ultra Low-Resource Programming Languages (ULRPLs) they leverage the full formal syntax of the target language as structural guidance and apply a biased sampling strategy over library modules. |
| Outcome: | The proposed framework outperforms training-free and training-based baselines on two ULRPLs, Tengo and Janet. |
How to Allocate, How to Learn? Dynamic Rollout Allocation and Advantage Modulation for Policy Optimization (2026.findings-acl)
Copied to clipboard
Yangyi Fang, Jiaye Lin, Xiaoliang Fu, Cong Qin, Haolin Shi, Chaowen Hu, Lu Pan, Ke Zeng, Xunliang Cai
| Challenge: | Existing methods for reinforcement learning with verifiable rewards are limited by the complexity of the problem and the complexity. |
| Approach: | They propose a theoretically-grounded dual-pronged optimization framework for reinforcement learning with verifiable rewards that compensates for gradient attenuation of high-confidence correct actions while utilizing entropy changes as computable indicators to stabilize excessive update magnitudes. |
| Outcome: | The proposed framework compensates for gradient attenuation of high-confidence correct actions while utilizing entropy changes as computable indicators to stabilize excessive update magnitudes. |
Proximity-Based Multi-Turn Optimization: Practical Credit Assignment for LLM Agent Training (2026.acl-industry)
Copied to clipboard
| Challenge: | Existing group-based policy optimization methods rely on statistical deviation within discrete batches, misallocating credit when task difficulty fluctuates. |
| Approach: | They propose a framework for multi-turn LLM agents that integrates global context . they propose GRPO, which integrates success-rate-aware modulation and proximity-based soft aggregation . |
| Outcome: | The proposed framework yields performance gains over existing baselines with negligible computational cost. |