Image de couverture de livre

Price of universality in vector quantization is at most 0.11 bit

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Harbuzova, Alina, Ordentlich, Or, Polyanskiy, Yury
Format:	Preprint
Publié:	2026
Sujets:	Information Theory Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

WaterSIC: information-theoretically (near) optimal linear layer quantization
par: Lifar, Egor, et autres
Publié: (2026)

High-Rate Quantized Matrix Multiplication II
par: Ordentlich, Or, et autres
Publié: (2026)

Optimal Quantization for Matrix Multiplication
par: Ordentlich, Or, et autres
Publié: (2024)

NestQuant: Nested Lattice Quantization for Matrix Products and LLMs
par: Savkin, Semyon, et autres
Publié: (2025)

High-Rate Quantized Matrix Multiplication I
par: Ordentlich, Or, et autres
Publié: (2026)

On the Minimax Regret of Sequential Probability Assignment via Square-Root Entropy
par: Jia, Zeyu, et autres
Publié: (2025)

Statistical Inference with Limited Memory: A Survey
par: Berg, Tomer, et autres
Publié: (2023)

Optimal Online Bookmaking for Binary Games
par: Bhatt, Alankrita, et autres
Publié: (2025)

Nonparametric MLE for Gaussian Location Mixtures: Certified Computation and Generic Behavior
par: Polyanskiy, Yury, et autres
Publié: (2025)

Learning to Bid Optimally and Efficiently in Adversarial First-price Auctions
par: Han, Yanjun, et autres
Publié: (2020)

The Voronoi Spherical CDF for Lattices and Linear Codes: New Bounds for Quantization and Coding
par: Ordentlich, Or
Publié: (2025)

Quantile Multi-Armed Bandits with 1-bit Feedback
par: Lau, Ivan, et autres
Publié: (2025)

Testing and estimation in orthosymmetric Gaussian sequence model
par: Jia, Zeyu, et autres
Publié: (2025)

Unsourced Multiple Access: A Coding Paradigm for Massive Random Access
par: Liva, Gianluigi, et autres
Publié: (2024)

Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity
par: Lau, Ivan, et autres
Publié: (2025)

A Gapped Scale-Sensitive Dimension and Lower Bounds for Offset Rademacher Complexity
par: Jia, Zeyu, et autres
Publié: (2025)

Which bits went where? Past and future transfer entropy decomposition with the information bottleneck
par: Murphy, Kieran A., et autres
Publié: (2024)

Likelihood-free hypothesis testing
par: Gerber, Patrik Róbert, et autres
Publié: (2022)

Is Dimensionality a Barrier for Retrieval Models?
par: Bangachev, Kiril, et autres
Publié: (2026)

Individualized non-uniform quantization for vector search
par: Tepper, Mariano, et autres
Publié: (2025)

Distributional Information Embedding: A Framework for Multi-bit Watermarking
par: He, Haiyun, et autres
Publié: (2025)

Estimation of embedding vectors in high dimensions
par: Azar, Golara Ahmadi, et autres
Publié: (2023)

Cyclic Group Projection for Enumerating Quasi-Cyclic Codes Trapping Sets
par: Usatyuk, Vasiliy, et autres
Publié: (2024)

High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables
par: Kaplan, Iris, et autres
Publié: (2025)

Haiku to Opus in Just 10 bits: LLMs Unlock Massive Compression Gains
par: Rinberg, Roy, et autres
Publié: (2026)

Thresholds for Reconstruction of Random Hypergraphs From Graph Projections
par: Bresler, Guy, et autres
Publié: (2025)

The Curious Price of Distributional Robustness in Reinforcement Learning with a Generative Model
par: Shi, Laixi, et autres
Publié: (2023)

Avoiding the Price of Adaptivity: Inference in Linear Contextual Bandits via Stability
par: Praharaj, Samya, et autres
Publié: (2025)

Price of Quality: Sufficient Conditions for Sparse Recovery using Mixed-Quality Data
par: Chaabouni, Youssef, et autres
Publié: (2026)

The Price of Sparsity: Sufficient Conditions for Sparse Recovery using Sparse and Sparsified Measurements
par: Chaabouni, Youssef, et autres
Publié: (2025)

Learning to Bid in Non-Stationary Repeated First-Price Auctions
par: Hu, Zihao, et autres
Publié: (2025)

Rate of convergence of the smoothed empirical Wasserstein distance
par: Block, Adam, et autres
Publié: (2022)

Memory Complexity of Estimating Entropy and Mutual Information
par: Berg, Tomer, et autres
Publié: (2024)

Lower Bounds on Mutual Information for Linear Codes Transmitted over Binary Input Channels, and for Information Combining
par: Erez, Uri, et autres
Publié: (2024)

On the Price of Differential Privacy for Spectral Clustering over Stochastic Block Models
par: Koskela, Antti, et autres
Publié: (2025)

The Sample Complexity of Approximate Rejection Sampling with Applications to Smoothed Online Learning
par: Block, Adam, et autres
Publié: (2023)

The strong data processing inequality under the heat flow
par: Klartag, Bo'az, et autres
Publié: (2024)

Computational Equivalence of Spiked Covariance and Spiked Wigner Models via Gram-Schmidt Perturbation
par: Bresler, Guy, et autres
Publié: (2025)

Entropy Contractions in Markov Chains: Half-Step, Full-Step and Continuous-Time
par: Caputo, Pietro, et autres
Publié: (2024)

Theoretical limits of descending $\ell_0$ sparse-regression ML algorithms
par: Stojnic, Mihailo
Publié: (2024)