atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

A fast algorithm to simulate nonlinear resistive networks

ICML 2024 · Learning theory and algorithms › Combinatorial and search optimization · approach: Semidefinite relaxations for verification · 1 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.

Frames steady-state of ideal nonlinear resistive networks (resistors, diodes, ideal sources) as a convex QP and solves it with exact (block) coordinate descent, enabling EP training of DRNs on MNIST far larger and faster than SPICE.

Problem

Simulating nonlinear resistive networks (with diodes) used as analog learning machines is very slow with SPICE and prior methods are limited to linear networks.

Approach

Under ideal circuit elements, the steady state is the minimizer of a convex quadratic energy (power dissipation) over a feasible set defined by diode and voltage-source linear constraints; exact coordinate descent gives closed-form node updates (average of neighbors, then clipping), and the bipartite layered DRN allows exact block coordinate descent with parallel GPU updates.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use DRN-XL with exact block coordinate descent instead of the SPICE XS setupMNIST training with resistive networks · MNIST testtest error (%): 3.43% vs 1.33%Helped
use the proposed simulation method instead of SPICE-based simulationDRN steady-state simulation · MNIST trainingsimulation speed: 160 times fasterHelped
scale from DRN-XS to DRN-XLDRN trained with EP · MNISTnetwork size: 327 timesHelped
use DRN-XL rather than DRN-XSDRN trained with EP · MNISTtraining wall-clock time: 10 hours 27 min vs 1 weekHelped
use a 3-hidden-layer DRN rather than a 3-hidden-layer DHNsteady-state simulation · 3-hidden-layer networkiterations to convergence: 6 iterations vs 100 iterationsHelped

Surprising findings

Limitations

Experimental setup

Datasets: MNIST

Benchmarks: MNIST

Metrics: test error rate (%) wall-clock time network size (number of weights) epochs

Baselines: SPICE-based simulation (DRN-XS) backpropagation through the coordinate descent trajectory

Builds on: equilibrium propagation deep resistive network principle of minimum dissipated power deep Hopfield network

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