~/talk

Spectral Approaches to Nearest Neighbor Search

links:none on file
slides:none on file

Proposes reducing approximate nearest neighbor to a spectral graph problem, building a sparsified neighborhood graph and embedding via Laplacian eigenmaps so most k‑nearest relations remain (≈95%) after compression by about 10×. Implements a data structure that combines spectral sparsifiers, Laplacian eigenmaps and LSH, and evaluates on image and text collections, reporting roughly 5–10× query speedup with about 50% memory reduction compared to baseline ANN.

AI-written summary · about

  1. 0:00Intro
  2. 0:45Nearest Neighbor Search (NNS)
  3. 1:08Motivation
  4. 3:18Curse of dimensionality
  5. 4:14Approximate NNS
  6. 16:37Practice vs Theory Data-aware projections often outperform (vanilla) random-projection methods
  7. 19:43Model properties
  8. 24:32Tool: PCA Principal Component Analysis like SVD Top PCA direction direction maximizing variance of the data
  9. 25:01Naive attempt via PCA Use PCA to find the signal subspace U?
  10. 27:291st Algorithm: intuition
  11. 30:51Analysis of PCA
  12. 32:51Closeness of subspaces ?
  13. 38:19Additional issue: Conditioning After an iteration, the noise is not random anymore!
  14. 40:06Performance of Iterative PCA
  15. 42:342 algorithmic modifications
  16. 44:35Post-perspective
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.