atlas

Research map / Learning theory and algorithms / Sample complexity

Projected Neural Additive Models as Universal Approximators

NeurIPS 2026 · Learning theory and algorithms › Sample complexity · approach: Neural network approximation theory

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.

Establishes that projected neural additive models (NAMs augmented with a learnable linear transformation T capturing cross-variable interactions) are universal approximators.

Problem

Neural additive models are interpretable but lack expressivity because of their rigid additive structure, while MLPs are universal approximators but not transparent.

Approach

Augments NAMs with a learnable linear transformation T so that cross-variable interactions can be captured while retaining an interpretable structure, and provides a theoretical proof that the resulting PNAMs are universal approximators.

Key results

Limitations

Experimental setup

Baselines: neural additive models multi-layer perceptrons

Builds on: neural additive models multi-layer perceptron

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