Image de couverture de livre

Improved Space-Efficient Approximate Nearest Neighbor Search Using Function Inversion

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	McCauley, Samuel
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Space-Efficient Text Indexing with Mismatches using Function Inversion
par: Bibbens, Jackson, et autres
Publié: (2026)

Efficient Algorithms for Adversarially Robust Approximate Nearest Neighbor Search
par: Andoni, Alexandr, et autres
Publié: (2026)

Fast-Convergent Proximity Graphs for Approximate Nearest Neighbor Search
par: Li, Binhong, et autres
Publié: (2025)

UNIFY: Unified Index for Range Filtered Approximate Nearest Neighbors Search
par: Liang, Anqi, et autres
Publié: (2024)

HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search
par: Dehghankar, Mohsen, et autres
Publié: (2025)

BBC: Improving Large-k Approximate Nearest Neighbor Search with a Bucket-based Result Collector
par: Yin, Ziqi, et autres
Publié: (2026)

Root-to-Leaf Scheduling in Write-Optimized Trees
par: Chung, Christopher, et autres
Publié: (2024)

Incremental Topological Ordering and Cycle Detection with Predictions
par: McCauley, Samuel, et autres
Publié: (2024)

Incremental Approximate Single-Source Shortest Paths with Predictions
par: McCauley, Samuel, et autres
Publié: (2025)

Sparse Neighborhood Graph-Based Approximate Nearest Neighbor Search Revisited: Theoretical Analysis and Optimization
par: Ma, Xinran, et autres
Publié: (2025)

Approximate Nearest Neighbor Search with Window Filters
par: Engels, Joshua, et autres
Publié: (2024)

SPIDER: Improved Succinct Rank and Select Performance
par: Laws, Matthew D., et autres
Publié: (2024)

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness
par: Khanna, Sanjeev, et autres
Publié: (2025)

Quantum Sketches, Hashing, and Approximate Nearest Neighbors
par: Hashemian, Sajjad
Publié: (2026)

Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search
par: Gao, Jianyang, et autres
Publié: (2024)

On Efficient Approximate Aggregate Nearest Neighbor Queries over Learned Representations
par: Wang, Carrie, et autres
Publié: (2025)

Sublinear Sketches for Approximate Nearest Neighbor and Kernel Density Estimation
par: Danait, Ved, et autres
Publié: (2025)

SVD Provably Denoises Nearest Neighbor Data
par: Kannan, Ravindran, et autres
Publié: (2026)

Benchmarking Filtered Approximate Nearest Neighbor Search Algorithms on Transformer-based Embedding Vectors
par: Iff, Patrick, et autres
Publié: (2025)

Prune, Don't Rebuild: Efficiently Tuning $α$-Reachable Graphs for Nearest Neighbor Search
par: Zhang, Tian, et autres
Publié: (2026)

PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search
par: Yu, Shangdi, et autres
Publié: (2023)

Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search
par: Gottesbüren, Lars, et autres
Publié: (2024)

GPU-Native Approximate Nearest Neighbor Search with IVF-RaBitQ: Fast Index Build and Search
par: Shi, Jifan, et autres
Publié: (2026)

Efficient Data Shapley for Weighted Nearest Neighbor Algorithms
par: Wang, Jiachen T., et autres
Publié: (2024)

Efficient Sketching and Nearest Neighbor Search Algorithms for Sparse Vector Sets
par: Bruch, Sebastian, et autres
Publié: (2025)

Stable Matching with Predictions: Robustness and Efficiency under Pruned Preferences
par: McCauley, Samuel, et autres
Publié: (2026)

CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search
par: Zhang, Ziyu, et autres
Publié: (2025)

Discovering Data Structures: Nearest Neighbor Search and Beyond
par: Salemohamed, Omar, et autres
Publié: (2024)

Graph-Based Nearest-Neighbor Search without the Spread
par: Giliberti, Jeff, et autres
Publié: (2026)

Fast Nearest Neighbor Search for $\ell_p$ Metrics
par: Krauthgamer, Robert, et autres
Publié: (2026)

Efficient Banzhaf-Based Data Valuation for $k$-Nearest Neighbors Classification
par: Zhang, Guangyi, et autres
Publié: (2026)

RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search
par: Gao, Jianyang, et autres
Publié: (2024)

Dimension-Accuracy Tradeoffs in Contrastive Embeddings for Triplets, Terminals & Top-k Nearest Neighbors
par: Chatziafratis, Vaggos, et autres
Publié: (2023)

Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search
par: Lu, Kejing, et autres
Publié: (2024)

A General Technique for Searching in Implicit Sets via Function Inversion
par: Aronov, Boris, et autres
Publié: (2023)

Incremental Planar Nearest Neighbor Queries with Optimal Query Time
par: Iacono, John, et autres
Publié: (2025)

Sublinear Data Structures for Nearest Neighbor in Ultra High Dimensions
par: Herold, Martin G., et autres
Publié: (2025)

iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search
par: Xu, Yuexuan, et autres
Publié: (2024)

Graph-based Nearest Neighbors with Dynamic Updates via Random Walks
par: Mishra, Nina, et autres
Publié: (2025)

Incremental Strongly Connected Components with Predictions
par: Deng, Ronald, et autres
Publié: (2026)