mlsanityData to 7 Oct 2026

Optimal rates for density and mode estimation with expand-and-sparsify representations

arXiv 2602.06175 ↗First posted 5 Feb 2026math.ST cs.AI cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Expand-and-sparsify representations are a class of theoretical models that capture sparse representation phenomena observed in the sensory systems of many animals. At a high level, these representations map an input x ∈ ℝd to a much higher dimension m gg d via random linear projections before zeroing out all but the k ll m largest entries. The result is a k-sparse vector in 0,1m. We study the suitability of this representation for two fundamental statistical problems: density estimation and mode estimation. For density estimation, we show that a simple linear function of the expand-and-sparsify representation produces an estimator with minimax-optimal ℓ∞ convergence rates. In mode estimation, we provide simple algorithms on top of our density estimator that recover single or multiple modes at optimal rates up to logarithmic factors under mild conditions.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 3 of its 34 references that are in the map. First posted on arXiv 5 Feb 2026.

Builds on

3 of 34 references.

References · 3

  1. 2020Expressivity of expand-and-sparsify representationscited by 6
  2. 2013Cluster Trees on Manifoldscited by 5
  3. 2021Federated Nearest Neighbor Classification with a Colony of Fruit-Flies: With Supplementcited by 3

Built on by

Not cited yet.