Deep Equilibrium Models

Code

• github.com/locuslab/deq
  OfficialIn paperpytorch★ 795
• github.com/prolearner/hypertorch
  pytorch★ 126
• github.com/sciml/fastdeq.jl
  none★ 59
• github.com/locuslab/monotone_op_net
  pytorch★ 53
• github.com/locuslab/impsq
  pytorch★ 30
• github.com/lufanma/ifr
  pytorch★ 20
• github.com/martaskrt/qdeq
  pytorch★ 7
• github.com/SinclairHudson/DeepEquilibrium
  pytorch★ 7
• github.com/cgoemaere/hopdeq
  pytorch★ 6
• github.com/cgoemaere/hamdeq
  pytorch★ 6

Abstract

We present a new approach to modeling sequential data: the deep equilibrium model (DEQ). Motivated by an observation that the hidden layers of many existing deep sequence models converge towards some fixed point, we propose the DEQ approach that directly finds these equilibrium points via root-finding. Such a method is equivalent to running an infinite depth (weight-tied) feedforward network, but has the notable advantage that we can analytically backpropagate through the equilibrium point using implicit differentiation. Using this approach, training and prediction in these networks require only constant memory, regardless of the effective "depth" of the network. We demonstrate how DEQs can be applied to two state-of-the-art deep sequence models: self-attention transformers and trellis networks. On large-scale language modeling tasks, such as the WikiText-103 benchmark, we show that DEQs 1) often improve performance over these state-of-the-art models (for similar parameter counts); 2) have similar computational requirements to existing models; and 3) vastly reduce memory consumption (often the bottleneck for training large sequence models), demonstrating an up-to 88% memory reduction in our experiments. The code is available at https://github.com/locuslab/deq .

Tasks

Benchmark Results

Reproductions