Can a compiler spend HDC's accuracy budget? Reviewing ApproxHDC
How ApproxHDC searches application, compiler, and simulated-hardware choices to trade HDC task quality for speed and energy efficiency, and what the reported evidence establishes.
Research
R&D is a strong focus of our work at HDC Labs. We examine research across HDC, graph intelligence and deep learning, develop our own perspective, and explore how those ideas translate into building practical systems.
Showing 6–9 of 9 posts
How ApproxHDC searches application, compiler, and simulated-hardware choices to trade HDC task quality for speed and energy efficiency, and what the reported evidence establishes.
How learnable HDC encoders can adapt similarity geometry to modeled compute-in-memory nonlinearities, and what the current evidence establishes.
A close look at what GraphHD and GraphHD-Order preserve, what the reported results establish, and what the released implementation leaves unresolved.
How the problem of representing structured knowledge in distributed systems gave rise to the family now known as HDC and VSA.
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.