atlas

Research map / Architectures and efficiency / RNNs and normalization

An Exact Poly-Time Membership-Queries Algorithm for Extracting a Three-Layer ReLU Network

ICLR 2023 · Architectures and efficiency › RNNs and normalization · approach: Width and depth of ReLU networks · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Recover neurons from critical points and reconstruct their local affine transformationsDepth-two ReLU networks · δ-regular networks of arbitrary finite widthexact reconstructionHelped
Identify first-layer critical hyperplanes, recover the first layer, then reduce the top two layers to depth-two reconstructionDepth-three ReLU networks · δ-regular networks with d_1 ≤ d and non-zero top-layer partial derivativesexact reconstructionHelped
Allow arbitrary finite width instead of requiring linearly independent rows in the depth-two weights matrixDepth-two ReLU extraction · General-position ReLU networksnetwork width supportedHelped
Add small random perturbations to network weightsTwo- and three-layer ReLU networks · Networks with bounded weightsprobability of δ-regularity: 1-2^{-d}Helped

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