paper.dinq.meAI 与前沿科学顶会 · 学术新星雷达
登录 DINQ
返回新星榜
SW

Shangshang Wang

COLM 2026×2ICLR 2026推理强化学习与后训练评测与基准可解释性效率与系统
新星分新星
83
一作贡献70
核心/参与5
方向广度13
合作网络9
2 一作 · 3 篇 · COLM 2026 / ICLR 2026

获取完整研究档案

首次获取该候选人的完整档案及 StartLux 评估共 20 积分;每位用户单独解锁,之后查看免费。主动刷新 20 积分。

联系方式

实时查找电子邮箱,费用不超过20积分;未找到邮箱不扣费。

2026 顶会论文

3
作者位次 #6/10COLM 2026Poster· Poster Session 2· Franciscan C· #100

FIPO: Eliciting Deep Reasoning with Future-KL Influenced Policy Optimization

Chiyu Ma · Shuo Yang · Kexin Huang · Jinda Lu · Haoming Meng · Shangshang Wang · Bolin Ding · Soroush Vosoughi · Guoyin Wang · Jingren Zhou

This paper proposes that FutureKL Influenced Optimization that sucessfully break the performance ceiling observed from GRPO based training recipe by providing dense advantage signal.

摘要

We present Future-KL Influenced Policy Optimization (FIPO), a reinforcement learning algorithm designed to overcome reasoning bottlenecks in large language models. While GRPO style training scales effectively, it typically relies on outcome-based rewards (ORM) that distribute a global advantage uniformly across every token in a trajectory. We argue that this coarse-grained credit assignment imposes a performance ceiling by failing to distinguish critical logical pivots from trivial tokens. FIPO addresses this by incorporating discounted future-KL divergence into the policy update, creating a dense advantage formulation that re-weights tokens based on their influence on subsequent trajectory behavior. Empirically, FIPO enables models to break through the length stagnation seen in standard baselines. Evaluated on Qwen2.5-32B, FIPO extends the average chain-of-thought length from roughly 4,000 to over 10,000 tokens and increases AIME 2024 Pass@1 accuracy from 50.0% to a peak of 58.0% (converging at approximately 56.0%). This outperforms both DeepSeekR1-Zero-Math-32B (∼ 47.0%) and o1-mini (∼ 56.0%). Our results suggest that establishing dense advantage formulations is a vital path for evolving ORMbased algorithms to unlock the full reasoning potential of base models. We open-source our training system, built on the verl framework.

推理强化学习与后训练评测与基准RLVRLLM ReasoningOpenReview
一作COLM 2026Poster· Poster Session 1· Grand Ballroom· #133

Resa: Efficient Reasoning Models via SAEs

Shangshang Wang · Julian Asilis · Ömer Faruk Akgül · Enes Burak Bilgin · Ollie Liu · Deqing Fu · Willie Neiswanger

We present Resa, a family of reasoning models trained via an efficient sparse autoencoder tuning (SAE‑Tuning) procedure.

摘要

How cost-effectively can we elicit strong reasoning abilities in language models by leveraging their underlying representations? We present Resa, a family of reasoning models trained via an efficient sparse autoencoder tuning (SAE‑Tuning) procedure. This method first trains an SAE to capture reasoning abilities from a source model, and then uses the trained SAE to guide a standard supervised fine-tuning process to elicit such abilities in a target model, all using verified question-answer data without any reasoning traces. When applied to certain Qwen-style models before further RL training, SAE‑Tuning retains 97% of its RL‑trained counterpart’s performance while reducing training costs by 2000x to roughly $1 and training time by 450x to around 20 minutes. Furthermore, even at the 1.5B model size, SAE-Tuning on lightly RL-trained models delivers strong reasoning results, reaching 43.33% Pass@1 on AIME24 and 90% Pass@1 on AMC23. We also show that SAE-Tuning works for Llama-style models, boosting their scores by over 10% on tasks like AMC23 and MATH500. Surprisingly, the reasoning abilities extracted via SAEs are potentially both generalizable and modular. Generality means abilities extracted from one dataset still elevate performance on a larger and overlapping corpus. Modularity means abilities extracted from models like Qwen or Qwen‑Math can be attached to the R1‑Distilled Qwen model at test time, without any retraining, and yield comparable gains. Extensive ablations validate these findings and all artifacts are fully open-sourced.

可解释性强化学习与后训练推理Reasoning modelssparse autoencodersOpenReview

常见合作者