arXiv:2508.09826cs.LG2025-08AAAI被引 2

RankList通过列表级学习提升主观偏好预测的全局一致性。

RankList -- A Listwise Preference Learning Framework for Predicting Subjective Preferences

  • 基于概率框架同时建模局部与全局排序约束
  • 在语音情绪识别数据集上提升肯德尔秩相关系数与排序准确率
  • 支持渐进式复杂结构学习,适用于多模态主观评价任务

偏好学习在语音情感识别(SER)和图像审美评估等涉及主观判断的任务中受到广泛关注。尽管如RankNet的成对框架能有效建模相对偏好,但其仅限于局部比较,难以捕捉全局排序一致性。为此,我们提出RankList,一种新型列表级偏好学习框架,将RankNet推广至结构化列表级监督。该方法在概率框架中显式建模局部与非局部排序约束,并引入对数求和指数近似以提升训练效率。进一步通过跳过式比较机制,实现对复杂列表结构的渐进暴露,增强全局排序保真度。大量实验表明,该方法在多种模态下均优于标准列表级基线。在基准SER数据集(MSP-Podcast、IEMOCAP、BIIC Podcast)上,RankList在肯德尔τ系数和排序准确率上均取得一致提升。同时在艺术图像审美数据集上验证了其广泛适用性。消融与跨域研究显示,RankList不仅提升领域内排序性能,还具备更强泛化能力。本框架为主观学习中的有序偏好建模提供了统一且可扩展的解决方案。

原文摘要 · Abstract (English)

Preference learning has gained significant attention in tasks involving subjective human judgments, such as \emph{speech emotion recognition} (SER) and image aesthetic assessment. While pairwise frameworks such as RankNet offer robust modeling of relative preferences, they are inherently limited to local comparisons and struggle to capture global ranking consistency. To address these limitations, we propose RankList, a novel listwise preference learning framework that generalizes RankNet to structured list-level supervision. Our formulation explicitly models local and non-local ranking constraints within a probabilistic framework. The paper introduces a log-sum-exp approximation to improve training efficiency. We further extend RankList with skip-wise comparisons, enabling progressive exposure to complex list structures and enhancing global ranking fidelity. Extensive experiments demonstrate the superiority of our method across diverse modalities. On benchmark SER datasets (MSP-Podcast, IEMOCAP, BIIC Podcast), RankList achieves consistent improvements in Kendall's Tau and ranking accuracy compared to standard listwise baselines. We also validate our approach on aesthetic image ranking using the Artistic Image Aesthetics dataset, highlighting its broad applicability. Through ablation and cross-domain studies, we show that RankList not only improves in-domain ranking but also generalizes better across datasets. Our framework offers a unified, extensible approach for modeling ordered preferences in subjective learning scenarios.

偏好学习列表级主观评价排序优化

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。