Hilbert Exclusion: Improved Metric Search Through Finite Isometric Embeddings

Abstract

Most research into similarity search in metric spaces relies upon the triangle inequality property. This property allows the space to be arranged according to relative distances to avoid searching some subspaces. We show that many common metric spaces, notably including those using Euclidean and Jensen-Shannon distances, also have a stronger property, sometimes called the four-point property: in essence, these spaces allow an isometric embedding of any four points in three-dimensional Euclidean space, as well as any three points in two-dimensional Euclidean space. In fact, we show that any space which is isometrically embeddable in Hilbert space has the stronger property. This property gives stronger geometric guarantees, and one in particular, which we name the Hilbert Exclusion property, allows any indexing mechanism which uses hyperplane partitioning to perform better. One outcome of this observation is that a number of state-of-the-art indexing mechanisms over high dimensional spac

Stats

• citations21
• S2 citations—
• github stars0
• HF likes0
• heat score10.07
• arxiv keyconnor2016hilbert

Related papers

• Indexing Metric Spaces For Exact Similarity Search (2020)10.85
• Infinity Search: Approximate Vector Search With Projections On Q-metric Spaces (2025)0.00
• Massively-parallel Similarity Join, Edge-isoperimetry, And Distance Correlations On The Hypercube (2016)2.26
• Accurate And Fast Retrieval For Complex Non-metric Data Via Neighborhood Graphs (2019)0.00
• Deep Metric Learning Using Similarities From Nonlinear Rank Approximations (2019)2.26
• Dimension-accuracy Tradeoffs In Contrastive Embeddings For Triplets, Terminals & Top-k Nearest Neighbors (2023)0.00
• Metric Learning In An RKHS (2025)0.00
• Towards Robust Trajectory Embedding For Similarity Computation: When Triangle Inequality Violations In Distance Metrics Matter (2025)0.00