mlsanityData to 7 Oct 2026

Hyper-Compression: Model Compression via Hyperfunction

arXiv 2409.00592 ↗First posted 1 Sep 2024cs.LG cs.AI cs.ETcited by 3

Not on the map. Why?

Abstract (arXiv)

The rapid growth of large models' size has far outpaced that of computing resources. To bridge this gap, encouraged by the parsimonious relationship between genotype and phenotype in the brain's growth and development, we propose the so-called Hyper-Compression that turns the model compression into the issue of parameter representation via a hyperfunction. Specifically, it is known that the trajectory of some low-dimensional dynamic systems can fill the high-dimensional space eventually. Thus, Hyper-Compression, using these dynamic systems as the hyperfunctions, represents the parameters of the target network by their corresponding composition number or trajectory length. This suggests a novel mechanism for model compression, substantially different from the existing pruning, quantization, distillation, and decomposition. Along this direction, we methodologically identify a suitable dynamic system with the irrational winding as the hyperfunction and theoretically derive its associated error bound. Next, guided by our theoretical insights, we propose several engineering twists to make the Hyper-Compression pragmatic and effective. Lastly, systematic and comprehensive experiments on textcolorblackNLP models such as LLaMA and Qwen series and vision models confirm that Hyper-Compression enjoys the following PNAS merits: 1) Preferable compression ratio; 2) No post-hoc retraining; 3) Affordable inference time; and 4) Short compression time. It compresses LLaMA2-7B in an hour and achieves close-to-int4-quantization performance, without retraining and with a performance drop of less than 1%. We have open-sourced our code in https://github.com/Juntongkuki/Hyper-Compression.git for free download and evaluation.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 41 of its 81 references that are in the map. First posted on arXiv 1 Sep 2024.

Builds on

41 of 81 references.

References · 41

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2015U-Net: Convolutional Networks for Biomedical Image Segmentationcited by 19,604
  3. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
  4. 2020Measuring Massive Multitask Language Understandingcited by 7,768
  5. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
  6. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
  7. 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,464
  8. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
  9. 2019DeepSDF: Learning Continuous Signed Distance Functions for Shape Representationcited by 2,682
  10. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
  11. 2024Qwen2 Technical Reportcited by 2,076
  12. 2019Searching for MobileNetV3cited by 1,984
29 more
  1. 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,838
  2. 2023Pythia: A Suite for Analyzing Large Language Models Across Training and Scalingcited by 1,734
  3. 2022SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Modelscited by 1,338
  4. 2023AWQ: Activation-aware Weight Quantization for LLM Compression and Accelerationcited by 1,234
  5. 2016HyperNetworkscited by 1,003
  6. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
  7. 2017Crowdsourcing Multiple Choice Science Questionscited by 742
  8. 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
  9. 2024TinyLlama: An Open-Source Small Language Modelcited by 604
  10. 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 596
  11. 2018Meta-Learning with Latent Embedding Optimizationcited by 476
  12. 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 408
  13. 2018WiC: the Word-in-Context Dataset for Evaluating Context-Sensitive Meaning Representationscited by 370
  14. 2023LLM-QAT: Data-Free Quantization Aware Training for Large Language Modelscited by 320
  15. 2022Optimal Brain Compression: A Framework for Accurate Post-Training Quantization and Pruningcited by 317
  16. 2020ZeroQ: A Novel Zero Shot Quantization Frameworkcited by 265
  17. 2023A Survey on Model Compression for Large Language Modelscited by 263
  18. 2021COIN: COmpression with Implicit Neural representationscited by 232
  19. 2018ReCoRD: Bridging the Gap between Human and Machine Commonsense Reading Comprehensioncited by 198
  20. 2023Fluctuation-based Adaptive Structured Pruning for Large Language Modelscited by 110
  21. 2022Training Trajectories of Language Models Across Scalescited by 80
  22. 2022SQuant: On-the-Fly Data-Free Quantization via Diagonal Hessian Approximationcited by 51
  23. 2021Deep Network Approximation: Achieving Arbitrary Accuracy with Fixed Number of Neuronscited by 41
  24. 2022Post-training Quantization for Neural Networks with Provable Guaranteescited by 32
  25. 2024Tiny Titans: Can Smaller Large Language Models Punch Above Their Weight in the Real World for Meeting Summarization?cited by 32
  26. 2022Example-based Hypernetworks for Out-of-Distribution Generalizationcited by 16
  27. 2023Accurate Retraining-free Pruning for Pretrained Encoder-based Language Modelscited by 11
  28. 2023Capturing dynamical correlations using implicit neural representationscited by 6
  29. 2024NERV++: An Enhanced Implicit Neural Video Representationcited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 2; 2026: 1.

3 papers.