Testing the limits of bundling capacity (2)
How many records fit in a 2,048-dimensional hyperspace before unrelated records start to look alike? Our experiments suggest that the answer depends on how many comparisons we make.
Showing 1–10 of 22 posts
How many records fit in a 2,048-dimensional hyperspace before unrelated records start to look alike? Our experiments suggest that the answer depends on how many comparisons we make.
How TrainableHD learns its encoder as well as its classes. We follow a mistake through training, work through an incident example, and examine the costs of deployment.
What happens as we pack more and more facts into a bundle? We study the limits of bundling capacity with a 50-item questionnaire.
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.
An HDC experiment that separates stored examples from temporary class summaries, and compares rebuilding with caching.
Explore how HDC combines medical imaging and clinical language to classify retinal disease and support review of AI predictions.
Why shared bipolar binding preserves a ranking, how weighted similarity can change it, and what remains to be tested for useful retrieval.
How a compact abstraction can use thousands of coordinates, and what the extra width buys an HDC system.
Learn how to encode node properties and edge direction with HDC, compose a partial query, and resolve similarity matches back to exact graph records.
A delayed sales order shows how searching connected patterns could help teams find useful past cases, then check the facts in a graph.
Contact
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.
We usually reply within two business days.