arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2407.02015math.NAcs.NA
收藏

正则化最优传输的鲁棒一阶与二阶微分

Robust First and Second-Order Differentiation for Regularized Optimal Transport

Xingjie Li, Fei Lu, Molei Tao, Felix X. -F. Ye

AI总结:

本文针对正则化最优传输距离的优化问题,解析推导了梯度与熵正则化OT距离的Hessian矩阵,并通过谱分析解决数值不稳定性,实现了可扩展的SGD-Newton方法,在打乱回归中显著提升了收敛速度与参数估计精度。

摘要:

诸如不平衡回归和完全打乱回归等应用可以通过优化正则化最优传输(OT)距离来处理,例如熵正则化最优传输距离和Sinkhorn距离。这类优化的一种常见方法是使用一阶优化器,它需要OT距离的梯度。为了更快收敛,也可以采用二阶优化器,它额外需要Hessian矩阵。这些导数的计算对于高效且准确的优化至关重要。然而,它们在内存消耗和数值不稳定性方面存在显著挑战,尤其是在大数据集和较小正则化强度的情况下。我们通过解析地计算OT距离的梯度以及熵正则化OT距离的Hessian矩阵来规避这些问题,此前由于复杂的逐张量计算以及双层损失函数中对参数的复杂依赖关系,该Hessian矩阵未被使用过。通过解析推导和谱分析,我们识别并解决了由关键线性系统的奇异性和不适定性引起的数值不稳定性。因此,我们实现了Hessian矩阵的可扩展且稳定的计算,从而使随机梯度下降(SGD)-Newton方法得以实现。在打乱回归示例上的测试表明,SGD-Newton方法的第二阶段收敛速度比仅使用梯度下降的方法快数个数量级,同时实现了显著更准确的参数估计。

英文摘要:

Applications such as unbalanced and fully shuffled regression can be approached by optimizing regularized optimal transport (OT) distances, such as the entropic OT and Sinkhorn distances. A common approach for this optimization is to use a first-order optimizer, which requires the gradient of the OT distance. For faster convergence, one might also resort to a second-order optimizer, which additionally requires the Hessian. The computations of these derivatives are crucial for efficient and accurate optimization. However, they present significant challenges in terms of memory consumption and numerical instability, especially for large datasets and small regularization strengths. We circumvent these issues by analytically computing the gradients for OT distances and the Hessian for the entropic OT distance, which was not previously used due to intricate tensor-wise calculations and the complex dependency on parameters within the bi-level loss function. Through analytical derivation and spectral analysis, we identify and resolve the numerical instability caused by the singularity and ill-posedness of a key linear system. Consequently, we achieve scalable and stable computation of the Hessian, enabling the implementation of the stochastic gradient descent (SGD)-Newton methods. Tests on shuffled regression examples demonstrate that the second stage of the SGD-Newton method converges orders of magnitude faster than the gradient descent-only method while achieving significantly more accurate parameter estimations.

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

↑