{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T09:58:15Z","timestamp":1775815095434,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","funder":[{"name":"Grant Agency of the Czech Technical University in Prague","award":["SGS23\/210\/OHK3\/3T\/18"],"award-info":[{"award-number":["SGS23\/210\/OHK3\/3T\/18"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,9,22]]},"DOI":"10.1145\/3705328.3748147","type":"proceedings-article","created":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T10:48:44Z","timestamp":1757155724000},"page":"1099-1103","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["The Future is Sparse: Embedding Compression for Scalable Retrieval in Recommender Systems"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6438-366X","authenticated-orcid":false,"given":"Petr","family":"Kasalick\u00fd","sequence":"first","affiliation":[{"name":"Faculty of Information Technology, Czech Technical University in Prague, Prague, Czech Republic and Recombee, Prague, Czech Republic"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-7763-5575","authenticated-orcid":false,"given":"Martin","family":"Spi\u0161\u00e1k","sequence":"additional","affiliation":[{"name":"Recombee, Prague, Czech Republic and Faculty of Mathematics and Physics, Charles University, Prague, Czech Republic"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2638-9969","authenticated-orcid":false,"given":"Vojt\u011bch","family":"Van\u010dura","sequence":"additional","affiliation":[{"name":"Recombee, Prague, Czech Republic and Faculty of Information Technology, Czech Technical University in Prague, Prague, Czech Republic"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4974-5017","authenticated-orcid":false,"given":"Daniel","family":"Bohun\u011bk","sequence":"additional","affiliation":[{"name":"Recombee, Prague, Czech Republic"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7458-5281","authenticated-orcid":false,"given":"Rodrigo","family":"Alves","sequence":"additional","affiliation":[{"name":"Recombee, Prague, Czech Republic and Faculty of Information Technology, Czech Technical University in Prague, Prague, Czech Republic"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1433-0089","authenticated-orcid":false,"given":"Pavel","family":"Kord\u00edk","sequence":"additional","affiliation":[{"name":"Recombee, Prague, Czech Republic and Faculty of Information Technology, Czech Technical University in Prague, Prague, Czech Republic"}]}],"member":"320","published-online":{"date-parts":[[2025,9,7]]},"reference":[{"key":"e_1_3_3_2_2_2","unstructured":"Trenton Bricken Adly Templeton Joshua Batson Brian Chen Adam Jermyn Tom Conerly Nick Turner Cem Anil Carson Denison Amanda Askell et\u00a0al. 2023. Towards monosemanticity: Decomposing language models with dictionary learning. Transformer Circuits Thread 2 (2023)."},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/2959100.2959190"},{"key":"e_1_3_3_2_4_2","unstructured":"Hoagy Cunningham Aidan Ewart Logan Riggs Robert Huben and Lee Sharkey. 2023. Sparse Autoencoders Find Highly Interpretable Features in Language Models. arxiv:https:\/\/arXiv.org\/abs\/2309.08600\u00a0[cs.LG] https:\/\/arxiv.org\/abs\/2309.08600"},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"publisher","unstructured":"S.\u00a0C. Eisenstat M.\u00a0C. Gursky M.\u00a0H. Schultz and A.\u00a0H. Sherman. 1982. Yale sparse matrix package I: The symmetric codes. Internat. J. Numer. Methods Engrg. 18 8 (1982) 1145\u20131151. 10.1002\/nme.1620180804 arXiv:https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/nme.1620180804","DOI":"10.1002\/nme.1620180804"},{"key":"e_1_3_3_2_6_2","unstructured":"Leo Gao Tom\u00a0Dupr\u00e9 la Tour Henk Tillman Gabriel Goh Rajan Troll Alec Radford Ilya Sutskever Jan Leike and Jeffrey Wu. 2024. Scaling and evaluating sparse autoencoders. arxiv:https:\/\/arXiv.org\/abs\/2406.04093\u00a0[cs.LG] https:\/\/arxiv.org\/abs\/2406.04093"},{"key":"e_1_3_3_2_7_2","unstructured":"Hui Guan Andrey Malevich Jiyan Yang Jongsoo Park and Hector Yuen. 2019. Post-Training 4-bit Quantization on Embedding Tables. CoRR abs\/1911.02079 (2019). http:\/\/arxiv.org\/abs\/1911.02079"},{"key":"e_1_3_3_2_8_2","unstructured":"Diederik\u00a0P. Kingma and Jimmy Ba. 2017. Adam: A Method for Stochastic Optimization. arxiv:https:\/\/arXiv.org\/abs\/1412.6980\u00a0[cs.LG] https:\/\/arxiv.org\/abs\/1412.6980"},{"key":"e_1_3_3_2_9_2","unstructured":"Aditya Kusupati Gantavya Bhatt Aniket Rege Matthew Wallingford Aditya Sinha Vivek Ramanujan William Howard-Snyder Kaifeng Chen Sham Kakade Prateek Jain and Ali Farhadi. 2024. Matryoshka Representation Learning. arxiv:https:\/\/arXiv.org\/abs\/2205.13147\u00a0[cs.LG] https:\/\/arxiv.org\/abs\/2205.13147"},{"key":"e_1_3_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i4.25564"},{"key":"e_1_3_3_2_11_2","doi-asserted-by":"crossref","unstructured":"Shiwei Li Huifeng Guo Xing Tang Ruiming Tang Lu Hou Ruixuan Li and Rui Zhang. 2024. Embedding compression in recommender systems: A survey. Comput. Surveys 56 5 (2024) 1\u201321.","DOI":"10.1145\/3637841"},{"key":"e_1_3_3_2_12_2","unstructured":"Zhuoran Liu Leqi Zou Xuan Zou Caihua Wang Biao Zhang Da Tang Bolin Zhu Yijie Zhu Peng Wu Ke Wang et\u00a0al. 2022. Monolith: real time recommendation system with collisionless embedding table. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2209.07663 (2022)."},{"key":"e_1_3_3_2_13_2","unstructured":"Alireza Makhzani and Brendan Frey. 2014. k-Sparse Autoencoders. arxiv:https:\/\/arXiv.org\/abs\/1312.5663\u00a0[cs.LG] https:\/\/arxiv.org\/abs\/1312.5663"},{"key":"e_1_3_3_2_14_2","doi-asserted-by":"publisher","unstructured":"Yu\u00a0A. Malkov and D.\u00a0A. Yashunin. 2020. Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World Graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence 42 4 (2020) 824\u2013836. 10.1109\/TPAMI.2018.2889473","DOI":"10.1109\/TPAMI.2018.2889473"},{"key":"e_1_3_3_2_15_2","unstructured":"Zach Nussbaum John\u00a0X. Morris Brandon Duderstadt and Andriy Mulyar. 2024. Nomic Embed: Training a Reproducible Long Context Text Embedder. arxiv:https:\/\/arXiv.org\/abs\/2402.01613\u00a0[cs.CL]"},{"key":"e_1_3_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/3640457.3688037"},{"key":"e_1_3_3_2_17_2","first-page":"8024","volume-title":"Advances in Neural Information Processing Systems 32","author":"Paszke Adam","year":"2019","unstructured":"Adam Paszke, Sam Gross, Francisco Massa, Adam Lerer, James Bradbury, Gregory Chanan, Trevor Killeen, Zeming Lin, Natalia Gimelshein, Luca Antiga, Alban Desmaison, Andreas Kopf, Edward Yang, Zachary DeVito, Martin Raison, Alykhan Tejani, Sasank Chilamkurthy, Benoit Steiner, Lu Fang, Junjie Bai, and Soumith Chintala. 2019. PyTorch: An Imperative Style, High-Performance Deep Learning Library. In Advances in Neural Information Processing Systems 32. Curran Associates, Inc., 8024\u20138035. http:\/\/papers.neurips.cc\/paper\/9015-pytorch-an-imperative-style-high-performance-deep-learning-library.pdf"},{"key":"e_1_3_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/W19-4328"},{"key":"e_1_3_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-1410"},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/3604915.3608827"},{"key":"e_1_3_3_2_21_2","unstructured":"Adly Templeton Tom Conerly Jonathan Marcus Jack Lindsey Trenton Bricken Brian Chen Adam Pearce Craig Citro Emmanuel Ameisen Andy Jones et\u00a0al. 2024. Scaling monosemanticity: Extracting interpretable features from claude 3 sonnet. Transformer Circuits Thread."},{"key":"e_1_3_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/3523227.3551482"},{"key":"e_1_3_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3640457.3691707"},{"key":"e_1_3_3_2_24_2","doi-asserted-by":"publisher","unstructured":"Vojt\u011bch Van\u010dura Petr Kasalick\u00fd Rodrigo Alves and Pavel Kord\u00edk. 2025. Evaluating Linear Shallow Autoencoders on Large Scale Datasets. ACM Trans. Recomm. Syst. (July 2025). 10.1145\/3748335Just Accepted.","DOI":"10.1145\/3748335"},{"key":"e_1_3_3_2_25_2","doi-asserted-by":"publisher","unstructured":"Pauli Virtanen Ralf Gommers Travis\u00a0E. Oliphant Matt Haberland Tyler Reddy David Cournapeau Evgeni Burovski Pearu Peterson Warren Weckesser Jonathan Bright St\u00e9fan\u00a0J. van der Walt Matthew Brett Joshua Wilson K.\u00a0Jarrod Millman Nikolay Mayorov Andrew R.\u00a0J. Nelson Eric Jones Robert Kern Eric Larson C\u00a0J Carey \u0130lhan Polat Yu Feng Eric\u00a0W. Moore Jake VanderPlas Denis Laxalde Josef Perktold Robert Cimrman Ian Henriksen E.\u00a0A. Quintero Charles\u00a0R. Harris Anne\u00a0M. Archibald Ant\u00f4nio\u00a0H. Ribeiro Fabian Pedregosa Paul van Mulbregt and SciPy 1.0 Contributors. 2020. SciPy 1.0: Fundamental Algorithms for Scientific Computing in Python. Nature Methods 17 (2020) 261\u2013272. 10.1038\/s41592-019-0686-2","DOI":"10.1038\/s41592-019-0686-2"},{"key":"e_1_3_3_2_26_2","unstructured":"Tiansheng Wen Yifei Wang Zequn Zeng Zhong Peng Yudi Su Xinyang Liu Bo Chen Hongwei Liu Stefanie Jegelka and Chenyu You. 2025. Beyond Matryoshka: Revisiting Sparse Coding for Adaptive Representation. arxiv:https:\/\/arXiv.org\/abs\/2503.01776\u00a0[cs.LG] https:\/\/arxiv.org\/abs\/2503.01776"}],"event":{"name":"RecSys '25: Nineteenth ACM Conference on Recommender Systems","location":"Prague Czech Republic","acronym":"RecSys '25","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"]},"container-title":["Proceedings of the Nineteenth ACM Conference on Recommender Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3705328.3748147","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T11:52:16Z","timestamp":1757159536000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3705328.3748147"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,7]]},"references-count":25,"alternative-id":["10.1145\/3705328.3748147","10.1145\/3705328"],"URL":"https:\/\/doi.org\/10.1145\/3705328.3748147","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"}}]}}