arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2002.04091math.OCeess.SP
收藏

基于神经解码的网络流问题求解

Learning to Solve Network Flow Problems via Neural Decoding

Yize Chen, Baosen Zhang

摘要:

交通运输、电力系统、运筹学等工程应用中的许多决策问题都需要反复求解具有大量不同输入的大规模线性规划问题。例如,在具有高度不确定性的可再生资源的能源系统中,每隔几分钟就可能需要解决数万个场景。线性网络流问题的标准迭代算法虽然效率很高,但在这些应用中却成为一个瓶颈。在这项工作中,我们提出了一种新的学习方法来加速解决过程。通过利用LP对偶的丰富理论和经济解释,我们将神经网络的输出解释为噪声码字,其中码本由优化问题的KKT条件给出。我们提出了一个前馈解码策略,找到最佳的积极约束。这种设计是错误校正的,与当前最先进的迭代求解器相比,可以提供数量级的加速,同时与端到端学习方法相比,在可行性和最优性方面提供更好的解决方案。

英文摘要:

Many decision-making problems in engineering applications such as transportation, power system and operations research require repeatedly solving large-scale linear programming problems with a large number of different inputs. For example, in energy systems with high levels of uncertain renewable resources, tens of thousands of scenarios may need to be solved every few minutes. Standard iterative algorithms for linear network flow problems, even though highly efficient, becomes a bottleneck in these applications. In this work, we propose a novel learning approach to accelerate the solving process. By leveraging the rich theory and economic interpretations of LP duality, we interpret the output of the neural network as a noisy codeword, where the codebook is given by the optimization problem's KKT conditions. We propose a feedforward decoding strategy that finds the optimal set of active constraints. This design is error correcting and can offer orders of magnitude speedup compared to current state-of-the-art iterative solvers, while providing much better solutions in terms of feasibility and optimality compared to end-to-end learning approaches.

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

↑