{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T03:53:30Z","timestamp":1781063610110,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":79,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,11,30]],"date-time":"2022-11-30T00:00:00Z","timestamp":1669766400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CNS-1814322, CNS-1836772, CNS-1901103, CCF-2123987, CNS-2106771"],"award-info":[{"award-number":["CNS-1814322, CNS-1836772, CNS-1901103, CCF-2123987, CNS-2106771"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,11,30]]},"DOI":"10.1145\/3555050.3569134","type":"proceedings-article","created":{"date-parts":[[2022,11,30]],"date-time":"2022-11-30T22:24:56Z","timestamp":1669847096000},"page":"72-90","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Raven"],"prefix":"10.1145","author":[{"given":"Xinyue","family":"Hu","sequence":"first","affiliation":[{"name":"University of Minnesota - Twin Cities"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eman","family":"Ramadan","sequence":"additional","affiliation":[{"name":"University of Minnesota - Twin Cities"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei","family":"Ye","sequence":"additional","affiliation":[{"name":"University of Minnesota - Twin Cities"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Feng","family":"Tian","sequence":"additional","affiliation":[{"name":"University of Minnesota - Twin Cities"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhi-Li","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Minnesota - Twin Cities"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,11,30]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2011.07.015"},{"key":"e_1_3_2_1_2_1","first-page":"395","article-title":"System and method for adaptive database caching","volume":"7","author":"Altinel Mehmet","year":"2008","unstructured":"Mehmet Altinel , Christof Bornhoevd , Chandrasekaran Mohan , Mir Hamid Pirahesh , Berthold Reinwald , and Saileshwar Krishnamurthy . 2008 . System and method for adaptive database caching . US Patent 7 , 395 ,258. Mehmet Altinel, Christof Bornhoevd, Chandrasekaran Mohan, Mir Hamid Pirahesh, Berthold Reinwald, and Saileshwar Krishnamurthy. 2008. System and method for adaptive database caching. US Patent 7,395,258.","journal-title":"US Patent"},{"key":"e_1_3_2_1_3_1","volume-title":"International Conference on Machine Learning. PMLR, 345--355","author":"Antoniadis Antonios","year":"2020","unstructured":"Antonios Antoniadis , Christian Coester , Marek Elias , Adam Polak , and Bertrand Simon . 2020 . Online metric algorithms with untrusted predictions . In International Conference on Machine Learning. PMLR, 345--355 . Antonios Antoniadis, Christian Coester, Marek Elias, Adam Polak, and Bertrand Simon. 2020. Online metric algorithms with untrusted predictions. In International Conference on Machine Learning. PMLR, 345--355."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/346000.346003"},{"key":"e_1_3_2_1_5_1","volume-title":"CAR: Clock with Adaptive Replacement. In 3rd USENIX Conference on File and Storage Technologies (FAST 04)","author":"Bansal Sorav","unstructured":"Sorav Bansal and Dharmendra S. Modha . 2004 . CAR: Clock with Adaptive Replacement. In 3rd USENIX Conference on File and Storage Technologies (FAST 04) . USENIX Association, San Francisco, CA. https:\/\/www.usenix.org\/conference\/fast-04\/car-clock-adaptive-replacement Sorav Bansal and Dharmendra S. Modha. 2004. CAR: Clock with Adaptive Replacement. In 3rd USENIX Conference on File and Storage Technologies (FAST 04). USENIX Association, San Francisco, CA. https:\/\/www.usenix.org\/conference\/fast-04\/car-clock-adaptive-replacement"},{"key":"e_1_3_2_1_6_1","first-page":"187","article-title":"CAR: Clock with Adaptive Replacement","volume":"4","author":"Bansal Sorav","year":"2004","unstructured":"Sorav Bansal and Dharmendra S Modha . 2004 . CAR: Clock with Adaptive Replacement .. In FAST , Vol. 4. 187 -- 200 . Sorav Bansal and Dharmendra S Modha. 2004. CAR: Clock with Adaptive Replacement.. In FAST, Vol. 4. 187--200.","journal-title":"FAST"},{"key":"e_1_3_2_1_7_1","volume-title":"15th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 18). 389--403.","author":"Beckmann Nathan","unstructured":"Nathan Beckmann , Haoxian Chen , and Asaf Cidon . 2018. {LHD} : Improving cache hit rate by maximizing hit density . In 15th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 18). 389--403. Nathan Beckmann, Haoxian Chen, and Asaf Cidon. 2018. {LHD}: Improving cache hit rate by maximizing hit density. In 15th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 18). 389--403."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.52.0078"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3286062.3286082"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3224427"},{"key":"e_1_3_2_1_11_1","volume-title":"Adaptsize: Orchestrating the hot object memory cache in a content delivery network. In 14th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 17). 483--498.","author":"Berger Daniel S","year":"2017","unstructured":"Daniel S Berger , Ramesh K Sitaraman , and Mor Harchol-Balter . 2017 . Adaptsize: Orchestrating the hot object memory cache in a content delivery network. In 14th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 17). 483--498. Daniel S Berger, Ramesh K Sitaraman, and Mor Harchol-Balter. 2017. Adaptsize: Orchestrating the hot object memory cache in a content delivery network. In 14th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 17). 483--498."},{"key":"e_1_3_2_1_12_1","unstructured":"Christopher M Bishop. 1994. Mixture density networks. (1994).  Christopher M Bishop. 1994. Mixture density networks. (1994)."},{"key":"e_1_3_2_1_13_1","unstructured":"Aaron Blankstein Siddhartha Sen and Michael J Freedman. 2017. Hyperbolic caching: Flexible caching for web applications. In 2017 {USENIX} Annual Technical Conference ({USENIX} {ATC} 17). 499--511.  Aaron Blankstein Siddhartha Sen and Michael J Freedman. 2017. Hyperbolic caching: Flexible caching for web applications. In 2017 { USENIX } Annual Technical Conference ( { USENIX } { ATC } 17). 499--511."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/3386691.3386712"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8057031"},{"key":"e_1_3_2_1_17_1","volume-title":"International Conference on Machine Learning. PMLR","author":"Ch\u0142\u0119dowski Jakub","year":"2021","unstructured":"Jakub Ch\u0142\u0119dowski , Adam Polak , Bartosz Szabucki , and Konrad Tomasz Zo\u0142na . 2021 . Robust learning-augmented caching: An experimental study . In International Conference on Machine Learning. PMLR , 1920--1930. Jakub Ch\u0142\u0119dowski, Adam Polak, Bartosz Szabucki, and Konrad Tomasz Zo\u0142na. 2021. Robust learning-augmented caching: An experimental study. In International Conference on Machine Learning. PMLR, 1920--1930."},{"key":"e_1_3_2_1_18_1","volume-title":"A recurrent latent variable model for sequential data. Advances in neural information processing systems 28","author":"Chung Junyoung","year":"2015","unstructured":"Junyoung Chung , Kyle Kastner , Laurent Dinh , Kratarth Goel , Aaron C Courville , and Yoshua Bengio . 2015. A recurrent latent variable model for sequential data. Advances in neural information processing systems 28 ( 2015 ). Junyoung Chung, Kyle Kastner, Laurent Dinh, Kratarth Goel, Aaron C Courville, and Yoshua Bengio. 2015. A recurrent latent variable model for sequential data. Advances in neural information processing systems 28 (2015)."},{"key":"e_1_3_2_1_19_1","volume-title":"2017 USENIX Annual Technical Conference (USENIX ATC 17)","author":"Cidon Asaf","year":"2017","unstructured":"Asaf Cidon , Daniel Rushton , Stephen M Rumble , and Ryan Stutsman . 2017 . Memshare: a dynamic multi-tenant key-value cache . In 2017 USENIX Annual Technical Conference (USENIX ATC 17) . 321--334. Asaf Cidon, Daniel Rushton, Stephen M Rumble, and Ryan Stutsman. 2017. Memshare: a dynamic multi-tenant key-value cache. In 2017 USENIX Annual Technical Conference (USENIX ATC 17). 321--334."},{"key":"e_1_3_2_1_20_1","unstructured":"CitiBike. 2022. Citi bike trip histories. https:\/\/ride.citibikenyc.com\/system-data  CitiBike. 2022. Citi bike trip histories. https:\/\/ride.citibikenyc.com\/system-data"},{"key":"e_1_3_2_1_21_1","volume-title":"Sample size A rough guide. Retreived from http:\/\/www.beaumontethics.ie\/docs\/application\/samplesizecalculation.pdf","author":"Conroy Ron\u00e1n","year":"2015","unstructured":"Ron\u00e1n Conroy . 2015. Sample size A rough guide. Retreived from http:\/\/www.beaumontethics.ie\/docs\/application\/samplesizecalculation.pdf ( 2015 ). Ron\u00e1n Conroy. 2015. Sample size A rough guide. Retreived from http:\/\/www.beaumontethics.ie\/docs\/application\/samplesizecalculation.pdf (2015)."},{"key":"e_1_3_2_1_22_1","unstructured":"Pytorch Contributors. 2022. Tensors and Dynamic neural networks in Python with strong GPU acceleration. https:\/\/github.com\/pytorch\/pytorch  Pytorch Contributors. 2022. Tensors and Dynamic neural networks in Python with strong GPU acceleration. https:\/\/github.com\/pytorch\/pytorch"},{"key":"e_1_3_2_1_23_1","volume-title":"Mlcache: A multi-armed bandit policy for an operating system page cache. Technical Report. Technical report","author":"Costa Renato","year":"2017","unstructured":"Renato Costa and Jose Pazos . 2017 . Mlcache: A multi-armed bandit policy for an operating system page cache. Technical Report. Technical report , University of British Columbia . Renato Costa and Jose Pazos. 2017. Mlcache: A multi-armed bandit policy for an operating system page cache. Technical Report. Technical report, University of British Columbia."},{"key":"e_1_3_2_1_24_1","first-page":"7805","article-title":"Modeling continuous stochastic processes with dynamic normalizing flows","volume":"33","author":"Deng Ruizhi","year":"2020","unstructured":"Ruizhi Deng , Bo Chang , Marcus A Brubaker , Greg Mori , and Andreas Lehrmann . 2020 . Modeling continuous stochastic processes with dynamic normalizing flows . Advances in Neural Information Processing Systems 33 (2020), 7805 -- 7815 . Ruizhi Deng, Bo Chang, Marcus A Brubaker, Greg Mori, and Andreas Lehrmann. 2020. Modeling continuous stochastic processes with dynamic normalizing flows. Advances in Neural Information Processing Systems 33 (2020), 7805--7815.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939875"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149371"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2038916.2038939"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(91)90041-V"},{"key":"e_1_3_2_1_29_1","volume-title":"Distributed caching with memcached. Linux journal 124","author":"Fitzpatrick Brad","year":"2004","unstructured":"Brad Fitzpatrick . 2004. Distributed caching with memcached. Linux journal 124 ( 2004 ). Brad Fitzpatrick. 2004. Distributed caching with memcached. Linux journal 124 (2004)."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1013203451"},{"key":"e_1_3_2_1_31_1","volume-title":"LAMA: Optimized Locality-aware Memory Allocation for Key-value Cache. In 2015 USENIX Annual Technical Conference (USENIX ATC 15)","author":"Hu Xiameng","year":"2015","unstructured":"Xiameng Hu , Xiaolin Wang , Yechen Li , Lan Zhou , Yingwei Luo , Chen Ding , Song Jiang , and Zhenlin Wang . 2015 . LAMA: Optimized Locality-aware Memory Allocation for Key-value Cache. In 2015 USENIX Annual Technical Conference (USENIX ATC 15) . USENIX Association, Santa Clara, CA, 57--69. https:\/\/www.usenix.org\/conference\/atc15\/technical-session\/presentation\/hu Xiameng Hu, Xiaolin Wang, Yechen Li, Lan Zhou, Yingwei Luo, Chen Ding, Song Jiang, and Zhenlin Wang. 2015. LAMA: Optimized Locality-aware Memory Allocation for Key-value Cache. In 2015 USENIX Annual Technical Conference (USENIX ATC 15). USENIX Association, Santa Clara, CA, 57--69. https:\/\/www.usenix.org\/conference\/atc15\/technical-session\/presentation\/hu"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522722"},{"key":"e_1_3_2_1_33_1","unstructured":"Amazon Inc. 2022. Amazon EC2 On-Demand Pricing. https:\/\/aws.amazon.com\/ec2\/pricing\/on-demand\/  Amazon Inc. 2022. Amazon EC2 On-Demand Pricing. https:\/\/aws.amazon.com\/ec2\/pricing\/on-demand\/"},{"key":"e_1_3_2_1_34_1","unstructured":"Amazon Inc. 2022. Amazon ElastiCache pricing. https:\/\/aws.amazon.com\/elasticache\/pricing\/  Amazon Inc. 2022. Amazon ElastiCache pricing. https:\/\/aws.amazon.com\/elasticache\/pricing\/"},{"key":"e_1_3_2_1_35_1","unstructured":"Amazon Inc. 2022. AWS Wavelength Pricing. https:\/\/aws.amazon.com\/wavelength\/pricing\/  Amazon Inc. 2022. AWS Wavelength Pricing. https:\/\/aws.amazon.com\/wavelength\/pricing\/"},{"key":"e_1_3_2_1_36_1","first-page":"1","article-title":"Sample size and its role in Central Limit Theorem (CLT)","volume":"4","author":"Islam Mohammad Rafiqul","year":"2018","unstructured":"Mohammad Rafiqul Islam . 2018 . Sample size and its role in Central Limit Theorem (CLT) . Computational and Applied Mathematics Journal 4 , 1 (2018), 1 -- 7 . Mohammad Rafiqul Islam. 2018. Sample size and its role in Central Limit Theorem (CLT). Computational and Applied Mathematics Journal 4, 1 (2018), 1--7.","journal-title":"Computational and Applied Mathematics Journal"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2016.17"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2016.17"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2018.00020"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2018.00020"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.3000415"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796299540"},{"key":"e_1_3_2_1_43_1","first-page":"139","article-title":"Cache replacement algorithms for the renewal arrival model","volume":"14","author":"Kylkoski K","year":"1998","unstructured":"K Kylkoski and J Virtamo . 1998 . Cache replacement algorithms for the renewal arrival model . In Fourteenth Nordic Teletraffic Seminar, NTS , Vol. 14. 139 -- 148 . K Kylkoski and J Virtamo. 1998. Cache replacement algorithms for the renewal arrival model. In Fourteenth Nordic Teletraffic Seminar, NTS, Vol. 14. 139--148.","journal-title":"Fourteenth Nordic Teletraffic Seminar, NTS"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3152434.3152435"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/301453.301487"},{"key":"e_1_3_2_1_46_1","volume-title":"Yookun Cho, and Chong Sang Kim.","author":"Lee Donghee","year":"2001","unstructured":"Donghee Lee , Jongmoo Choi , Jong-Hun Kim , Sam H Noh , Sang Lyul Min , Yookun Cho, and Chong Sang Kim. 2001 . LRFU : A spectrum of policies that subsumes the least recently used and least frequently used policies. IEEE transactions on Computers 50, 12 (2001), 1352--1361. Donghee Lee, Jongmoo Choi, Jong-Hun Kim, Sam H Noh, Sang Lyul Min, Yookun Cho, and Chong Sang Kim. 2001. LRFU: A spectrum of policies that subsumes the least recently used and least frequently used policies. IEEE transactions on Computers 50, 12 (2001), 1352--1361."},{"key":"e_1_3_2_1_47_1","volume-title":"When attention meets fast recurrence: Training language models with reduced compute. arXiv preprint arXiv:2102.12459","author":"Lei Tao","year":"2021","unstructured":"Tao Lei . 2021. When attention meets fast recurrence: Training language models with reduced compute. arXiv preprint arXiv:2102.12459 ( 2021 ). Tao Lei. 2021. When attention meets fast recurrence: Training language models with reduced compute. arXiv preprint arXiv:2102.12459 (2021)."},{"key":"e_1_3_2_1_48_1","volume-title":"Simple recurrent units for highly parallelizable recurrence. arXiv preprint arXiv:1709.02755","author":"Lei Tao","year":"2017","unstructured":"Tao Lei , Yu Zhang , Sida I Wang , Hui Dai , and Yoav Artzi . 2017. Simple recurrent units for highly parallelizable recurrence. arXiv preprint arXiv:1709.02755 ( 2017 ). Tao Lei, Yu Zhang, Sida I Wang, Hui Dai, and Yoav Artzi. 2017. Simple recurrent units for highly parallelizable recurrence. arXiv preprint arXiv:1709.02755 (2017)."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2016.2596042"},{"key":"e_1_3_2_1_50_1","volume-title":"International Conference on Machine Learning. PMLR, 6237--6247","author":"Liu Evan","year":"2020","unstructured":"Evan Liu , Milad Hashemi , Kevin Swersky , Parthasarathy Ranganathan , and Junwhan Ahn . 2020 . An imitation learning approach for cache replacement . In International Conference on Machine Learning. PMLR, 6237--6247 . Evan Liu, Milad Hashemi, Kevin Swersky, Parthasarathy Ranganathan, and Junwhan Ahn. 2020. An imitation learning approach for cache replacement. In International Conference on Machine Learning. PMLR, 6237--6247."},{"key":"e_1_3_2_1_51_1","unstructured":"Redis Ltd. 2021. Redis is an open source (BSD licensed) in-memory data structure store used as a database cache and message broker. https:\/\/redis.io\/  Redis Ltd. 2021. Redis is an open source (BSD licensed) in-memory data structure store used as a database cache and message broker. https:\/\/redis.io\/"},{"key":"e_1_3_2_1_52_1","volume-title":"Competitive Caching with Machine Learned Advice. In International Conference on Machine Learning. PMLR, 3296--3305","author":"Lykouris Thodoris","year":"2018","unstructured":"Thodoris Lykouris and Sergei Vassilvtiskii . 2018 . Competitive Caching with Machine Learned Advice. In International Conference on Machine Learning. PMLR, 3296--3305 . Thodoris Lykouris and Sergei Vassilvtiskii. 2018. Competitive Caching with Machine Learned Advice. In International Conference on Machine Learning. PMLR, 3296--3305."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2805789.2805800"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00731"},{"key":"e_1_3_2_1_55_1","first-page":"115","article-title":"ARC: A Self-Tuning, Low Overhead Replacement Cache","volume":"3","author":"Megiddo Nimrod","year":"2003","unstructured":"Nimrod Megiddo and Dharmendra S Modha . 2003 . ARC: A Self-Tuning, Low Overhead Replacement Cache .. In Fast , Vol. 3. 115 -- 130 . Nimrod Megiddo and Dharmendra S Modha. 2003. ARC: A Self-Tuning, Low Overhead Replacement Cache.. In Fast, Vol. 3. 115--130.","journal-title":"Fast"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/170036.170081"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/1176760.1176789"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737446"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.801414"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2007.14"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2007.25"},{"key":"e_1_3_2_1_62_1","volume-title":"Yee Whye Teh, and Raia Hadsell","author":"Rao Dushyant","year":"2019","unstructured":"Dushyant Rao , Francesco Visin , Andrei Rusu , Razvan Pascanu , Yee Whye Teh, and Raia Hadsell . 2019 . Continual unsupervised representation learning. Advances in Neural Information Processing Systems 32 (2019). Dushyant Rao, Francesco Visin, Andrei Rusu, Razvan Pascanu, Yee Whye Teh, and Raia Hadsell. 2019. Continual unsupervised representation learning. Advances in Neural Information Processing Systems 32 (2019)."},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.112"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2017.2787979"},{"key":"e_1_3_2_1_65_1","volume-title":"no 1","author":"Shah Ketan","year":"2010","unstructured":"Ketan Shah , Anirban Mitra , and Dhruv Matani . 2010. An O (1) algorithm for implementing the LFU cache eviction scheme. no 1 ( 2010 ), 1--8. Ketan Shah, Anirban Mitra, and Dhruv Matani. 2010. An O (1) algorithm for implementing the LFU cache eviction scheme. no 1 (2010), 1--8."},{"key":"e_1_3_2_1_66_1","volume-title":"Intensity-Free Learning of Temporal Point Processes. In International Conference on Learning Representations.","author":"Shchur Oleksandr","year":"2019","unstructured":"Oleksandr Shchur , Marin Bilo\u0161 , and Stephan G\u00fcnnemann . 2019 . Intensity-Free Learning of Temporal Point Processes. In International Conference on Learning Representations. Oleksandr Shchur, Marin Bilo\u0161, and Stephan G\u00fcnnemann. 2019. Intensity-Free Learning of Temporal Point Processes. In International Conference on Learning Representations."},{"key":"e_1_3_2_1_67_1","volume-title":"Jaehong Kim, and Jiwon Kim.","author":"Shin Hanul","year":"2017","unstructured":"Hanul Shin , Jung Kwon Lee , Jaehong Kim, and Jiwon Kim. 2017 . Continual learning with deep generative replay. Advances in neural information processing systems 30 (2017). Hanul Shin, Jung Kwon Lee, Jaehong Kim, and Jiwon Kim. 2017. Continual learning with deep generative replay. Advances in neural information processing systems 30 (2017)."},{"key":"e_1_3_2_1_68_1","volume-title":"Learning Relaxed Belady for Content Distribution Network Caching. In 17th USENIX Symposium on Networked Systems Design and Implementation (NSDI 20)","author":"Song Zhenyu","year":"2020","unstructured":"Zhenyu Song , Daniel S. Berger , Kai Li , and Wyatt Lloyd . 2020 . Learning Relaxed Belady for Content Distribution Network Caching. In 17th USENIX Symposium on Networked Systems Design and Implementation (NSDI 20) . USENIX Association, Santa Clara, CA, 529--544. Zhenyu Song, Daniel S. Berger, Kai Li, and Wyatt Lloyd. 2020. Learning Relaxed Belady for Content Distribution Network Caching. In 17th USENIX Symposium on Networked Systems Design and Implementation (NSDI 20). USENIX Association, Santa Clara, CA, 529--544."},{"key":"e_1_3_2_1_69_1","unstructured":"Linpeng Tang Qi Huang Amit Puntambekar Ymir Vigfusson Wyatt Lloyd and Kai Li. 2017. Popularity prediction of facebook videos for higher quality streaming. In 2017 {USENIX} Annual Technical Conference ({USENIX}{ATC} 17). 111--123.  Linpeng Tang Qi Huang Amit Puntambekar Ymir Vigfusson Wyatt Lloyd and Kai Li. 2017. Popularity prediction of facebook videos for higher quality streaming. In 2017 { USENIX } Annual Technical Conference ( { USENIX }{ ATC } 17). 111--123."},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/2541468.2541470"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2015.2458043"},{"key":"e_1_3_2_1_72_1","volume-title":"Driving Cache Replacement with ML-based LeCaR. In 10th USENIX Workshop on Hot Topics in Storage and File Systems (HotStorage 18)","author":"Vietri Giuseppe","year":"2018","unstructured":"Giuseppe Vietri , Liana V. Rodriguez , Wendy A. Martinez , Steven Lyons , Jason Liu , Raju Rangaswami , Ming Zhao , and Giri Narasimhan . 2018 . Driving Cache Replacement with ML-based LeCaR. In 10th USENIX Workshop on Hot Topics in Storage and File Systems (HotStorage 18) . USENIX Association, Boston, MA. https:\/\/www.usenix.org\/conference\/hotstorage18\/presentation\/vietri Giuseppe Vietri, Liana V. Rodriguez, Wendy A. Martinez, Steven Lyons, Jason Liu, Raju Rangaswami, Ming Zhao, and Giri Narasimhan. 2018. Driving Cache Replacement with ML-based LeCaR. In 10th USENIX Workshop on Hot Topics in Storage and File Systems (HotStorage 18). USENIX Association, Boston, MA. https:\/\/www.usenix.org\/conference\/hotstorage18\/presentation\/vietri"},{"key":"e_1_3_2_1_73_1","unstructured":"Webcachesim2. 2021. A simulator for CDN caching and web caching policies. https:\/\/github.com\/sunnyszy\/lrb  Webcachesim2. 2021. A simulator for CDN caching and web caching policies. https:\/\/github.com\/sunnyszy\/lrb"},{"key":"e_1_3_2_1_74_1","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM","author":"Wei Alexander","year":"2020","unstructured":"Alexander Wei . 2020. Better and Simpler Learning-Augmented Online Caching . In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2020 ). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik . Alexander Wei. 2020. Better and Simpler Learning-Augmented Online Caching. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2020). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_1_75_1","unstructured":"Wikitech. 2019. This dataset is a restricted public snapshot of the wmf.webrequest table intended for caching research. https:\/\/wikitech.wikimedia.org\/wiki\/Analytics\/Data_Lake\/Traffic\/Caching  Wikitech. 2019. This dataset is a restricted public snapshot of the wmf.webrequest table intended for caching research. https:\/\/wikitech.wikimedia.org\/wiki\/Analytics\/Data_Lake\/Traffic\/Caching"},{"key":"e_1_3_2_1_76_1","volume-title":"Meta learning with relational information for short sequences. Advances in neural information processing systems 32","author":"Xie Yujia","year":"2019","unstructured":"Yujia Xie , Haoming Jiang , Feng Liu , Tuo Zhao , and Hongyuan Zha . 2019. Meta learning with relational information for short sequences. Advances in neural information processing systems 32 ( 2019 ). Yujia Xie, Haoming Jiang, Feng Liu, Tuo Zhao, and Hongyuan Zha. 2019. Meta learning with relational information for short sequences. Advances in neural information processing systems 32 (2019)."},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485983.3494855"},{"key":"e_1_3_2_1_78_1","volume-title":"14th {USENIX} Symposium on Operating Systems Design and Implementation ({OSDI} 20). 191--208.","author":"Yang Juncheng","unstructured":"Juncheng Yang , Yao Yue , and KV Rashmi . 2020. A large scale analysis of hundreds of in-memory cache clusters at Twitter . In 14th {USENIX} Symposium on Operating Systems Design and Implementation ({OSDI} 20). 191--208. Juncheng Yang, Yao Yue, and KV Rashmi. 2020. A large scale analysis of hundreds of in-memory cache clusters at Twitter. In 14th {USENIX} Symposium on Operating Systems Design and Implementation ({OSDI} 20). 191--208."},{"key":"e_1_3_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2018.8362276"}],"event":{"name":"CoNEXT '22: The 18th International Conference on emerging Networking EXperiments and Technologies","location":"Roma Italy","acronym":"CoNEXT '22","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the 18th International Conference on emerging Networking EXperiments and Technologies"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3555050.3569134","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3555050.3569134","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3555050.3569134","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:46:50Z","timestamp":1750178810000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3555050.3569134"}},"subtitle":["belady-guided, predictive (deep) learning for in-memory and content caching"],"short-title":[],"issued":{"date-parts":[[2022,11,30]]},"references-count":79,"alternative-id":["10.1145\/3555050.3569134","10.1145\/3555050"],"URL":"https:\/\/doi.org\/10.1145\/3555050.3569134","relation":{},"subject":[],"published":{"date-parts":[[2022,11,30]]},"assertion":[{"value":"2022-11-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}