Optimality of the D 4 lattice quantizer
math.MG, cs.IT, math.CO, math.IT
Submitted: 2026-10-26
Updated: 2026-11-03
Comments: Simplified the proof of four-dimensional optimality, with explicit polynomial certificates now included in the paper. Main results unchanged
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Sources
- E8-QAT: Efficient 2-Bit Quantization-Aware Training with Implicit Lattice Codebooks
- FP8 Formats for Deep Learning
- Pyramid Vector Quantization for LLMs
- Leech Lattice Vector Quantization for Efficient LLM Compression
- Efficient Quantization Training with Stochastic Rounding via Structured Subspace Randomness
- Spherical Leech Quantization for Visual Tokenization and Generation
Related papers
- Axis-parallel square packing with an exact formula for optimal packing of seven squares
- The microscopic weighting on a metric space
- Unrectifiable surfaces with intrinsic regularity in Carnot groups
- Monge's transport problem in synthetic Lorentzian spacetimes
- The packing spectrum: interpolation between Hausdorff and packing dimensions
- Quasiconformal uniformization and extension for planar trees