mlsanityData to 7 Oct 2026

On Design Choices in Similarity-Preserving Sparse Randomized Embeddings

arXiv 2501.14741 ↗First posted 12 Dec 2024cs.NE cs.LG q-bio.NCcited by 1

Not on the map. Why?

Abstract (arXiv)

Expand & Sparsify is a principle that is observed in anatomically similar neural circuits found in the mushroom body (insects) and the cerebellum (mammals). Sensory data are projected randomly to much higher-dimensionality (expand part) where only few the most strongly excited neurons are activated (sparsify part). This principle has been leveraged to design a FlyHash algorithm that forms similarity-preserving sparse embeddings, which have been found useful for such tasks as novelty detection, pattern recognition, and similarity search. Despite its simplicity, FlyHash has a number of design choices to be set such as preprocessing of the input data, choice of sparsifying activation function, and formation of the random projection matrix. In this paper, we explore the effect of these choices on the performance of similarity search with FlyHash embeddings. We find that the right combination of design choices can lead to drastic difference in the search performance.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 22 of its 59 references that are in the map. First posted on arXiv 12 Dec 2024.

Builds on

22 of 59 references.

References · 22

  1. 2021A Survey on Hyperdimensional Computing aka Vector Symbolic Architectures, Part I: Models and Data Transformationscited by 98
  2. 2021A Survey on Hyperdimensional Computing aka Vector Symbolic Architectures, Part II: Applications, Cognitive Models, and Challengescited by 68
  3. 2020A comparison of Vector Symbolic Architecturescited by 63
  4. 2020Classification using Hyperdimensional Computing: A Reviewcited by 60
  5. 2020A Theoretical Perspective on Hyperdimensional Computingcited by 43
  6. 2021Computing on Functions Using Randomized Vector Representationscited by 41
  7. 2021Hyperdimensional computing as a framework for systematic aggregation of image descriptorscited by 32
  8. 2018A theory of sequence indexing and working memory in recurrent neural networkscited by 29
  9. 2021Attention Approximates Sparse Distributed Memorycited by 29
  10. 2020Variable Binding for Sparse Distributed Representations: Theory and Applicationscited by 27
  11. 2022Discrete Key-Value Bottleneckcited by 18
  12. 2021Can a Fruit Fly Learn Word Embeddings?cited by 17
10 more
  1. 2017Neural Distributed Autoassociative Memories: A Surveycited by 12
  2. 2020Bio-Inspired Hashing for Unsupervised Similarity Searchcited by 11
  3. 2023Sparse Distributed Memory is a Continual Learnercited by 11
  4. 2017A survey of dimensionality reduction techniques based on random projectioncited by 8
  5. 2020Expressivity of expand-and-sparsify representationscited by 6
  6. 2024Laplace-HDC: Understanding the geometry of binary hyperdimensional computingcited by 4
  7. 2022Streaming Encoding Algorithms for Scalable Hyperdimensional Computingcited by 3
  8. 2023Capacity Analysis of Vector Symbolic Architecturescited by 3
  9. 2023Efficient Decoding of Compositional Structure in Holistic Representationscited by 3
  10. 2020Binary autoencoder with random binary weightscited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.