A Bi-metric Framework for Fast Similarity Search

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Xu, Haike, Silwal, Sandeep, Indyk, Piotr
Format:	Preprint
Published:	2024
Subjects:	Information Retrieval Data Structures and Algorithms Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Statistical-Computational Trade-offs for Density Estimation
by: Aamand, Anders, et al.
Published: (2024)

Optimal Algorithms for Augmented Testing of Discrete Distributions
by: Aliakbarpour, Maryam, et al.
Published: (2024)

REWA: A General Theory of Witness-Based Similarity
by: Phadke, Nikit
Published: (2025)

The Information Theory of Similarity
by: Phadke, Nikit
Published: (2025)

Retrieval with Learned Similarities
by: Ding, Bailu, et al.
Published: (2024)

Approximate Nearest Neighbor Search with Window Filters
by: Engels, Joshua, et al.
Published: (2024)

Graph-Based Algorithms for Diverse Similarity Search
by: Anand, Piyush, et al.
Published: (2025)

Efficient Sketching and Nearest Neighbor Search Algorithms for Sparse Vector Sets
by: Bruch, Sebastian, et al.
Published: (2025)

Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search
by: Al-Jazzazi, Yousef, et al.
Published: (2025)

Constant-Factor Approximation for the Uniform Decision Tree
by: Szyfelbein, Michał
Published: (2026)

On the LSH Distortion of Ulam and Cayley Similarities
by: Chierichetti, Flavio, et al.
Published: (2026)

Welfarist Formulations for Diverse Similarity Search
by: Barman, Siddharth, et al.
Published: (2026)

GPU-Native Approximate Nearest Neighbor Search with IVF-RaBitQ: Fast Index Build and Search
by: Shi, Jifan, et al.
Published: (2026)

Efficient Top-k s-Biplexes Search over Large Bipartite Graphs
by: Xu, Zhenxiang, et al.
Published: (2024)

jXBW: Fast Substructure Search for Large-Scale JSONL Datasets with LLM Applications
by: Tabei, Yasuo
Published: (2025)

Improved Algorithms for Kernel Matrix-Vector Multiplication Under Sparsity Assumptions
by: Indyk, Piotr, et al.
Published: (2025)

Model-Free Counterfactual Subset Selection at Scale
by: Nguyen, Minh Hieu, et al.
Published: (2025)

Fast and exact fixed-radius neighbor search based on sorting
by: Chen, Xinye, et al.
Published: (2022)

Efficiently Computing Similarities to Private Datasets
by: Backurs, Arturs, et al.
Published: (2024)

Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search
by: Gottesbüren, Lars, et al.
Published: (2024)

Average Case Graph Searching in Non-Uniform Cost Models
by: Szyfelbein, Michał
Published: (2026)

Prune, Don't Rebuild: Efficiently Tuning $α$-Reachable Graphs for Nearest Neighbor Search
by: Zhang, Tian, et al.
Published: (2026)

Beyond Worst-Case Dimensionality Reduction for Sparse Vectors
by: Silwal, Sandeep, et al.
Published: (2025)

Provable Quantization with Randomized Hadamard Transform
by: Feng, Ying, et al.
Published: (2026)

Minimum Weighted Feedback Arc Sets for Ranking from Pairwise Comparisons
by: Vahidi, Soroush, et al.
Published: (2024)

Exploration Space Theory: Formal Foundations for Prerequisite-Aware Location-Based Recommendation
by: Sadallah, Madjid
Published: (2026)

iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search
by: Xu, Yuexuan, et al.
Published: (2024)

Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search
by: Gao, Jianyang, et al.
Published: (2024)

Linked Array Tree: A Constant-Time Search Structure for Big Data
by: Liu, Songpeng
Published: (2025)

How fast can you find a good hypothesis?
by: Aamand, Anders, et al.
Published: (2025)

Diversity-Aware $k$-Maximum Inner Product Search Revisited
by: Huang, Qiang, et al.
Published: (2024)

Autumn: A Scalable Read Optimized LSM-tree based Key-Value Stores with Fast Point and Range Read Speed
by: Zhao, Fuheng, et al.
Published: (2023)

Benchmarking Filtered Approximate Nearest Neighbor Search Algorithms on Transformer-based Embedding Vectors
by: Iff, Patrick, et al.
Published: (2025)

RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search
by: Gao, Jianyang, et al.
Published: (2024)

Hierarchical Locality Sensitive Hashing for Structured Data: A Survey
by: Wu, Wei, et al.
Published: (2022)

Bridging Classical and Quantum String Matching: A Computational Reformulation of Bit-Parallelism
by: Faro, Simone, et al.
Published: (2025)

Dimension-Accuracy Tradeoffs in Contrastive Embeddings for Triplets, Terminals & Top-k Nearest Neighbors
by: Chatziafratis, Vaggos, et al.
Published: (2023)

On the Structure of Replicable Hypothesis Testers
by: Aamand, Anders, et al.
Published: (2025)

Improved Approximations for Hard Graph Problems using Predictions
by: Aamand, Anders, et al.
Published: (2025)

Learning-Augmented Frequent Directions
by: Aamand, Anders, et al.
Published: (2025)