Co-Evolving LLM Evaluators and Policies via DynamicRubric
Score
80提出评估器与策略共同演化的新范式，并理论化相对分数差距的重要性，对现有后训练方法有显著补充。
理论分析、实验设计和工业部署完整，但方法细节在摘要中有限，需阅读全文深入评估。
成果已大规模部署于微信搜索，每天处理数千万请求并提升在线指标，实用价值极高。
论文发布于2026年，方法紧跟LLM后训练研究前沿，但需注意时间标签。
来源为arXiv学术预印本，作者团队背景不详，但实验细节和部署验证增强了可信度。
Base 88.5 × T2 Source weight ×0.9 = 80
Curation line 70Selected
Why selected
Solid theoretical analysis, thorough experimental comparison, and large-scale deployment demonstrate both academic novelty and practical impact.
AI commentary
「This paper deserves attention from anyone working on LLM alignment and post-training. It not only theoretically identifies the root cause of reward model supervision collapse, but also provides a lightweight and deployable solution. The WeChat Search deployment case is especially convincing—a true closure from lab to production. If you're struggling with vanishing reward signals in policy optimization, this method might be the answer you're looking for.」
Quick overview
This paper proposes DynamicRubric, a framework addressing the bottleneck in post-training of LLMs where evaluator feedback gaps collapse as policy improves. A theoretical analysis reveals that relative score gaps are the directional signals for policy updates. DynamicRubric generates weighted binary rubric items per candidate set and aggregates judgments into response-level scores, enabling co-evolution of evaluator and policy. Experiments with 8B backbones surpass a 70B reward model and a 235B static rubric generator. The optimized model is fully deployed in WeChat Search's AI answering scenario, serving tens of millions of requests daily and improving key online metrics.
- Identifies relative score gaps as the core signal for policy optimization, with theoretical proof from a probability allocation perspective.
- Proposes DynamicRubric: dynamically generates weighted binary rubric items per response set, enabling evaluator-policy co-evolution.
- Outperforms a 70B reward model and a 235B static rubric generator on 8B backbone models, with gains on verifiable reasoning and coding tasks.
- Deployed in WeChat Search's AI answering scenario, serving tens of millions of daily requests and improving key online metrics.
Full text
This is an AI-generated Chinese digest; use "View original" for the source text.
Related items
85
FeaturedSetoka: A Benchmark for Hierarchical User Understanding in Personalized Agents over Heterogeneous Data
Setoka：面向异构数据个性化Agent的层级用户理解基准
This paper is well worth attention, especially for researchers and engineers working on personalized agents, dialogue systems, and memory-augmented AI. It not only provides a benchmark but defines levels of user understanding from psychology, revealing systematic failures of current systems at higher levels. If you are designing memory-based agents, this paper reminds you that memory systems need to support cross-temporal, cross-source abstract reasoning, not just retrieval.
85
FeaturedBAND: Bayesian Network Distribution Regression for High-Dimensional Distribution Estimation – Breaking the Curse
BAND：高维分布估计的贝叶斯网络回归方法——打破维度诅咒
This paper is a must-read for anyone working on high-dimensional statistics, probabilistic modeling, and generative AI. It provides a simple yet powerful theoretical answer: sparsity can break the curse of dimensionality, and Bayesian networks offer a natural framework. Compared to black-box methods like VAEs and GANs, BAND is interpretable and provably convergent, especially valuable for industry needs like reliable confidence intervals. If you research time series forecasting or risk management, this paper may change how you approach high-dimensional density estimation.
84
FeaturedCycle-Consistent and Uncertainty-Aware Neural Surrogates for Tokamak Edge Plasmas
循环一致与不确定性感知的托卡马克边缘等离子体神经代理模型
This paper is worth attention because it demonstrates how advanced AI techniques (cycle consistency, uncertainty quantification) directly address a core computational bottleneck in nuclear fusion. For fusion researchers and engineers, it offers a practical tool to speed up simulations by orders of magnitude without sacrificing accuracy; for AI practitioners, it provides an excellent case of self-supervised learning and inverse problem solving in scientific applications.
83
FeaturedEquivariant Learning of a Transferable Three-Dimensional Classical Density Functional
等变学习可迁移的三维经典密度泛函
The most striking aspect of this paper is its direct coupling of machine learning to a core problem in statistical mechanics, using equivariant networks to learn a transferable density functional without any labels. For researchers in liquid physics or soft matter, this could be a new paradigm: do we need to run separate simulations for every new system anymore? For AI researchers, it also shows how to embed physical symmetries and variational principles into models rather than just fitting data. I recommend focusing on the methods, especially how equivariance and variational consistency are implemented—that's the real essence.
83
FeaturedComputational and Statistical Guarantees of the c-Rectified Flow
c-Rectified Flow 的计算与统计保证
This paper moves rectified flow from 'works in practice' to 'theoretically controllable,' which is especially important for those working on the underlying algorithms of generative models. If you are tuning pipelines like FLUX or SD3, understanding that ordinary rectified flow can fail when covariances do not commute may help you avoid hidden training pitfalls.
83
FeaturedLearning Deployable Manipulation Policies from High-Fidelity UMI Data Alone
从高保真UMI数据学习可部署操作策略
The most striking point of this paper is proving that pure robot-free data can match real teleoperation performance, breaking the convention of needing a small real-robot anchor for post-training. For research groups looking to reduce hardware costs and industrial robot application developers, HiFi-UMI's data production system and open-source dataset are directly usable resources. Pay attention to the engineering details of head-mounted SLAM and microsecond synchronization—they are key to achieving the reported accuracy.
83
FeaturedCapital Markets LLM Reliability Score: From Plausible to Bankable
资本市场LLM可靠性评分：从“看似合理”到“可银行化”
This paper is valuable for both finance and AI communities: it provides an actionable, workflow-oriented evaluation framework that's closer to real needs than generic benchmarks. If you're deploying LLMs in fintech or responsible for explainability/auditability, this is a must-read. The finding on decision usefulness is particularly striking—judges agree it's critical, yet models vary the most on it.
83
FeaturedWhere Should Optimizer State Live? Tiered State Allocation for Memory-Efficient Mixture-of-Experts Training
优化器状态应放在哪里？面向内存高效MoE训练的分层状态分配
This paper is highly valuable for teams training MoE models: it demonstrates that with careful optimizer state allocation, one can dramatically reduce memory without sacrificing accuracy—and even improve performance. It is especially relevant for labs or enterprises constrained by 40 GB or 80 GB GPU memory. The tiered strategy and ablation on momentum retention are worth studying for optimizing training frameworks like DeepSpeed or Megatron.