Daily Arxiv

This page organizes papers related to artificial intelligence published around the world.
This page is summarized using Google Gemini and is operated on a non-profit basis.
The copyright of the paper belongs to the author and the relevant institution. When sharing, simply cite the source.

Panorama: Fast-Track Nearest Neighbors

Created by
  • Haebom

Author

Vansh Ramani, Alexis Schlomer, Akash Nayar, Panagiotis Karras, Sayan Ranu, Jignesh M. Patel

PANORAMA: Solving the ANNS Verification Bottleneck Based on Data-Adaptive Learning

Outline

PANORAMA is a machine learning-based approach proposed to address the validation bottleneck of Approximate Nearest-Neighbor Search (ANNS), which efficiently finds data close to a given query in high-dimensional spaces. It facilitates cumulative improvement of the distance boundary by learning an orthogonal transformation through data-adaptive learning. This compresses more than 90% of the signal energy into the first dimension, enabling early candidate pruning through partial distance calculations. PANORAMA has been integrated into state-of-the-art ANNS methods such as IVFPQ/Flat, HNSW, MRPT, and Annoy, achieving speedups of 20-30x.

Takeaways, Limitations

Takeaways:
Addresses the distance calculation bottleneck that accounts for a significant portion of the query time in ANNS systems.
We present a novel approach to improve ANNS performance through data-adaptive learning.
It can be easily integrated into existing ANNS methods and does not require index modification.
We have shown 2-30x speedups across various datasets (CIFAR-10, GIST, OpenAI Ada 2, Large 3).
We achieved speedup without recall loss.
Limitations:
Limitations presented in this paper is not directly stated.
👍