Pith. sign in

REVIEW 1 cited by

Streaming Encoding Algorithms for Scalable Hyperdimensional Computing

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2209.09868 v4 pith:EUT3MHGY submitted 2022-09-20 cs.LG cs.NE

classification cs.LGcs.NE
keywords datahigh-dimensionallearningcomputingencodingexistinghyperdimensionalmethods
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. On Design Choices in Similarity-Preserving Sparse Randomized Embeddings

    cs.NE 2024-12 conditional novelty 6.0 of 10

    Design choices in FlyHash embeddings, especially preprocessing and block sparse sparsification, can drastically change similarity search performance per stored bit.

Pith tools