atlas

Research map / Architectures and efficiency / RNNs and normalization

Separation and Bias of Deep Equilibrium Models on Expressivity and Learning Dynamics

NeurIPS 2024 · Architectures and efficiency › RNNs and normalization · approach: Representation geometry and collapse · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Theoretical separations between deep equilibrium models (DEQ) and feedforward networks (FNN) in expressivity (linear regions, steep functions) and an implicit-bias analysis of gradient flow/descent for a diagonal linear DEQ, supported by small experiments.

Problem

Understanding when and why DEQs have provable advantages over explicit feedforward networks, in terms of expressive power and learning dynamics (implicit bias), which prior work (well-posedness, NTK analyses) left open.

Approach

Shows a width-m ReLU DEQ can realize 2^m linear regions, giving a separation from depth-O(m^α) FNNs; constructs a steep target function where DEQ approximates in L∞ with polynomial size while bounded-depth FNNs need exponentially large weights; and characterizes the implicit regularization of gradient flow in a diagonal linear DEQ as minimizing a sum of convex penalties q_i(β_i)=½β_i²+β_i(0)^{-3}β

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use a width-m ReLU DEQ instead of a not-so-deep FNNReLU networks · Piecewise-linear functionslinear regions: 2^m linear regionsHelped
Approximate the target with a width-m DEQ rather than a depth-L FNN of width at most 2m^(1−α)−1ReLU networks · Constructed separation function on [0,1]^dL1 approximation error: FNN error ≥ 1/16Helped
Represent the steep target using a DEQApproximation of g(x) on [0,1]^d · Steep function g(x)L∞ approximation error: ≤ εHelped
Use a diagonal linear DEQ with bias rather than a diagonal linear networkOOD learning · GOTU unseen domainGOTU error: ≤ 4( f̂({k}) − (4 + 3f̂({k}))⁻¹ᐟ³ )² < 4f̂({k})²; baseline: 4f̂({k})² + O(ε)Helped
Use DEQ instead of FNN for the saw-tooth function experimentsFNN and DEQ · Saw-tooth functions with 2⁵ and 2¹⁰ linear regionstest lossHelped
Use DEQ instead of FNN with a similar parameter countFNN and DEQ · Quadratic-optimization solution g(x), δ = 2⁻¹⁰ and 2⁻²⁰test lossHelped
Use DEQ instead of FNN on the unseen-domain Boolean-function tasksFNN and DEQ · OOD functions f1 and f2GOTU errorHelped
Train with diagonal linear DEQ dynamicsDiagonal linear DEQ · Overparameterized interpolationfeature densityHelped

Surprising findings

Limitations

Experimental setup

Datasets: synthetic sawtooth functions synthetic steep function g(x) synthetic boolean functions on {-1,1}^d

Metrics: test loss GOTU error L-infinity approximation error

Baselines: feedforward neural network two-layer linear network diagonal linear network

Builds on: deep equilibrium model Telgarsky depth separation implicit bias of diagonal linear networks

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy