Deep Declarative Networks

By Stephen Gould, Richard I. Hartley, Dylan Campbell. 2019

125 citations recorded by the source corpus.

We explore a class of end-to-end learnable models wherein data processing nodes (or network layers) are defined in terms of desired behavior rather than an explicit forward function. Specifically, the forward function is implicitly defined as the solution to a mathematical optimization problem. Consistent with nomenclature in the programming languages community, we name these models deep declarative networks. Importantly, it can be shown that the class of deep declarative networks subsumes current deep learning models. Moreover, invoking the implicit function theorem, we show how gradients can be back-propagated through many declaratively defined data processing nodes thereby enabling end-to-end learning. We discuss how these declarative processing nodes can be implemented in the popular PyTorch deep learning software library allowing declarative and imperative nodes to co-exist within the same network. We also provide numerous insights and illustrative examples of declarative nodes and demonstrate their application for image and point cloud classification tasks.

Subfields: Artificial Intelligence, Materials Chemistry, Statistical and Nonlinear Physics

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Sergey Levine
  2. Andy Zeng
  3. Jonathan Tompson
  4. Corey Lynch
  5. Peter R. Florence
  6. Ayzaan Wahid
  7. Igor Mordatch
  8. Johannes von Oswald

In Statistical and Nonlinear Physics

  1. Johannes von Oswald
  2. Igor Mordatch
  3. Jonathan Tompson
  4. João Sacramento
  5. Corey Lynch
  6. Andy Zeng
  7. Peter R. Florence

Citations in the corpus