让神经网络直接求解优化问题，实现硬约束下的精准建模。
Differentiable Convex Optimization Layers in Neural Architectures: Foundations and Perspectives
- 将可微凸优化层嵌入神经网络，实现端到端训练。
- 从二次规划扩展到支持一般凸优化问题的框架。
- 适合需要严格满足约束条件的科研与工业场景。
将优化问题融入神经网络架构代表了深度学习中处理约束的根本性转变。尽管传统方法通过正则化等技术引入软约束，但严格满足硬约束仍具挑战。近期进展通过将优化层作为可微组件直接嵌入深度网络，解决了这一难题。本文综述了该技术的发展历程与现状，涵盖从早期仅限于二次规划的实现，到如今支持一般凸优化问题的最新框架。我们系统梳理了其理论基础、数学推导及新兴应用，分析了多个实际案例，展示了该混合方法的巨大潜力。本研究整合了优化理论与深度学习的前沿成果，为当前能力与未来方向提供了深刻洞见。
原文摘要 · Abstract (English)
The integration of optimization problems within neural network architectures represents a fundamental shift from traditional approaches to handling constraints in deep learning. While it is long known that neural networks can incorporate soft constraints with techniques such as regularization, strict adherence to hard constraints is generally more difficult. A recent advance in this field, however, has addressed this problem by enabling the direct embedding of optimization layers as differentiable components within deep networks. This paper surveys the evolution and current state of this approach, from early implementations limited to quadratic programming, to more recent frameworks supporting general convex optimization problems. We provide a comprehensive review of the background, theoretical foundations, and emerging applications of this technology. Our analysis includes detailed mathematical proofs and an examination of various use cases that demonstrate the potential of this hybrid approach. This work synthesizes developments at the intersection of optimization theory and deep learning, offering insights into both current capabilities and future research directions in this rapidly evolving field.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。