多标签分类任务中优化复杂度量一直缺乏理论保证，MMO 算法填补了这一空白。做多标签学习、信息检索或推荐系统的研究者可以直接用这套框架提升模型效果，值得深入阅读。
本文提出了一种新的多标签学习算法框架 MMO，用于优化 F-measure、Jaccard 指数等广义度量。作者设计了具有 H-一致性保证的替代损失函数，能在 O(l) 时间内精确分解，无需近似。该算法在 MS-COCO 和 Reuters-21578 等大规模高稀疏数据集上，优于现有连续基线方法。研究为多标签度量优化提供了理论严谨且实践有效的方案。
Principled Algorithms for Optimizing Generalized Metrics in Multi-Label Learning
Many real-world classification tasks require predicting multiple labels per instance, necessitating the optimization of complex evaluation metrics such as the $F$-measure and Jaccard index. While the Empirical Utility Maximization (EUM) framework is natural for these population-level metrics, existing theoretical results are largely limited to asymptotic Bayes-consistency. In this paper, we develop principled learning algorithms for optimizing a broad class of generalized metrics within the EUM framework, grounded in the stronger notion of $H$-consistency. Our key contribution is the design of novel surrogate loss functions for multi-label learning that admit provable $H$-consistency bounds, enabling optimization with non-asymptotic guarantees tailored to the hypothesis class and finite samples. Crucially, we prove these combinatorially formulated surrogates decompose exactly, operating in strictly $O(l)$ time without approximations. Building on this foundation, we introduce MMO (Multi-Label Metric Optimization), a new family of algorithms for optimizing generalized linear-fractional metrics. We validate our approach through extensive experiments, demonstrating robust scalability and superior performance over state-of-the-art continuous baselines on large-scale datasets (MS-COCO, Reuters-21578) in high-sparsity, deep learning regimes. Our results offer both theoretical rigor and practical effectiveness for general multi-label metric optimization.