atlas

Research map / Architectures and efficiency / RNNs and normalization

OPTIMAL ROBUST MEMORIZATION WITH RELU NEURAL NETWORKS

ICLR 2024 · Architectures and efficiency › RNNs and normalization · approach: Width and depth of ReLU networks

Read the paperCheck your idea against 108,967 papers

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

Studies the minimal ReLU network size needed to robustly memorize a finite classification dataset, proving NP-hardness of computing the optimal size and giving matching-order constructions.

Problem

Robust memorization with neural networks: determining the expressive power needed for ReLU networks to interpolate a finite labeled dataset while remaining robust to input perturbations, a problem that has not been thoroughly studied.

Approach

Theoretical analysis of robust memorization: proves NP-hardness of computing the optimal ReLU network size for robust memorization and establishes optimal (tight) bounds on the network size needed for robust interpolation of finite classification datasets.

Key results

Limitations

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