arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2004.14539cs.LGcs.CVstat.ML

Physarum Powered Differentiable Linear Programming Layers and Applications

University of Wisconsin-Madison(威斯康星大学麦迪逊分校);University of Illinois at Chicago(伊利诺伊大学芝加哥分校)

Zihang Meng, Sathya N. Ravi, Vikas Singh

英文摘要:

Consider a learning algorithm, which involves an internal call to an optimization routine such as a generalized eigenvalue problem, a cone programming problem or even sorting. Integrating such a method as a layer(s) within a trainable deep neural network (DNN) in an efficient and numerically stable way is not straightforward -- for instance, only recently, strategies have emerged for eigendecomposition and differentiable sorting. We propose an efficient and differentiable solver for general linear programming problems which can be used in a plug and play manner within DNNs as a layer. Our development is inspired by a fascinating but not widely used link between dynamics of slime mold (physarum) and optimization schemes such as steepest descent. We describe our development and show the use of our solver in a video segmentation task and meta-learning for few-shot learning. We review the existing results and provide a technical analysis describing its applicability for our use cases. Our solver performs comparably with a customized projected gradient descent method on the first task and outperforms the differentiable CVXPY-SCS solver on the second task. Experiments show that our solver converges quickly without the need for a feasible initial point. Our proposal is easy to implement and can easily serve as layers whenever a learning procedure needs a fast approximate solution to a LP, within a larger network.

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

↑