Efficient Algorithms for Adversarially Robust Approximate Nearest Neighbor Search

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Andoni, Alexandr, Haris, Themistoklis, Kelman, Esty, Onak, Krzysztof
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Compression Barriers for Autoregressive Transformers
di: Haris, Themistoklis, et al.
Pubblicazione: (2025)

Online versus Offline Adversaries in Property Testing
di: Kelman, Esty, et al.
Pubblicazione: (2024)

Optimal Testing of Reed-Muller Codes with an Online Adversary
di: Kelman, Esty, et al.
Pubblicazione: (2026)

Robust Streaming Against Low-Memory Adversaries
di: Ben-Eliezer, Omri, et al.
Pubblicazione: (2025)

Improved Space-Efficient Approximate Nearest Neighbor Search Using Function Inversion
di: McCauley, Samuel
Pubblicazione: (2024)

Fast-Convergent Proximity Graphs for Approximate Nearest Neighbor Search
di: Li, Binhong, et al.
Pubblicazione: (2025)

Homomorphism Testing with Resilience to Online Manipulations
di: Kelman, Esty, et al.
Pubblicazione: (2025)

On Optimal Testing of Linearity
di: Arora, Vipul, et al.
Pubblicazione: (2024)

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness
di: Khanna, Sanjeev, et al.
Pubblicazione: (2025)

Outlier Robust Multivariate Polynomial Regression
di: Arora, Vipul, et al.
Pubblicazione: (2024)

Dynamic PageRank: Algorithms and Lower Bounds
di: Jayaram, Rajesh, et al.
Pubblicazione: (2024)

UNIFY: Unified Index for Range Filtered Approximate Nearest Neighbors Search
di: Liang, Anqi, et al.
Pubblicazione: (2024)

HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search
di: Dehghankar, Mohsen, et al.
Pubblicazione: (2025)

$k$NN Attention Demystified: A Theoretical Exploration for Scalable Transformers
di: Haris, Themistoklis
Pubblicazione: (2024)

Faster Algorithms for Average-Case Orthogonal Vectors and Closest Pair Problems
di: Alman, Josh, et al.
Pubblicazione: (2024)

Sparse Neighborhood Graph-Based Approximate Nearest Neighbor Search Revisited: Theoretical Analysis and Optimization
di: Ma, Xinran, et al.
Pubblicazione: (2025)

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

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

Efficient Data Shapley for Weighted Nearest Neighbor Algorithms
di: Wang, Jiachen T., et al.
Pubblicazione: (2024)

Adversarially Robust Approximate Furthest Neighbor
di: Banihashem, Kiarash, et al.
Pubblicazione: (2026)

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

Quantum Sketches, Hashing, and Approximate Nearest Neighbors
di: Hashemian, Sajjad
Pubblicazione: (2026)

BBC: Improving Large-k Approximate Nearest Neighbor Search with a Bucket-based Result Collector
di: Yin, Ziqi, et al.
Pubblicazione: (2026)

On Efficient Approximate Aggregate Nearest Neighbor Queries over Learned Representations
di: Wang, Carrie, et al.
Pubblicazione: (2025)

A Framework for Building Data Structures from Communication Protocols
di: Andoni, Alexandr, et al.
Pubblicazione: (2025)

On Solving Linear Systems in Sublinear Time
di: Andoni, Alexandr, et al.
Pubblicazione: (2018)

Sublinear Sketches for Approximate Nearest Neighbor and Kernel Density Estimation
di: Danait, Ved, et al.
Pubblicazione: (2025)

SVD Provably Denoises Nearest Neighbor Data
di: Kannan, Ravindran, et al.
Pubblicazione: (2026)

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

PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search
di: Yu, Shangdi, et al.
Pubblicazione: (2023)

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

Estimating Hitting Times Locally At Scale
di: Haris, Themistoklis, et al.
Pubblicazione: (2025)

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

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

Fast-MWEM: Private Data Release in Sublinear Time
di: Haris, Themistoklis, et al.
Pubblicazione: (2026)

CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search
di: Zhang, Ziyu, et al.
Pubblicazione: (2025)

Graph-Based Nearest-Neighbor Search without the Spread
di: Giliberti, Jeff, et al.
Pubblicazione: (2026)

Fast Nearest Neighbor Search for $\ell_p$ Metrics
di: Krauthgamer, Robert, et al.
Pubblicazione: (2026)

Discovering Data Structures: Nearest Neighbor Search and Beyond
di: Salemohamed, Omar, et al.
Pubblicazione: (2024)

Efficient Banzhaf-Based Data Valuation for $k$-Nearest Neighbors Classification
di: Zhang, Guangyi, et al.
Pubblicazione: (2026)