paper-with-me

Papers

Quasi-Equivalence of Width and Depth of Neural Networks

2020-02-06 · Feng-Lei Fan, Rongjie Lai, Ge Wang

While classic studies proved that wide networks allow universal approximation, recent research and successes of deep learning demonstrate the power of deep networks. Based on a symmetric consideration, we investigate if the design of artificial neural networks should have a directional preference, and what the mechanism of interaction is between the width and depth of a network. Inspired by the De Morgan law, we address this fundamental question by establishing a quasi-equivalence between the width and depth of ReLU networks in two aspects. First, we formulate two transforms for mapping an arbitrary ReLU network to a wide network and a deep network respectively for either regression or classification so that the essentially same capability of the original network can be implemented. Then, we replace the mainstream artificial neuron type with a quadratic counterpart, and utilize the factorization and continued fraction representations of the same polynomial function to construct a wide network and a deep network, respectively. Based on our findings, a deep network has a wide equivalent, and vice versa, subject to an arbitrarily small error.

📄 PDF Abstract BibTeX arXiv:2002.02515

Code (0)

등록된 구현이 없습니다.

Tasks

ClassificationContinued fractionGeneral Classification

Methods 이 논문이 사용한 방법론

ReLU How Do I Communicate to Expedia? How Do I Communicate to Expedia? – Call ☎️ +1-(888) 829 (0881) or +1-805-330-4056 or +1-805-330-4056 for Live Support & Special Travel…

Similar Papers 제목 키워드 기반

Shape-Preserving Dimensionality Reduction : An Algorithm and Measures of Topological Equivalence

2021-06-03 · Byeongsu Yu, Kisung You

We introduce a linear dimensionality reduction technique preserving topological features via persistent homology. The method is designed to find linear projection $L$ which preserves the persistent diagram of a point clo…

Dimensionality Reduction

Robust No-Arbitrage under Projective Determinacy

2025-03-31 · Alexandre Boistard, Laurence Carassus, Safae Issaoui

Drawing from set theory, this article contributes to a deeper understanding of the no-arbitrage principle in multiple-priors settings and its application in mathematical finance. In the quasi-sure discrete-time frictionl…

Information-theoretic reduction of deep neural networks to linear models in the overparametrized proportional regime

2025-05-06 · Francesco Camilli, Daria Tieplova, Eleonora Bergamin, Jean Barbier

We rigorously analyse fully-trained neural networks of arbitrary depth in the Bayesian optimal setting in the so-called proportional scaling regime where the number of training samples and width of the input and all inne…

Unified Scalable Equivalent Formulations for Schatten Quasi-Norms

2016-06-02 · Fanhua Shang, Yuanyuan Liu, James Cheng

The Schatten quasi-norm can be used to bridge the gap between the nuclear norm and rank function, and is the tighter approximation to matrix rank. However, most existing Schatten quasi-norm minimization (SQNM) algorithms…

Revisiting Padded Transformer Expressivity: Which Architectural Choices Matter and Which Don't

2026-05-28 · Anej Svete, William Merrill, Ryan Cotterell, Ashish Sabharwal arxiv

Recent work describes what transformers can and cannot compute through connections to boolean circuits, but existing results lack exact characterizations and are sensitive to modeling choices. Padded transformers -- to w…