Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/5819
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSen, Lord-
dc.contributor.authorMukherjee, Shyamapada-
dc.date.accessioned2026-06-18T12:12:57Z-
dc.date.available2026-06-18T12:12:57Z-
dc.date.issued2026-06-
dc.identifier.citationIEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), Denver, Colorado, 03-07 June 2026en_US
dc.identifier.urihttp://hdl.handle.net/2080/5819-
dc.descriptionCopyright belongs to the proceeding publisher.en_US
dc.description.abstractThe 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.en_US
dc.subjectDeep Learningen_US
dc.subjectConvolutional Neural Networks (CNNs)en_US
dc.titleMapping Networksen_US
dc.typeArticleen_US
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
2026_CVPR_LSen_Mapping.pdf6.28 MBAdobe PDFView/Open    Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.