Neural Network Expressivity
Overview
It asks what mappings a model can represent exactly or approximate, and how the needed width, depth, parameters, precision, and activation choices scale with the task. Common approaches include universal-approximation results and lower bounds, counting linear regions or polynomial features, circuit-complexity and logic characterizations, and geometric analyses of MLPs, recurrent models, transformers, and graph networks. These tools reveal when depth, recurrence, multiplicative gates, or higher-order interactions add capabilities, often using tasks such as parity, memorization, graph distinguishing, and smooth-function approximation. A central tension is that theoretical capacity does not ensure training will find or use it, and results under idealized assumptions about precision or weights may not transfer directly to practical models.
Latest papers
118 papers8 papers in the last four weeks, down 11% on the four weeks before. 0.0% of all new papers.