1 citations · 2 across the 18 of their papers we have counts for
21 papers · 1 filter
Maximal correlation under cardinality constraints
Dror Drach, Tomer Berg, Or Ordentlich +1
In this paper, we define and analyze the quantized maximal correlation, an extension of the notion of maximal correlation restricted to functions taking values in sets of bounded c…
Price of metric universality in vector quantization is at most 0.11 bit
Alina Harbuzova, Or Ordentlich, Yury Polyanskiy
Fast computation of a matrix product is a workhorse of modern LLMs. To make their deployment more efficient, a popular approach is that of using a low-precision approxim…
High-Rate Quantized Matrix Multiplication I
Or Ordentlich, Yury Polyanskiy
This paper investigates the problem of quantized matrix multiplication (MatMul), which has become crucial for the efficient deployment of large language models (LLMs). We consider…
The Voronoi Spherical CDF for Lattices and Linear Codes: New Bounds for Quantization and Coding
Or Ordentlich
For a lattice/linear code, we define the Voronoi spherical cumulative density function (CDF) as the CDF of the -norm/Hamming weight of a random vector uniformly distributed…
High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables
Iris Kaplan, Or Ordentlich
Recent work have shown that the quantization for matrix multiplication problem can be optimally solved by quantizing each column in each matrix using a nested lattice code, and the…
Optimal Quantization for Matrix Multiplication
Or Ordentlich, Yury Polyanskiy
Recent work in machine learning community proposed multiple methods for performing lossy compression (quantization) of large matrices. This quantization is important for accelerati…