Rethinking Deep Thinking: Stable Learning of Algorithms using Lipschitz Constraints

Jay Bear, Adam Prugel-Bennett, Jonathon Hare

Keywords: machine learning, iterative algorithms, deep thinking, lipschitz, traveling salesperson problem, contraction mapping

TL;DR: Training machines to learn algorithms that are guaranteed to converge to a solution

Abstract: Iterative algorithms solve problems by taking steps until a solution is reached. Models in the form of Deep Thinking (DT) networks have been demonstrated to learn iterative algorithms in a way that can scale to different sized problems at inference time using recurrent computation and convolutions. However, they are often unstable during training, and have no guarantees of convergence/termination at the solution. This paper addresses the problem of instability by analyzing the growth in intermediate representations, allowing us to build models (referred to as Deep Thinking with Lipschitz Constraints (DT-L)) with many fewer parameters and providing more reliable solutions. Additionally our DT-L formulation provides guarantees of convergence of the learned iterative procedure to a unique solution at inference time. We demonstrate DT-L is capable of robustly learning algorithms which extrapolate to harder problems than in the training set. We benchmark on the traveling salesperson problem to evaluate the capabilities of the modified system in an NP-hard problem where DT fails to learn.

Primary Area: Deep learning architectures

Submission Number: 19341