Ascent Similarity Caching With Approximate Indexes

Abstract

Similarity search is a key operation in multimedia retrieval systems and recommender systems, and it will play an important role also for future machine learning and augmented reality applications. When these systems need to serve large objects with tight delay constraints, edge servers close to the end-user can operate as similarity caches to speed up the retrieval. In this paper we present A\c\{C\}AI, a new similarity caching policy which improves on the state of the art by using (i) an (approximate) index for the whole catalog to decide which objects to serve locally and which to retrieve from the remote server, and (ii) a mirror ascent algorithm to update the set of local objects with strong guarantees even when the request process does not exhibit any statistical regularity.

Stats

• citations1
• S2 citations—
• github stars0
• HF likes0
• heat score2.26
• arxiv keysisalem2021ascent

Related papers

• Content Placement In Networks Of Similarity Caches (2021)8.09
• Computing The Hit Rate Of Similarity Caching (2022)2.26
• AMES: Asymmetric And Memory-efficient Similarity Estimation For Instance-level Retrieval (2024)9.70
• Qwlsh: Cache-conscious Indexing For Processing Similarity Search Query Workloads In High-dimensional Spaces (2019)4.52
• Efficient Bitmap-based Indexing And Retrieval Of Similarity Search Image Queries (2019)0.00
• Cluster-aware Similarity Diffusion For Instance Retrieval (2024)0.00
• Climber++: Pivot-based Approximate Similarity Search Over Big Data Series (2024)2.26
• Search Optimization With Query Likelihood Boosting And Two-level Approximate Search For Edge Devices (2023)0.00