{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:04:47Z","timestamp":1765544687060,"version":"3.41.0"},"reference-count":18,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T00:00:00Z","timestamp":1548374400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMETRICS Perform. Eval. Rev."],"published-print":{"date-parts":[[2019,1,25]]},"abstract":"<jats:p>We propose a caching policy that uses a feedforward neural network (FNN) to predict content popularity. Our scheme outperforms popular eviction policies like LRU or ARC, but also a new policy relying on the more complex recurrent neural networks. At the same time, replacing the FNN predictor with a naive linear estimator does not degrade caching performance significantly, questioning then the role of neural networks for these applications.<\/jats:p>","DOI":"10.1145\/3308897.3308958","type":"journal-article","created":{"date-parts":[[2019,1,28]],"date-time":"2019-01-28T14:01:39Z","timestamp":1548684099000},"page":"139-142","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":24,"title":["Feedforward Neural Networks for Caching"],"prefix":"10.1145","volume":"46","author":[{"given":"Vladyslav","family":"Fedchenko","sequence":"first","affiliation":[{"name":"Universit\u00e9 C\u00f4te d'Azur, Sophia Antipolis, France"}]},{"given":"Giovanni","family":"Neglia","sequence":"additional","affiliation":[{"name":"Universit\u00e9 C\u00f4te d'Azur, Sophia Antipolis, France"}]},{"given":"Bruno","family":"Ribeiro","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette , IN, USA"}]}],"member":"320","published-online":{"date-parts":[[2019,1,25]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/JCN.2015.000102"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/2220253.2220255"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1364-6613(99)01294-2"},{"key":"e_1_2_1_4_1","volume-title":"Proc. of ICML","author":"Hashemi M.","year":"2018","unstructured":"M. Hashemi , K. Swersky , Learning memory access patterns . In Proc. of ICML , 2018 . M. Hashemi, K. Swersky, et al. Learning memory access patterns. In Proc. of ICML, 2018."},{"key":"e_1_2_1_5_1","volume-title":"Deep reinforcement learning that matters. ArXiv e-prints","author":"Henderson P.","year":"2017","unstructured":"P. Henderson , R. Islam , Deep reinforcement learning that matters. ArXiv e-prints , 2017 . P. Henderson, R. Islam, et al. Deep reinforcement learning that matters. ArXiv e-prints, 2017."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1611835114"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCRE.2017.7935070"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2001.970573"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524381"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2004.1297303"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3229543.3229555"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149001"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/IWQoS.2018.8624176"},{"key":"e_1_2_1_14_1","volume-title":"Multi-agent learning for cooperative large-scale caching networks. ArXiv e-prints","author":"Rezaei E.","year":"2018","unstructured":"E. Rezaei , H. E. Manoochehri , and B. H. Khalaj . Multi-agent learning for cooperative large-scale caching networks. ArXiv e-prints , 2018 . E. Rezaei, H. E. Manoochehri, and B. H. Khalaj. Multi-agent learning for cooperative large-scale caching networks. ArXiv e-prints, 2018."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2018.2832075"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132402.3132405"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCW.2018.8403712"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2018.8362276"}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3308897.3308958","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3308897.3308958","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:58:03Z","timestamp":1750208283000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3308897.3308958"}},"subtitle":["n Enough or Too Much?"],"short-title":[],"issued":{"date-parts":[[2019,1,25]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,1,25]]}},"alternative-id":["10.1145\/3308897.3308958"],"URL":"https:\/\/doi.org\/10.1145\/3308897.3308958","relation":{},"ISSN":["0163-5999"],"issn-type":[{"type":"print","value":"0163-5999"}],"subject":[],"published":{"date-parts":[[2019,1,25]]},"assertion":[{"value":"2019-01-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}