arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.02877cs.LG
收藏

组合熵风险最小化的几何感知高效算法

A Geometry-Aware Efficient Algorithm for Compositional Entropic Risk Minimization

Texas A\&M University(德克萨斯A&M大学);University of Texas, Austin(德克萨斯大学奥斯汀分校);National Taiwan University(国立台湾大学);Mohamed bin Zayed University of Artificial Intelligence(穆罕默德·本·扎耶德人工智能大学)

Xiyuan Wei, Linli Zhou, Bokun Wang, Chih-Jen Lin, Tianbao Yang

AI总结:

针对组合熵风险最小化问题,提出几何感知随机算法SCENT,利用负指数函数诱导的Bregman散度进行随机近端镜像下降,实现凸问题O(1/√T)收敛率,并在极端分类、部分AUC最大化等任务中优于基线。

摘要:

本文研究一类称为组合熵风险最小化问题的优化,其中每个数据的损失被公式化为对数-期望-指数(Log-E-Exp)函数。当对数内部的显式求和涉及大量项且因此评估昂贵时,Log-E-Exp公式作为对数-求和-指数(LogSumExp)函数的抽象。虽然这种形式的熵风险目标出现在许多机器学习问题中,但现有的优化算法存在一些基本限制,包括不收敛、数值不稳定和收敛速度慢。为了解决这些限制,我们提出了一种几何感知随机算法,称为SCENT,用于熵风险最小化的对偶公式,该公式被转化为一个最小-最小优化问题。我们设计的关键是对偶变量采用随机近端镜像下降(SPMD)更新,配备由负指数函数诱导的Bregman散度,该散度忠实地捕捉了目标的几何结构。我们的主要贡献有三点:(i)对于凸问题,我们建立了所提出的SCENT算法的O(1/√T)收敛率;(ii)我们从理论上刻画了SPMD在优化对偶变量方面相对于标准SGD更新的优势;(iii)我们在极端分类、部分AUC最大化、对比学习和分布鲁棒优化中展示了SCENT的经验有效性,它始终优于现有基线。代码可在https://this URL获取。

英文摘要:

This paper studies optimization for a family of problems termed $\textbf{compositional entropic risk minimization}$, in which each data's loss is formulated as a Log-Expectation-Exponential (Log-E-Exp) function. The Log-E-Exp formulation serves as an abstraction of the Log-Sum-Exponential (LogSumExp) function when the explicit summation inside the logarithm is taken over a gigantic number of items and is therefore expensive to evaluate. While entropic risk objectives of this form arise in many machine learning problems, existing optimization algorithms suffer from several fundamental limitations including non-convergence, numerical instability, and slow convergence rates. To address these limitations, we propose a geometry-aware stochastic algorithm, termed $\textbf{SCENT}$, for the dual formulation of entropic risk minimization cast as a min--min optimization problem. The key to our design is a $\textbf{stochastic proximal mirror descent (SPMD)}$ update for the dual variable, equipped with a Bregman divergence induced by a negative exponential function that faithfully captures the geometry of the objective. Our main contributions are threefold: (i) we establish an $O(1/\sqrt{T})$ convergence rate of the proposed SCENT algorithm for convex problems; (ii) we theoretically characterize the advantages of SPMD over standard SGD update for optimizing the dual variable; and (iii) we demonstrate the empirical effectiveness of SCENT on extreme classification, partial AUC maximization, contrastive learning and distributionally robust optimization, where it consistently outperforms existing baselines. Code is available at https://github.com/Optimization-AI/SCENT.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑