arXiv:2506.14263cs.LGmath.OC2025-06CVPR被引 6

提出可证明鲁棒性的学习优化方法,提升复杂场景下的求解速度与稳定性。

Towards Robust Learning to Optimize with Theoretical Guarantees

  • 通过特征对齐实现从分布内到分布外的性能推导
  • 在分布外场景下收敛速度最多提升10倍
  • 仅用梯度信息构建特征,适合实际部署

学习优化(L2O)是一种基于学习的方法来解决数学优化问题。尽管在无线通信、计算机网络和电子设计等领域取得成功,现有L2O方法缺乏在分布外(OOD)场景下的性能与鲁棒性理论证明。本文提供完整证明:首先,给出一个保证所有分布内(InD)实例均匀收敛的充分条件;其次,基于将分布外问题对齐到分布内问题的方法,证明了分布外收敛率恶化程度由L2O模型输入特征决定。此外,提出一种仅使用梯度的简洁特征构造方法和一种新型基于梯度的历史建模机制。数值仿真表明,所提模型在分布内与分布外场景下均优于现有最优基线,收敛速度最高提升10倍。代码见 https://github.com/NetX-lab/GoMathL2O-Official。

原文摘要 · Abstract (English)

Learning to optimize (L2O) is an emerging technique to solve mathematical optimization problems with learning-based methods. Although with great success in many real-world scenarios such as wireless communications, computer networks, and electronic design, existing L2O works lack theoretical demonstration of their performance and robustness in out-of-distribution (OOD) scenarios. We address this gap by providing comprehensive proofs. First, we prove a sufficient condition for a robust L2O model with homogeneous convergence rates over all In-Distribution (InD) instances. We assume an L2O model achieves robustness for an InD scenario. Based on our proposed methodology of aligning OOD problems to InD problems, we also demonstrate that the L2O model's convergence rate in OOD scenarios will deteriorate by an equation of the L2O model's input features. Moreover, we propose an L2O model with a concise gradient-only feature construction and a novel gradient-based history modeling method. Numerical simulation demonstrates that our proposed model outperforms the state-of-the-art baseline in both InD and OOD scenarios and achieves up to 10 $\times$ convergence speedup. The code of our method can be found from https://github.com/NetX-lab/GoMathL2O-Official.

学习优化鲁棒性收敛加速

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