Xinyi Wang
Author directoryOther people with similar names: Xinyi Wang, Xinyi Wang, Xinyi Wang
Unverified author pages with similar names: Xinyi Wang
2026
Learning from Own Solutions: Self-Conditioned Credit Assignment for Reinforcement Learning with Verifiable Rewards
Yingyu Shan | Yuhang Guo | Zihao Cheng | Zeming Liu | Xiangrong Zhu | Xinyi Wang | Jiashu Yao | Wei Lin | Hongru Wang | Heyan Huang
Findings of the Association for Computational Linguistics: EMNLP 2026
Yingyu Shan | Yuhang Guo | Zihao Cheng | Zeming Liu | Xiangrong Zhu | Xinyi Wang | Jiashu Yao | Wei Lin | Hongru Wang | Heyan Huang
Findings of the Association for Computational Linguistics: EMNLP 2026
Reinforcement learning with verifiable rewards (RLVR) has driven substantial progress in training LLMs for reasoning tasks, but representative methods such as GRPO assign uniform credit across all tokens, wasting gradient on routine tokens while under-crediting pivotal reasoning steps. Existing token-level credit assignment methods require resources beyond the model’s own rollouts. GRPO variants rely on process reward models or ground-truth answers. Knowledge distillation assigns credit through per-token divergence but requires external teachers (On-Policy Distillation) or privileged information (On-Policy Self Distillation). However, these dependencies limit applicability in the pure RLVR setting. We observe that conditioning the model on its own verified trajectories induces a measurable per-token KL divergence between the original and conditioned distributions, and prove that distilling from a self-teacher constructed by verified trajectories leads to infeasible weighted-average solutions when multiple verified trajectories exist. We propose SC-GRPO (Self-Conditioned GRPO), which uses KL divergence mentioned before as a multiplicative weight on GRPO gradients. Across five benchmarks spanning math, code, and agentic tasks, SC-GRPO consistently outperforms 8.1% over GRPO and 5.9% over DAPO with stronger OOD performance. Moreover, SC-GRPO achieves higher performance than OPD.
Behavior2Trip: Towards Personalized Travel Planning via User Behavior Trajectory
Zihao Cheng | Yingyu Shan | Hongru Wang | Zeming Liu | Xinyi Wang | Xiangrong Zhu | Yuhang Guo | Wei Lin | Yunhong Wang
Findings of the Association for Computational Linguistics: EMNLP 2026
Zihao Cheng | Yingyu Shan | Hongru Wang | Zeming Liu | Xinyi Wang | Xiangrong Zhu | Yuhang Guo | Wei Lin | Yunhong Wang
Findings of the Association for Computational Linguistics: EMNLP 2026
Travel planning agents assist users in generating personalized travel plans by modeling their individual preferences. Existing agents either rely on explicit user instructions or engage in multi-turn clarification to elicit user preferences. However, both approaches overlook the rich behavioral signals latent in users’ past behaviors, which implicitly encode their preferences. This over-reliance on active user input increases interaction burden and limits plan personalization. To bridge this gap, we introduce a new task, **Behavior-Aware Travel Planning**, which infers user preferences directly from past behaviors and generates personalized travel plans. To facilitate research on this task, we introduce **Behavior2Trip**, a benchmark constructed from one of the largest Chinese online travel platforms, comprising 11,400 instances. Each instance represents an average of 39.8 past user behaviors spanning 14 attributes across 5 preference dimensions. We further propose **B2T-Agent**, a reinforcement learning-based agent that leverages user behavior trajectories, interacts with external tools for preference-aligned retrieval, and maintains an internal memory module. Experiments on Behavior2Trip show that GPT-4.1 achieves a full-constraint pass rate of only 0.5% on the hardest tasks, while B2T-Agent built upon Qwen3-8B outperforms all baselines, highlighting the substantial challenge of this task. Moreover, Qwen3-8B trained with B2T-Agent also outperforms GPT-4.1 on the TravelPlanner benchmark, demonstrating strong generalization.
Mem2Evolve: Towards Self-Evolving Agents via Co-Evolutionary Capability Expansion and Experience Distillation
Zihao Cheng | Zeming Liu | Yingyu Shan | Xinyi Wang | Xiangrong Zhu | Yunpu Ma | Hongru Wang | Yuhang Guo | Wei Lin | Yunhong Wang
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Zihao Cheng | Zeming Liu | Yingyu Shan | Xinyi Wang | Xiangrong Zhu | Yunpu Ma | Hongru Wang | Yuhang Guo | Wei Lin | Yunhong Wang
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
While large language model–powered agents can self-evolve by accumulating experience or by dynamically creating new assets (i.e., tools or expert agents), existing frameworks typically treat these two evolutionary processes in isolation. This separation overlooks their intrinsic interdependence: the former is inherently bounded by a manually predefined static toolset, while the latter generates new assets from scratch without experiential guidance, leading to limited capability growth and unstable evolution. To address this limitation, we introduce a novel paradigm of co-evolutionary Capability Expansion and Experience Distillation. Guided by this paradigm, we propose the Mem2Evolve, which integrates two core components: Experience Memory and Asset Memory. Specifically, Mem2Evolve leverages accumulated experience to guide the dynamic creation of assets, thereby expanding the agent’s capability space while simultaneously acquiring new experience to achieve co-evolution. Extensive experiments across 6 task categories and 8 benchmarks demonstrate that Mem2Evolve achieves improvement of 18.53% over standard LLMs, 11.80% over agents evolving solely through experience, and 6.46% over those evolving solely through asset creation, establishing it as a substantially more effective and stable self-evolving agent framework.