mlsanityData to 14 Oct 2026

Large-Scale Learning with Less RAM via Randomization

arXiv 1303.4664 ↗First posted 19 Mar 2013cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

We reduce the memory footprint of popular large-scale online learning methods by projecting our weight vector onto a coarse discrete set using randomized rounding. Compared to standard 32-bit float encodings, this reduces RAM usage by more than 50% during training and by up to 95% when making predictions from a fixed model, with almost no loss in accuracy. We also show that randomized counting can be used to implement per-coordinate learning rates, improving model quality with little additional RAM. We prove these memory-saving methods achieve regret guarantees similar to their exact variants. Empirical evaluation confirms excellent performance, dominating standard approaches across memory versus accuracy tradeoffs.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 19 Mar 2013.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.