Better vector search with graphs and spectral indexing
tuned.org.uk·21h·
Discuss: Hacker News

October 10, 2025

Road for `arrowspace` to scale: Condense, Project, and Sparsify

This release rethinks how `arrowspace` builds and queries graph structure from high‑dimensional embedding up to 10⁵ items and 10³ features.

The Laplacian computation now:- condenses data with clustering and density‑aware sampling,

  • projects dimensionality proportionally to the problem size (centroids) and keeps queries consistent with that projection, and
  • sparsifies the graph with a fast spectral method to preserve structure while slashing cost.

Read more →

October 6, 2025

[Three Improvements That Opens up to Graph-Based Spectral Analysis](https://www.tuned.org.uk…

Similar Posts

Loading similar posts...