{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:09:42Z","timestamp":1757617782288,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","funder":[{"name":"Defense Advanced Research Projects Agency (DARPA)","award":["HR001120C0088"],"award-info":[{"award-number":["HR001120C0088"]}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["2224319"],"award-info":[{"award-number":["2224319"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"REAL@USC-Meta center","award":["gift"],"award-info":[{"award-number":["gift"]}]},{"name":"Broadcom","award":["gift"],"award-info":[{"award-number":["gift"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,9,22]]},"DOI":"10.1145\/3705328.3748078","type":"proceedings-article","created":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T10:46:13Z","timestamp":1757155573000},"page":"217-225","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["LEAF: Lightweight, Efficient, Adaptive and Flexible Embedding for Large-Scale Recommendation Models"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-8235-9303","authenticated-orcid":false,"given":"Chaoyi","family":"Jiang","sequence":"first","affiliation":[{"name":"University of Southern California, Los Angeles, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-7619-874X","authenticated-orcid":false,"given":"Abdulla","family":"Alshabanah","sequence":"additional","affiliation":[{"name":"University of Southern California, Los Angeles, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4633-6867","authenticated-orcid":false,"given":"Murali","family":"Annavaram","sequence":"additional","affiliation":[{"name":"University of Southern California, Los Angeles, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,9,7]]},"reference":[{"volume-title":"Kdd cup 2012, track 2","year":"2012","key":"e_1_3_3_1_2_2","unstructured":"Aden and Yi Wang. 2012. Kdd cup 2012, track 2. https:\/\/kaggle.com\/competitions\/ kddcup2012-track2, 2012"},{"key":"e_1_3_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/3131365.3131407"},{"key":"e_1_3_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/3460231.3474246"},{"key":"e_1_3_3_1_5_2","doi-asserted-by":"crossref","unstructured":"Radu Berinde Piotr Indyk Graham Cormode and Martin\u00a0J Strauss. 2010. Space-optimal heavy hitters with strong error bounds. ACM Transactions on Database Systems (TODS) 35 4 (2010) 1\u201328.","DOI":"10.1145\/1862919.1862923"},{"key":"e_1_3_3_1_6_2","doi-asserted-by":"crossref","unstructured":"Arnab Bhattacharyya Palash Dey and David\u00a0P Woodruff. 2018. An optimal algorithm for l-heavy hitters in insertion streams and related problems. ACM Transactions on Algorithms (TALG) 15 1 (2018) 1\u201327.","DOI":"10.1145\/3264427"},{"key":"e_1_3_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897558"},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.5555\/646255.684566"},{"key":"e_1_3_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/2988450.2988454"},{"key":"e_1_3_3_1_10_2","unstructured":"Weiyu Cheng Yanyan Shen and Linpeng Huang. 2020. Differentiable neural input search for recommender systems. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2006.04466 (2020)."},{"key":"e_1_3_3_1_11_2","unstructured":"Benjamin Coleman Wang-Cheng Kang Matthew Fahrbach Ruoxi Wang Lichan Hong Ed Chi and Derek Cheng. 2023. Unified Embedding: Battle-tested feature representations for web-scale ML systems. Advances in Neural Information Processing Systems 36 (2023) 56234\u201356255."},{"key":"e_1_3_3_1_12_2","doi-asserted-by":"crossref","unstructured":"Graham Cormode and Marios Hadjieleftheriou. 2010. Methods for finding frequent items in data streams. The VLDB Journal 19 (2010) 3\u201320.","DOI":"10.1007\/s00778-009-0172-z"},{"key":"e_1_3_3_1_13_2","doi-asserted-by":"crossref","unstructured":"Graham Cormode and Shan Muthukrishnan. 2005. An improved data stream summary: the count-min sketch and its applications. Journal of Algorithms 55 1 (2005) 58\u201375.","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"e_1_3_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/2959100.2959190"},{"key":"e_1_3_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517710"},{"key":"e_1_3_3_1_16_2","unstructured":"Huifeng Guo Ruiming Tang Yunming Ye Zhenguo Li and Xiuqiang He. 2017. DeepFM: a factorization-machine based neural network for CTR prediction. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/1703.04247 (2017)."},{"key":"e_1_3_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA47549.2020.00047"},{"key":"e_1_3_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403288"},{"key":"e_1_3_3_1_19_2","volume-title":"Download terabyte click logs.","author":"Labs Criteo","year":"2013","unstructured":"Criteo Labs. 2013. Download terabyte click logs.https:\/\/labs.criteo.com\/2013\/12\/download-terabyte-click-logs\/"},{"key":"e_1_3_3_1_20_2","volume-title":"Kaggle display advertising challenge dataset.","author":"Labs Criteo","year":"2014","unstructured":"Criteo Labs. 2014. Kaggle display advertising challenge dataset.https:\/\/labs.criteo. com\/2014\/02\/kaggle-display-advertising-challenge-dataset\/, 2014"},{"key":"e_1_3_3_1_21_2","first-page":"817","volume-title":"17th USENIX Symposium on Operating Systems Design and Implementation (OSDI 23)","author":"Lai Fan","year":"2023","unstructured":"Fan Lai, Wei Zhang, Rui Liu, William Tsai, Xiaohan Wei, Yuxi Hu, Sabin Devkota, Jianyu Huang, Jongsoo Park, Xing Liu, et\u00a0al. 2023. { AdaEmbed} : Adaptive Embedding for { Large-Scale} Recommendation Models. In 17th USENIX Symposium on Operating Systems Design and Implementation (OSDI 23). 817\u2013831."},{"key":"e_1_3_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i4.25564"},{"key":"e_1_3_3_1_23_2","unstructured":"Maxim Naumov Dheevatsa Mudigere Hao-Jun\u00a0Michael Shi Jianyu Huang Narayanan Sundaraman Jongsoo Park Xiaodong Wang Udit Gupta Carole-Jean Wu Alisson\u00a0G Azzolini et\u00a0al. 2019. Deep learning recommendation model for personalization and recommendation systems. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/1906.00091 (2019)."},{"key":"e_1_3_3_1_24_2","unstructured":"NVIDIA Corporation. 2024. NVIDIA Nsight Compute. https:\/\/developer.nvidia.com\/nsight-compute. Accessed: 2024-10-22."},{"key":"e_1_3_3_1_25_2","volume-title":"Mlperf benchmark","author":"platform NVIDIA\u00a0AI","year":"2020","unstructured":"NVIDIA\u00a0AI platform. 2020. Mlperf benchmark. https:\/\/mlperf.org, 2020"},{"key":"e_1_3_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/3503222.3507777"},{"key":"e_1_3_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403059"},{"key":"e_1_3_3_1_28_2","unstructured":"Dan Tito\u00a0Svenstrup Jonas Hansen and Ole Winther. 2017. Hash embeddings for efficient word representations. Advances in neural information processing systems 30 (2017)."},{"key":"e_1_3_3_1_29_2","unstructured":"Henry Tsang and Thomas Ahle. 2023. Clustering the sketch: dynamic compression for embedding tables. Advances in Neural Information Processing Systems 36 (2023) 72155\u201372180."},{"key":"e_1_3_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/3124749.3124754"},{"key":"e_1_3_3_1_31_2","volume-title":"Avazu click-through rate prediction","author":"Wang Steve","year":"2014","unstructured":"Steve Wang and Will Cukierski. 2014. Avazu click-through rate prediction. https:\/\/kaggle.com\/competitions\/avazu-ctr-prediction, 2014"},{"key":"e_1_3_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553516"},{"key":"e_1_3_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482065"},{"key":"e_1_3_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/3383313.3412227"},{"key":"e_1_3_3_1_35_2","doi-asserted-by":"crossref","unstructured":"Hailin Zhang Zirui Liu Boxuan Chen Yikai Zhao Tong Zhao Tong Yang and Bin Cui. 2024. CAFE: Towards Compact Adaptive and Fast Embedding for Large-scale Recommendation Models. Proceedings of the ACM on Management of Data 2 1 (2024) 1\u201328.","DOI":"10.1145\/3639306"},{"key":"e_1_3_3_1_36_2","unstructured":"Xiangyu Zhao Haochen Liu Hui Liu Jiliang Tang Weiwei Guo Jun Shi Sida Wang Huiji Gao and Bo Long. 2020. Memory-efficient embedding for recommendations. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2006.14827 (2020)."},{"key":"e_1_3_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM51629.2021.00101"}],"event":{"name":"RecSys '25: Nineteenth ACM Conference on Recommender Systems","sponsor":["SIGCHI ACM Special Interest Group on Computer-Human Interaction","SIGAI ACM Special Interest Group on Artificial Intelligence","SIGIR ACM Special Interest Group on Information Retrieval","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Prague Czech Republic","acronym":"RecSys '25"},"container-title":["Proceedings of the Nineteenth ACM Conference on Recommender Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3705328.3748078","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T11:41:20Z","timestamp":1757158880000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3705328.3748078"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,7]]},"references-count":36,"alternative-id":["10.1145\/3705328.3748078","10.1145\/3705328"],"URL":"https:\/\/doi.org\/10.1145\/3705328.3748078","relation":{},"subject":[],"published":{"date-parts":[[2025,9,7]]},"assertion":[{"value":"2025-09-07","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}