Perplexity最新研究表明,搜索质量主要源于后训练,而非单纯选择更强基础模型。通过对同一开源Qwen模型进行两步调优可显著提升其搜索能力:第一步训练模型遵循指令并保持谨慎,第二步则提升搜索准确性并减少网络查询次数。该方法通过门控奖励机制,仅在答案正确时评估风格奖励,从而同步提升准确性与效率。研究利用可验证的多跳搜索问题训练事实检索能力,并借助基于规则的对话任务保持模型在复杂场景下的指令遵循能力。经后训练的Qwen模型在部分事实性测试中表现匹配或超越GPT-4,且成本更低。
Perplexity's just published a solid new research.
Claims that search quality comes mostly from post-training, not just from choosing a stronger base model.
The same open Qwen model can become much better at search after a special 2-step tune-up, so product quality is not fixed by the raw model alone.
That 2-step tune-up first teaches the model to follow instructions and stay careful, then teaches it to search more accurately and use fewer web lookups.
The key finding is that this recipe improved accuracy and efficiency at the same time, which is hard because search models often get better on 1 goal and worse on another.
The clever move is not just adding more reward terms, but gating them so style only counts when the answer is already correct.
That matters because search models have two expensive habits: they call tools too often, and they turn verbosity into a proxy for effort.
Perplexity tries to fix both with penalties anchored to the best working trajectories in each training group, not with blunt global punishments.
The data strategy follows the same logic.
Verifiable multi-hop search questions teach factual retrieval, while rubric-based chat tasks keep the model from forgetting how to follow instructions in messy real traffic.
The headline benchmark claims are strong, with post-trained Qwen models reportedly matching or beating GPT-5.4 on some factual tests at lower cost.
We've published new research on how we post-train models for accurate search-augmented answers. Our SFT + RL pipeline improves search, citation quality, instruction following, and efficiency. With Qwen models, we match or beat GPT models on factuality at a lower cost.在 X 查看被引用的帖子
来源:Rohan Paul · x.com