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

Xing W

COLM 2026×2ICLR 2026×2ACL 2026对齐与偏好理论与学习动力学检索与知识智能体与工具多模态
新星分贡献者
62
一作贡献0
核心/参与25
方向广度16
合作网络12
0 一作 · 5 篇 · COLM 2026 / ICLR 2026 / ACL 2026

获取完整研究档案

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

联系方式

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

2026 顶会论文

5
作者位次 #3/8COLM 2026Poster· Poster Session 5· Franciscan B· #90

PolicyLong: Towards On-Policy Context Extension

Junlong Jia · Ziyang Chen · Xing W · Chaochen Gao · TingHao YU · feng zhang · Songlin Hu · Binghui Guo

We propose an on-policy long-context data construction framework that iteratively refreshes training data according to the current model’s entropy profile, yielding an implicit self-curriculum over increasingly challenging long-range dependencies.

摘要

Extending LLM context windows is hindered by scarce high-quality long-context data. Recent methods synthesize data with genuine long-range dependencies via information-theoretic verification, selecting contexts that reduce a base model's predictive entropy. However, their single-pass offline construction with a fixed model creates a fundamental \emph{off-policy gap}: the static screening landscape misaligns with the model's evolving capabilities, causing the training distribution to drift. We propose \textbf{PolicyLong}, shifting data construction towards a dynamic on-policy paradigm. By iteratively re-executing data screening (entropy computation, retrieval, and verification) using the \emph{current} model, PolicyLong ensures the training distribution tracks evolving capabilities, yielding an emergent self-curriculum. Crucially, both positive and hard negative contexts derive from the current model's entropy landscape, co-evolving what the model learns to exploit and resist. Experiments on RULER, HELMET, and LongBench-v2 (Qwen2.5-3B) show PolicyLong consistently outperforms EntropyLong and NExtLong, with gains growing at longer contexts (e.g., +2.54 at 128K on RULER). The improvements further hold when scaling up to a 7B model (OLMo3-7B), confirming that the value of on-policy data evolution generalizes across model family and scale.

理论与学习动力学对齐与偏好检索与知识Longcontext data synthsisOpenReview
作者位次 #7/10COLM 2026Poster· Poster Session 6· Grand Ballroom· #133

Toward Scalable Terminal Task Synthesis via Skill Graphs

Zhiyuan Fan · TingHao YU · Yuanjun Cai · Jiangtao Guan · Yun Yang · Dingxin Hu · Xing W · Zhuo Han · feng zhang · Lilin Wang

We present a scalable framework for synthesizing terminal tasks through graph-guided composition over a skill graph.

摘要

Terminal agents have demonstrated strong potential for autonomous command-line execution, yet their training remains constrained by the scarcity of high-quality and diverse execution trajectories. Existing approaches mitigate this bottleneck by synthesizing large- scale terminal task instances for trajectory sampling. However, they primarily focus on scaling the number of tasks while providing limited control over the diversity of execution trajectories that agents actually experience during training. In this paper, we present SkillSynth, an automated framework for terminal task synthesis built on a scenario-mediated skill graph. SkillSynth first constructs a large-scale skill graph, where scenarios serve as intermediate transition nodes that connect diverse command-line skills. It then samples paths from this graph as abstractions of real-world workflows, and uses a multi-agent harness to instantiate them into executable task instances. By grounding task synthesis in graph-sampled workflow paths, SkillSynth explicitly controls the diversity of minimal execution trajectories required to solve the synthesized tasks. Experiments on Terminal-Bench demonstrate the effectiveness of SkillSynth. Moreover, task instances synthesized by SkillSynth have been adopted to train Hy3 Preview, contributing to its enhanced agentic capabilities in terminal-based settings.

智能体与工具terminal task synthesisskill graphsterminal agentsOpenReview
作者位次 #7/14ACL 2026Poster· Natural Language Processing

Too Long, Do Re-weighting for Efficient LLM Reasoning Compression

Zhong-Zhi Li · Xiao Liang · Zihao Tang · Lei Ji · Peijie Wang · Haotian Xu · Xing W · Haizhen Huang · Weiwei Deng · Yeyun Gong · Zhijiang Guo · Xiao Liu · Fei Yin · Cheng-lin Liu

摘要

Large Language Models (LLMs) have recently achieved remarkable progress on complex reasoning tasks by leveraging extended Chain-of-Thought (CoT) techniques. These reasoning processes can be roughly categorized into System-1 (fast and intuitive) and System-2 (slow and deliberate) paradigms. Howeve...

推理效率与系统强化学习与后训练OpenReview 项目页

常见合作者