Mapping Networks
Not on the map. Why?
Abstract (arXiv)
The escalating parameter counts in modern deep learning models pose a fundamental challenge to efficient training and resolution of overfitting. We address this by introducing the Mapping Networks which replace the high dimensional weight space by a compact, trainable latent vector based on the hypothesis that the trained parameters of large networks reside on smooth, low-dimensional manifolds. Henceforth, the Mapping Theorem enforced by a dedicated Mapping Loss, shows the existence of a mapping from this latent space to the target weight space both theoretically and in practice. Mapping Networks significantly reduce overfitting and achieve comparable to better performance than target network across complex vision and sequence tasks, including Image Classification, Deepfake Detection etc, with 99.5%, i.e., around 500× reduction in trainable parameters.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 13 of its 21 references that are in the map. First posted on arXiv 22 Feb 2026.
Builds on
13 of 21 references.
References · 13
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2019FaceForensics++: Learning to Detect Manipulated Facial Imagescited by 1,095
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
- 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 585
- 2019Celeb-DF: A Large-scale Challenging Dataset for DeepFake Forensicscited by 573
- 2018Measuring the Intrinsic Dimension of Objective Landscapescited by 364
- 2016Entropy-SGD: Biasing Gradient Descent Into Wide Valleyscited by 357
- 2018Essentially No Barriers in Neural Network Energy Landscapecited by 328
- 2014Speeding up Convolutional Neural Networks with Low Rank Expansionscited by 283
- 2013Predicting Parameters in Deep Learningcited by 223
- 2021The loss landscape of deep linear neural networks: a second-order analysiscited by 24
- 2014Deep Fried Convnetscited by 21
1 more
Built on by
Citing papers per year: 2026: 1.
1 paper.