Name
Abstract | ||
|---|---|---|
A similarity cache can reply to a query for an object with similar objects stored locally. In some applications of similarity caches, queries and objects are naturally represented as points in a continuous space. Examples include 360 degrees videos where user's head orientation-expressed in spherical coordinates- determines what part of the video needs to be retrieved, and recommendation systems where the objects are embedded in a finite-dimensional space with a distance metric to capture content dissimilarity. Existing similarity caching policies are simple modifications of classic policies like LRU, LFU, and qLRU and ignore the continuous nature of the space where objects are embedded. In this paper, we propose GRADES, a new similarity caching policy that uses gradient descent to navigate the continuous space and find the optimal objects to store in the cache. We provide theoretical convergence guarantees and show GRADES increases the similarity of the objects served by the cache in both applications mentioned above. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1109/INFOCOM42981.2021.9488757 | IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2021) |
DocType | ISSN | Citations |
Conference | 0743-166X | 0 |
PageRank | References | Authors |
0.34 | 15 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Anirudh Sabnis | 1 | 0 | 0.34 |
| Tareq Si Salem | 2 | 0 | 0.34 |
| Giovanni Neglia | 3 | 781 | 63.67 |
| M. Garetto | 4 | 90 | 8.77 |
| E. Leonardi | 5 | 1830 | 146.87 |
| Ramesh K. Sitaraman | 6 | 1928 | 141.68 |