research(nightly): spectral-ivf — graph-Laplacian partitioned ANN#713
Draft
ruvnet wants to merge 1 commit into
Draft
research(nightly): spectral-ivf — graph-Laplacian partitioned ANN#713ruvnet wants to merge 1 commit into
ruvnet wants to merge 1 commit into
Conversation
Adds ruvector-spectral-ivf: graph-Laplacian (Fiedler vector) partitioned IVF as an alternative to k-means partitioning. Recursive bisection at the mincut relaxation groups semantic neighbours into the same partition, achieving 1.000 recall@10 vs 0.801 for k-means at equal memory and nprobe budget. Co-Authored-By: claude-flow <ruv@ruv.net> Claude-Session: https://claude.ai/code/session_01KEdvB9eGLCFC2MVDtXQh8h
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Summary
Adds nightly RuVector research for Spectral IVF (2026-07-20): graph-Laplacian partitioned approximate nearest-neighbour search using the Fiedler vector as a continuous relaxation of the minimum balanced graph cut.
crates/ruvector-spectral-ivf— pure Rust, zero unsafe, zero external deps, WASM-compatibledocs/adr/ADR-272-spectral-ivf.mddocs/research/nightly/2026-07-20-spectral-ivf/README.mddocs/research/nightly/2026-07-20-spectral-ivf/gist.mdWhat this implements
Three IVF variants under a shared
AnnIndextrait:n=800, dim=64, 8 partitions, nprobe=4, 200 queries. All numbers from
cargo run --release -p ruvector-spectral-ivf --bin benchmark.Key finding: Spectral IVF achieves +20 percentage points better recall than k-means at identical memory cost and equal nprobe, by drawing partition boundaries along graph mincuts rather than Euclidean Voronoi cells.
Ecosystem connections
ruvector-mincut: Fiedler vector = mincut relaxation (Cheeger inequality)ruvector-coherence: coherence-weighted edges inCoherenceSpectralIvfruvector-graph: kNN graph is a subgraph of the RuVector graph storeruvector-diskann: partitions map to SSD pagesruvector-spann: complementary (SPANN spills; Spectral avoids wrong assignments at construction)ruvector-capgated: per-partition capability gatesTest status
Acceptance
Research doc
docs/research/nightly/2026-07-20-spectral-ivf/README.mdADR
docs/adr/ADR-272-spectral-ivf.mdCrate
crates/ruvector-spectral-ivfBenchmark command
Generated by Claude Code