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:2312.00960

Help | Advanced Search

Computer Science > Computation and Language

arXiv:2312.00960 (cs)
[Submitted on 1 Dec 2023 ]

Title: The Cost of Compression: Investigating the Impact of Compression on Parametric Knowledge in Language Models

Title: 压缩的成本:研究压缩对语言模型中参数知识的影响

Authors:Satya Sai Srinath Namburi, Makesh Sreedhar, Srinath Srinivasan, Frederic Sala
Abstract: Compressing large language models (LLMs), often consisting of billions of parameters, provides faster inference, smaller memory footprints, and enables local deployment. Two standard compression techniques are pruning and quantization, with the former eliminating redundant connections in model layers and the latter representing model parameters with fewer bits. The key tradeoff is between the degree of compression and the impact on the quality of the compressed model. Existing research on LLM compression primarily focuses on performance in terms of general metrics like perplexity or downstream task accuracy. More fine-grained metrics, such as those measuring parametric knowledge, remain significantly underexplored. To help bridge this gap, we present a comprehensive analysis across multiple model families (ENCODER, ENCODER-DECODER, and DECODER) using the LAMA and LM-HARNESS benchmarks in order to systematically quantify the effect of commonly employed compression techniques on model performance. A particular focus is on tradeoffs involving parametric knowledge, with the goal of providing practitioners with practical insights to help make informed decisions on compression. We release our codebase1 to enable further research.
Abstract: 压缩大型语言模型(LLMs),这些模型通常由数十亿个参数组成,可以提供更快的推理速度、更小的内存占用,并支持本地部署。 两种标准的压缩技术是剪枝和量化,前者消除模型层中的冗余连接,后者用更少的位数表示模型参数。 关键的权衡在于压缩程度与对压缩后模型质量的影响之间。 现有的LLM压缩研究主要集中在通用指标如困惑度或下游任务准确率方面的性能上。 更细粒度的指标,例如衡量参数知识的指标,仍远未得到充分探索。 为了帮助弥合这一差距,我们使用LAMA和LM-HARNESS基准对多个模型家族(ENCODER、ENCODER-DECODER和DECODER)进行了全面分析,以系统地量化常用压缩技术对模型性能的影响。 特别关注涉及参数知识的权衡,旨在为从业者提供实用的见解,帮助他们在压缩方面做出明智的决策。 我们发布了我们的代码库1以促进进一步的研究。
Comments: Accepted to EMNLP 2023 Findings
Subjects: Computation and Language (cs.CL) ; Artificial Intelligence (cs.AI); Machine Learning (cs.LG)
Cite as: arXiv:2312.00960 [cs.CL]
  (or arXiv:2312.00960v1 [cs.CL] for this version)
  https://doi.org/10.48550/arXiv.2312.00960
arXiv-issued DOI via DataCite

Submission history

From: Satya Sai Srinath Namburi [view email]
[v1] Fri, 1 Dec 2023 22:27:12 UTC (2,492 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
license icon view license
Current browse context:
cs.LG
< prev   |   next >
new | recent | 2023-12
Change to browse by:
cs
cs.AI
cs.CL

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号