新的CloseSort算法可高效聚合循环秩二偏好

作者 PulseAugur 编辑部 · [1 个来源] · 2026-11-07 07:11

研究人员开发了一种名为CloseSort的新算法，用于高效地聚合循环秩二偏好。该方法解决了将成对概率转换为最大似然列表的NP-hard问题，特别适用于秩二锦标赛。CloseSort利用基于边向量和多边形面积的几何方法，以O(n log n)的时间复杂度找到最优顺序，其性能显著优于现有方法。 AI

影响该算法通过提供一种更快的偏好聚合方法，有可能提高LLM评估和推荐系统的效率。

排序理由该条目是一篇研究论文，详细介绍了一种新的秩聚合算法。[lever_c_demoted from research: ic=1 ai=1.0]

AI 生成摘要 · Google Gemini · 来自 1 个来源。我们如何撰写摘要 →

本文如何被排名

Signal score: 0 / 100; Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket: Tool; 该条目是一篇研究论文，详细介绍了一种新的秩聚合算法。[lever_c_demoted from research: ic=1 ai=1.0]
Source corroboration: Single-source cluster; Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
Topics: paper, other; Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance: High; Clearly on-topic for AI-industry coverage.
Story freshness: 3 days old; Aged out of breaking-news scoring windows; ranking reflects the durable signal from the full source set.

完整方法见我们的编辑标准。

arXiv cs.IR (Information Retrieval) TIER_1 English(EN) · Xianquan Yan · 2026-11-07 07:11

精确最大似然聚合循环秩二偏好：闭合与排序

Pairwise probabilities arise in rank aggregation, recommendation, and human or LLM evaluation, yet converting them into a maximum-likelihood list is a weighted Kemeny problem and is NP-hard in general. Known exact algorithms for rank-two tournaments use only comparison signs and …