Quantization Algorithms for Random Fourier Features
Xiaoyun Li, Ping Li

TL;DR
This paper develops and analyzes quantization algorithms for Random Fourier Features (RFF), revealing that RFF's marginal distribution is independent of the Gaussian kernel parameter, simplifying quantizer design and improving efficiency.
Contribution
The paper introduces a novel insight that RFF's distribution is independent of the kernel parameter, enabling a universal quantizer design and proposing a new LM$^2$-RFF quantizer for better accuracy.
Findings
The marginal distribution of RFF is independent of the Gaussian kernel parameter.
A single Lloyd-Max quantizer can be used for all $\gamma$ values in RFF.
The proposed LM$^2$-RFF quantizer achieves higher accuracy in certain cases.
Abstract
The method of random projection (RP) is the standard technique in machine learning and many other areas, for dimensionality reduction, approximate near neighbor search, compressed sensing, etc. Basically, RP provides a simple and effective scheme for approximating pairwise inner products and Euclidean distances in massive data. Closely related to RP, the method of random Fourier features (RFF) has also become popular, for approximating the Gaussian kernel. RFF applies a specific nonlinear transformation on the projected data from random projections. In practice, using the (nonlinear) Gaussian kernel often leads to better performance than the linear kernel (inner product), partly due to the tuning parameter introduced in the Gaussian kernel. Recently, there has been a surge of interest in studying properties of RFF. After random projections, quantization is an important step…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsAdvanced Data Compression Techniques · Sparse and Compressive Sensing Techniques · Advanced Image and Video Retrieval Techniques
