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

Xinkai Zou

COLM 2026×2可解释性效率与系统推理检索与知识评测与基准
新星分新星
60
一作贡献30
核心/参与5
方向广度10
合作网络6
1 一作 · 2 篇 · COLM 2026

获取完整研究档案

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

联系方式

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

2026 顶会论文

2
作者位次 #4/8COLM 2026Poster· Poster Session 5· Imperial Ballroom· #66

Preserving Long-Tailed Expert Information in Mixture-of-Experts Tuning

Haoze He · Xingyuan Ding · Xuan Jiang · Xinkai Zou · Alex Cheng · Yibo Zhao · Juncheng B Li · Heather Miller

We identify lrarely activated experts encode non-trivial knowledge useful for downstream tasks and propose a simple mechanism to preserve and consolidate their information via persistent gated routing.

摘要

Despite MoE models leading many benchmarks, supervised fine-tuning (SFT) for the MoE architectures remains difficult because its router layers are fragile. Methods such as DenseMixer and ESFT mitigate router collapse with dense mixing or auxiliary load-balancing losses, but these introduce noisy gradients that often degrade performance. In preliminary experiments, we systematically pruned experts and observed that while certain “super experts” are activated far more frequently, discarding less used experts still leads to notable performance degradation. This suggests that even rarely activated experts encode non-trivial knowledge useful for downstream tasks. Motivated by this, we propose an auxiliary-loss-free MoE SFT framework that combines bias-driven sparsification with always-active gated condenser experts. Rather than enforcing balanced activation across all experts, our method encourages task-relevant experts to remain active while pushing long-tailed experts toward inactivity. The condenser experts provide a persistent, learnable pathway that alleviates gradient starvation and facilitates consolidation of information that would otherwise remain fragmented across sparsely activated experts. Analysis further suggest that this design better preserves long-tailed expert information under sparse routing. Experiments on large-scale MoE models demonstrate that our approach outperforms state-of-the-art SFT baselines such as DenseMixer and ESFT, achieving average gain of 2.5\%+ on both mathematical reasoning and commonsenseQA benchmarks.

效率与系统推理可解释性MoE Model ArchitectureLong-tailed ExpertsMixture-of-Expert(MoE)Large Language Model(LLM)OpenReview
一作COLM 2026Poster· Poster Session 2· Imperial Ballroom· #4

Simulating Organized Group Behavior: New Framework, Benchmark, and Analysis

Xinkai Zou · Yiming Huang · Zhuohang Wu · Jian Sha · Nan Huang · Longfei Yun · Jingbo Shang · Letian Peng

we propose the Organized Group Behavior Simulation task, and facilitate with formalzations, benchmarks, frameworks, and implementations.

摘要

Simulating how organized groups (e.g., corporations) make decisions (e.g., responding to a competitor's move) is essential for understanding real-world dynamics and could benefit relevant applications (e.g., market prediction). In this paper, we formalize this problem as a concrete research platform for group behavior understanding, providing: (1) a task formalization with benchmark and evaluation criteria, (2) a structured and adaptive analytical framework, and (3) detailed temporal and cross-group analysis. Specifically, we propose Organized Group Behavior Simulation, a task that models organized groups as collective entities from a practical perspective: given a group facing a particular situation (e.g., AI Boom), predict the decision it would take. To support this task, we present GROVE (GRoup Organizational BehaVior Evaluation), a benchmark covering 44 organized groups with 8,052 real-world context-decision pairs collected from Wikipedia and TechCrunch across 9 domains, with an end-to-end evaluation protocol assessing consistency, initiative, scope, magnitude, and horizon. Beyond straightforward prompting pipelines, we propose a structured analytical framework that converts collective decision-making events into an interpretable, adaptive, and traceable behavioral model, achieving stronger performance than summarization- and retrieval-based baselines. It further introduces an adapter mechanism for time-aware evolution and group-aware transfer, and traceable evidence nodes grounding each decision rule in originating historical events. Our analysis reveals temporal behavioral drift within individual groups, which the time-aware adapter effectively captures for stronger prediction, and structured cross-group similarity that enables knowledge transfer for data-scarce organizations.

检索与知识可解释性评测与基准Social ScienceBehavior SimulationGroup-level Role-playingOpenReview 项目页

常见合作者