Papers › Random matrices in service of ML footprint: ternary random features with no performance loss

Random matrices in service of ML footprint: ternary random features with no performance loss

5 Oct 2021ICLR 2022 4arXiv:2110.01899archive 2025-07-28

Hafiz Tiomoko Ali, Zhenyu Liao, Romain Couillet

In this article, we investigate the spectral behavior of random features kernel matrices of the type K = 𝔼_w [σ(wᵀxᵢ)σ(wᵀxⱼ)]_(i,j=1)ⁿ, with nonlinear function σ(·), data x₁, …, xₙ ∈ℝᵖ, and random projection vector w ∈ℝᵖ having i.i.d. entries. In a high-dimensional setting where the number of data n and their dimension p are both large and comparable, we show, under a Gaussian mixture model for the data, that the eigenspectrum of K is independent of the distribution of the i.i.d.(zero-mean and unit-variance) entries of w, and only depends on σ(·) via its (generalized) Gaussian moments 𝔼_(z∼𝒩(0,1))[σ′(z)] and 𝔼_(z∼𝒩(0,1))[σ″(z)]. As a result, for any kernel matrix K of the form above, we propose a novel random features technique, called Ternary Random Feature (TRF), that (i) asymptotically yields the same limiting kernel as the original K in a spectral sense and (ii) can be computed and stored much more efficiently, by wisely tuning (in a data-dependent manner) the function σ and the random vector w, both taking values in {-1,0,1}. The computation of the proposed random features requires no multiplication, and a factor of b times less bits for storage compared to classical random features such as random Fourier features, with b the number of bits to store full precision values. Besides, it appears in our experiments on real data that the substantial gains in computation and storage are accompanied with somewhat improved performances compared to state-of-the-art random features compression/quantization methods.

PaperPDFConference PDFCode

In Syntology View this paper on Syntology, its page in Syntology's graph. That page lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

hafiztiomoko/ternaryrandomfeatures officialmentioned in paperpytorchSyntology: not harvested report
model-compression/lossless_compression mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to "Lossless" Compression of Deep Neural Networks: A High-dimensional Neural Tangent... (arXiv:2403.00258; that paper's own run record: 7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified); nothing checks that they implement this paper's method. report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Quantization

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections