Ascent Similarity Caching with Approximate Indexes
Not on the map. Why?
Abstract (arXiv)
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 AcCAI, 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.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 27 of its 76 references that are in the map. First posted on arXiv 2 Jul 2021.
Builds on
27 of 76 references.
References · 27
- 2017Billion-scale similarity search with GPUscited by 2,497
- 2016Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphscited by 861
- 2019Introduction to Online Convex Optimizationcited by 803
- 2019Generalization through Memorization: Nearest Neighbor Language Modelscited by 800
- 2015Image-based Recommendations on Styles and Substitutescited by 706
- 2016CVXPY: A Python-Embedded Modeling Language for Convex Optimizationcited by 641
- 2014Convex Optimization: Algorithms and Complexitycited by 575
- 2019Edge Intelligence: Paving the Last Mile of Artificial Intelligence with Edge Computingcited by 228
- 2014Taming the Monster: A Fast and Simple Algorithm for Contextual Banditscited by 201
- 2016Clipper: A Low-Latency Online Prediction Serving Systemcited by 191
- 2018ANN-Benchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithmscited by 130
- 2018Online Continuous Submodular Maximizationcited by 35
15 more
- 2014An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimizationcited by 26
- 2019Learning to Cache With No Regretscited by 16
- 2021No-Regret Caching via Online Mirror Descentcited by 12
- 2021Online Caching with Optimal Switching Regretcited by 11
- 2016Adaptive Caching Networks with Optimality Guaranteescited by 8
- 2016Wireless Caching: Technical Misconceptions and Business Barrierscited by 7
- 2019Similarity Caching: Theory and Algorithmscited by 3
- 2021Towards Inference Delivery Networks: Distributing Machine Learning with Optimality Guaranteescited by 3
- 2017Femto-Caching with Soft Cache Hits: Improving Performance through Recommendation and Delivery of Related Contentcited by 2
- 2018Elastic Provisioning of Cloud Caches: a Cost-aware TTL Approachcited by 2
- 2015Geometric Approach to Subdifferential Calculuscited by 1
- 2018Worst-case Bounds and Optimized Cache on Mth Request Cache Insertion Policies under Elastic Conditionscited by 1
- 2019A Swiss Army Knife for Dynamic Caching in Small Cell Networkscited by 1
- 2020Adaptive Offline and Online Similarity-Based Cachingcited by 1
- 2021Content Placement in Networks of Similarity Cachescited by 1
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 1.
2 papers.
- 2023Online Submodular Maximization via Online Convex Optimizationcited by 6
- 2025Online Two-Stage Submodular Maximizationcited by 0
- 2025Online Two-Stage Submodular Maximization22 Oct 2025
- 2023Online Submodular Maximization via Online Convex Optimization8 Sep 2023