Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2108.00065

Help | Advanced Search

Computer Science > Machine Learning

arXiv:2108.00065 (cs)
[Submitted on 30 Jul 2021 (v1) , last revised 14 Oct 2022 (this version, v2)]

Title: Model Preserving Compression for Neural Networks

Title: 模型保持压缩 for 神经网络

Authors:Jerry Chee, Megan Renz, Anil Damle, Christopher De Sa
Abstract: After training complex deep learning models, a common task is to compress the model to reduce compute and storage demands. When compressing, it is desirable to preserve the original model's per-example decisions (e.g., to go beyond top-1 accuracy or preserve robustness), maintain the network's structure, automatically determine per-layer compression levels, and eliminate the need for fine tuning. No existing compression methods simultaneously satisfy these criteria $\unicode{x2014}$ we introduce a principled approach that does by leveraging interpolative decompositions. Our approach simultaneously selects and eliminates channels (analogously, neurons), then constructs an interpolation matrix that propagates a correction into the next layer, preserving the network's structure. Consequently, our method achieves good performance even without fine tuning and admits theoretical analysis. Our theoretical generalization bound for a one layer network lends itself naturally to a heuristic that allows our method to automatically choose per-layer sizes for deep networks. We demonstrate the efficacy of our approach with strong empirical performance on a variety of tasks, models, and datasets $\unicode{x2014}$ from simple one-hidden-layer networks to deep networks on ImageNet.
Abstract: 在训练复杂的深度学习模型后,常见的任务是压缩模型以减少计算和存储需求。 在压缩时,希望保留原始模型的每个示例的决策(例如,超越top-1准确率或保持鲁棒性),保持网络结构,自动确定每层的压缩级别,并消除微调的需要。 现有的压缩方法没有同时满足这些标准$\unicode{x2014}$我们引入了一种有原则的方法,通过利用插值分解来实现。 我们的方法同时选择和消除通道(类似地,神经元),然后构建一个插值矩阵,将校正传播到下一层,从而保持网络结构。 因此,即使不进行微调,我们的方法也能取得良好的性能,并且可以进行理论分析。 我们对单层网络的理论泛化界限自然地引出了一个启发式方法,使我们的方法能够自动为深度网络选择每层的大小。 我们在各种任务、模型和数据集上展示了我们方法的有效性,$\unicode{x2014}$从简单的单隐藏层网络到ImageNet上的深度网络。
Comments: 26 pages, 15 figures. To be published in Advances in Neural Information Processing Systems 35
Subjects: Machine Learning (cs.LG)
MSC classes: 68W99, 65F55
Cite as: arXiv:2108.00065 [cs.LG]
  (or arXiv:2108.00065v2 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2108.00065
arXiv-issued DOI via DataCite

Submission history

From: Megan Renz [view email]
[v1] Fri, 30 Jul 2021 20:13:49 UTC (910 KB)
[v2] Fri, 14 Oct 2022 18:56:47 UTC (2,005 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
view license
Current browse context:
cs
< prev   |   next >
new | recent | 2021-08
Change to browse by:
cs.LG

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号