What do cleanup and crosstalk mean in HDC?
A look back at how the HDC literature describes the terms "cleanup" and "crosstalk", and how we can view both terms through a modern lens using vector search in LanceDB.
Topic
Concepts
A gentle, visual introduction to hyperdimensional computing: encoding data, associative search, and relationships.
Concepts
Showing 1–5 of 13 posts
Durable memory, transient prototypes
An HDC experiment that separates stored examples from temporary class summaries, and compares rebuilding with caching.
How context can change a retrieval ranking
Why shared bipolar binding preserves a ranking, how weighted similarity can change it, and what remains to be tested for useful retrieval.
Semantic compression inside wide hypervectors
How a compact abstraction can use thousands of coordinates, and what the extra width buys an HDC system.
Turn graph data into hypervectors for associative search
Learn how to encode node properties and edge direction with HDC, compose a partial query, and resolve similarity matches back to exact graph records.
Contact
Have a representation problem in mind?
If you're working with connected data, retrieval, agent memory or online learning, we'd love to hear what you're building and where the current representation is falling short.
Get in touch
We usually reply within two business days.