mlsanityData to 7 Oct 2026

Streaming Encoding Algorithms for Scalable Hyperdimensional Computing

arXiv 2209.09868 ↗First posted 20 Sep 2022cs.LG cs.NEcited by 3

Not on the map. Why?

Abstract (arXiv)

Hyperdimensional computing (HDC) is a paradigm for data representation and learning originating in computational neuroscience. HDC represents data as high-dimensional, low-precision vectors which can be used for a variety of information processing tasks like learning or recall. The mapping to high-dimensional space is a fundamental problem in HDC, and existing methods encounter scalability issues when the input data itself is high-dimensional. In this work, we explore a family of streaming encoding techniques based on hashing. We show formally that these methods enjoy comparable guarantees on performance for learning applications while being substantially more efficient than existing alternatives. We validate these results experimentally on a popular high-dimensional classification problem and show that our approach easily scales to very large data sets.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 17 of its 76 references that are in the map. First posted on arXiv 20 Sep 2022.

Builds on

17 of 76 references.

References · 17

  1. 2021Convex optimizationcited by 2,479
  2. 2015Compressing Neural Networks with the Hashing Trickcited by 150
  3. 2021A Survey on Hyperdimensional Computing aka Vector Symbolic Architectures, Part I: Models and Data Transformationscited by 98
  4. 2021A Survey on Hyperdimensional Computing aka Vector Symbolic Architectures, Part II: Applications, Cognitive Models, and Challengescited by 68
  5. 2020Classification using Hyperdimensional Computing: A Reviewcited by 60
  6. 2015MLlib: Machine Learning in Apache Sparkcited by 55
  7. 2019In-memory hyperdimensional computingcited by 47
  8. 2020A Theoretical Perspective on Hyperdimensional Computingcited by 43
  9. 2018A theory of sequence indexing and working memory in recurrent neural networkscited by 29
  10. 2020Variable Binding for Sparse Distributed Representations: Theory and Applicationscited by 27
  11. 2018Hardware Optimizations of Dense Binary Hyperdimensional Computing: Rematerialization of Hypervectors, Binarized Bundling, and Combinational Associative Memorycited by 14
  12. 2017Autoscaling Bloom Filter: Controlling Trade-off Between True and False Positivescited by 12
5 more
  1. 2021Generalized Learning Vector Quantization for Classification in Randomized Neural Networks and Hyperdimensional Computingcited by 12
  2. 2020HyperEmbed: Tradeoffs Between Resources and Performance in NLP Tasks with Hyperdimensional Computing enabled Embedding of n-gram Statisticscited by 11
  3. 2021Semantically Constrained Memory Allocation (SCMA) for Embedding in Efficient Recommendation Systemscited by 7
  4. 2021MIMHD: Accurate and Efficient Hyperdimensional Inference Using Multi-Bit In-Memory Computingcited by 7
  5. 2020Expressivity of expand-and-sparsify representationscited by 6

Built on by

Cited by year

Citing papers per year: 2023: 2; 2024: 1.

3 papers.