mlsanityData to 7 Oct 2026

Kilobyte Models: Neural Networks as a Seed and a Quantized Latent

arXiv 2608.00860 ↗First posted 1 Aug 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

The cost of storing and transmitting a trained neural network scales with its parameter count, a bottleneck for over-the-air updates, on-device libraries, and other bandwidth-bound deployments. We study an extreme form of model compression in which the deployable artifact is not the weights but a short recipe for regenerating them. Building on Mapping Networks, which express a network's weights as a nonlinear function of a compact trainable latent and a fixed random basis, we observe that only the latent need be stored, because the basis and initialization center are reproducible from an integer seed. A model becomes a seed together with a quantized latent, whose size is set by the latent dimension and bit width rather than the parameter count. We formalize this artifact and introduce a seeded block-wise basis that scales to networks whose projection cannot be held in memory. In our experiments, a mapped model is as accurate as the same network quantized aggressively to a few bits per weight, while taking far fewer bytes to store. Reaching the most aggressive bit widths depends on fine-tuning the latent with quantization in the loop. The results do not depend on the particular random basis, and a structured basis lets the weights be regenerated almost for free even for large networks.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 22 of its 32 references that are in the map. First posted on arXiv 1 Aug 2026.

Builds on

22 of 32 references.

References · 22

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  4. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
  5. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
  6. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
  7. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  8. 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,031
  9. 2020Knowledge Distillation: A Surveycited by 1,578
  10. 2017Quantization and Training of Neural Networks for Efficient Integer-Arithmetic-Only Inferencecited by 1,548
  11. 2016HyperNetworkscited by 1,003
  12. 2020Up or Down? Adaptive Rounding for Post-Training Quantizationcited by 600
10 more
  1. 2015BinaryConnect: Training Deep Neural Networks with binary weights during propagationscited by 571
  2. 2016Learning Structured Sparsity in Deep Neural Networkscited by 538
  3. 2018Measuring the Intrinsic Dimension of Objective Landscapescited by 364
  4. 2023VeRA: Vector-based Random Matrix Adaptationcited by 294
  5. 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
  6. 2013Predicting Parameters in Deep Learningcited by 223
  7. 2015Compressing Neural Networks with the Hashing Trickcited by 150
  8. 2023A Brief Review of Hypernetworks in Deep Learningcited by 102
  9. 2023NOLA: Compressing LoRA using Linear Combination of Random Basiscited by 28
  10. 2024MCNC: Manifold-Constrained Reparameterization for Neural Compressioncited by 4

Built on by

Not cited yet.