{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:10:10Z","timestamp":1750291810623,"version":"3.41.0"},"reference-count":49,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T00:00:00Z","timestamp":1742601600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62022077, 61976198"],"award-info":[{"award-number":["62022077, 61976198"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Recomm. Syst."],"published-print":{"date-parts":[[2025,9,30]]},"abstract":"<jats:p>\n            Collaborative filtering (CF) works have demonstrated the robust capabilities of Shallow Autoencoders on implicit feedback, showcasing highly competitive performance with other reasonable approaches (e.g., iALS and VAE-CF). However, despite their dual advantages of high performance and simple construction, EASE still exhibits several major shortcomings that must be addressed. To be more precise, the scalability of EASE is limited by the number of items, which determines the storage and inversion cost of a large dense matrix; the square-loss optimization objective does not consistently meet the recommendation task\u2019s requirement for predicting personalized rankings, resulting in suboptimal outcomes; the regularization coefficients are sensitive and require recalibration with different datasets, leading to an exhaustive and time-consuming fine-tuning process. In order to address these obstacles, we propose a novel approach called Similarity-Structure Aware Shallow Autoencoder (AutoS\n            <jats:inline-formula content-type=\"math\/tex\">\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\(^2\\)<\/jats:tex-math>\n            <\/jats:inline-formula>\n            AE) that aims to enhance both recommendation accuracy and model efficiency. Our method introduces three similarity structures: Co-occurrence, KNN, and NSW graphs, which replace the large dense matrix in EASE with a sparse structure, thus facilitating model compression. Additionally, we optimize the model by incorporating a low-rank training component into the matrix and applying a weighted square loss for improved ranking-oriented approximations. To automatically tune the hyperparameters, we further design two validation losses on the validation set for guidance and update the hyperparameters using the gradients of these validation losses. Both theoretical analyses regarding the introduction of similarity structures and empirical evaluations on multiple real-world datasets demonstrate the effectiveness of our proposed method, which significantly outperforms competing baselines.\n          <\/jats:p>","DOI":"10.1145\/3656482","type":"journal-article","created":{"date-parts":[[2024,4,10]],"date-time":"2024-04-10T12:25:39Z","timestamp":1712751939000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Automated Sparse and Low-Rank Shallow Autoencoders for Recommendation"],"prefix":"10.1145","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9485-5573","authenticated-orcid":false,"given":"Yuanhao","family":"Pu","sequence":"first","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0643-6505","authenticated-orcid":false,"given":"Rui","family":"Fan","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6440-2242","authenticated-orcid":false,"given":"Jin","family":"Chen","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science and Technology, Hong Kong, Hong Kong"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5814-1939","authenticated-orcid":false,"given":"Zhihao","family":"Zhu","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3507-9607","authenticated-orcid":false,"given":"Defu","family":"Lian","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China State Key Laboratory of Cognitive Intelligence, Hefei, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4835-4102","authenticated-orcid":false,"given":"Enhong","family":"Chen","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China, State Key Laboratory of Cognitive Intelligence, Hefei, China"}]}],"member":"320","published-online":{"date-parts":[[2025,3,22]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_2_2","DOI":"10.1016\/0925-2312(93)90006-O"},{"key":"e_1_3_2_3_2","article-title":"Layer normalization","author":"Ba Jimmy Lei","year":"2016","unstructured":"Jimmy Lei Ba, Jamie Ryan Kiros, and Geoffrey E. Hinton. 2016. Layer normalization. arXiv preprint arXiv:1607.06450 (2016).","journal-title":"arXiv preprint arXiv:1607.06450"},{"doi-asserted-by":"publisher","key":"e_1_3_2_4_2","DOI":"10.1145\/3038912.3052694"},{"key":"e_1_3_2_5_2","article-title":"Generating sentences from a continuous space","author":"Bowman Samuel R.","year":"2015","unstructured":"Samuel R. Bowman, Luke Vilnis, Oriol Vinyals, Andrew M. Dai, Rafal Jozefowicz, and Samy Bengio. 2015. Generating sentences from a continuous space. arXiv preprint arXiv:1511.06349 (2015).","journal-title":"arXiv preprint arXiv:1511.06349"},{"doi-asserted-by":"publisher","key":"e_1_3_2_6_2","DOI":"10.1145\/3485447.3512068"},{"doi-asserted-by":"publisher","key":"e_1_3_2_7_2","DOI":"10.1145\/3292500.3330880"},{"doi-asserted-by":"publisher","key":"e_1_3_2_8_2","DOI":"10.1145\/3270323.3270326"},{"doi-asserted-by":"publisher","key":"e_1_3_2_9_2","DOI":"10.1145\/2959100.2959185"},{"doi-asserted-by":"publisher","key":"e_1_3_2_10_2","DOI":"10.1145\/963770.963776"},{"doi-asserted-by":"publisher","key":"e_1_3_2_11_2","DOI":"10.1145\/3543507.3583349"},{"key":"e_1_3_2_12_2","first-page":"38912","article-title":"Recommender forest for efficient retrieval","volume":"35","author":"Feng Chao","year":"2022","unstructured":"Chao Feng, Wuchao Li, Defu Lian, Zheng Liu, and Enhong Chen. 2022. Recommender forest for efficient retrieval. Advances in Neural Information Processing Systems 35 (2022), 38912\u201338924.","journal-title":"Advances in Neural Information Processing Systems"},{"doi-asserted-by":"publisher","key":"e_1_3_2_13_2","DOI":"10.1145\/3584701"},{"doi-asserted-by":"publisher","key":"e_1_3_2_14_2","DOI":"10.1145\/3298689.3347058"},{"doi-asserted-by":"publisher","key":"e_1_3_2_15_2","DOI":"10.1109\/TKDE.2018.2831682"},{"doi-asserted-by":"publisher","key":"e_1_3_2_16_2","DOI":"10.1109\/ICDM.2008.22"},{"doi-asserted-by":"publisher","key":"e_1_3_2_17_2","DOI":"10.1109\/CVPR.2017.243"},{"key":"e_1_3_2_18_2","first-page":"22629","article-title":"Sampling-decomposable generative adversarial recommender","volume":"33","author":"Jin Binbin","year":"2020","unstructured":"Binbin Jin, Defu Lian, Zheng Liu, Qi Liu, Jianhui Ma, Xing Xie, and Enhong Chen. 2020. Sampling-decomposable generative adversarial recommender. Advances in Neural Information Processing Systems 33 (2020), 22629\u201322639.","journal-title":"Advances in Neural Information Processing Systems"},{"doi-asserted-by":"publisher","key":"e_1_3_2_19_2","DOI":"10.1145\/3447548.3467428"},{"doi-asserted-by":"publisher","key":"e_1_3_2_20_2","DOI":"10.1145\/2487575.2487589"},{"doi-asserted-by":"publisher","key":"e_1_3_2_21_2","DOI":"10.1145\/3298689.3347015"},{"key":"e_1_3_2_22_2","article-title":"Adam: A method for stochastic optimization","author":"Kingma Diederik P.","year":"2014","unstructured":"Diederik P. Kingma and Jimmy Ba. 2014. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014).","journal-title":"arXiv preprint arXiv:1412.6980"},{"key":"e_1_3_2_23_2","article-title":"Auto-encoding variational Bayes","author":"Kingma Diederik P.","year":"2013","unstructured":"Diederik P. Kingma and Max Welling. 2013. Auto-encoding variational Bayes. arXiv preprint arXiv:1312.6114 (2013).","journal-title":"arXiv preprint arXiv:1312.6114"},{"doi-asserted-by":"publisher","key":"e_1_3_2_24_2","DOI":"10.1145\/3097983.3098077"},{"doi-asserted-by":"publisher","key":"e_1_3_2_25_2","DOI":"10.1145\/3366423.3380187"},{"doi-asserted-by":"publisher","key":"e_1_3_2_26_2","DOI":"10.1145\/3366423.3380151"},{"doi-asserted-by":"publisher","key":"e_1_3_2_27_2","DOI":"10.1145\/3394486.3403252"},{"doi-asserted-by":"publisher","key":"e_1_3_2_28_2","DOI":"10.1145\/3178876.3186150"},{"doi-asserted-by":"publisher","key":"e_1_3_2_29_2","DOI":"10.1109\/TPAMI.2018.2889473"},{"doi-asserted-by":"crossref","unstructured":"Meiqi Wang Zhiyuan Wu Xiaoxin Sun Guozhong Feng and Bangzuo Zhang. 2019. Trust-aware collaborative filtering with a denoising autoencoder. Neural Processing Letters 49 (2019) 835\u2013849.","key":"e_1_3_2_30_2","DOI":"10.1007\/s11063-018-9831-7"},{"doi-asserted-by":"publisher","key":"e_1_3_2_31_2","DOI":"10.5555\/3104322.3104425"},{"doi-asserted-by":"publisher","key":"e_1_3_2_32_2","DOI":"10.1109\/ICDM.2011.134"},{"doi-asserted-by":"publisher","key":"e_1_3_2_33_2","DOI":"10.1145\/2365952.2365983"},{"doi-asserted-by":"publisher","key":"e_1_3_2_34_2","DOI":"10.1145\/1557019.1557094"},{"doi-asserted-by":"publisher","key":"e_1_3_2_35_2","DOI":"10.1109\/ICDM.2008.16"},{"key":"e_1_3_2_36_2","article-title":"Searching for activation functions","author":"Ramachandran Prajit","year":"2017","unstructured":"Prajit Ramachandran, Barret Zoph, and Quoc V. Le. 2017. Searching for activation functions. arXiv preprint arXiv:1710.05941 (2017).","journal-title":"arXiv preprint arXiv:1710.05941"},{"key":"e_1_3_2_37_2","article-title":"BPR: Bayesian personalized ranking from implicit feedback","author":"Rendle Steffen","year":"2012","unstructured":"Steffen Rendle, Christoph Freudenthaler, Zeno Gantner, and Lars Schmidt-Thieme. 2012. BPR: Bayesian personalized ranking from implicit feedback. arXiv preprint arXiv:1205.2618 (2012).","journal-title":"arXiv preprint arXiv:1205.2618"},{"key":"e_1_3_2_38_2","first-page":"1278","volume-title":"International Conference on Machine Learning","author":"Rezende Danilo Jimenez","year":"2014","unstructured":"Danilo Jimenez Rezende, Shakir Mohamed, and Daan Wierstra. 2014. Stochastic backpropagation and approximate inference in deep generative models. In International Conference on Machine Learning. PMLR, 1278\u20131286."},{"doi-asserted-by":"publisher","key":"e_1_3_2_39_2","DOI":"10.1109\/ICNN.1993.298623"},{"key":"e_1_3_2_40_2","first-page":"3854","volume-title":"Proceedings of the 25th International Joint Conference on Artificial Intelligence","author":"Sedhain Suvash","year":"2016","unstructured":"Suvash Sedhain, Hung Bui, Jaya Kawale, Nikos Vlassis, Branislav Kveton, Aditya Krishna Menon, Trung Bui, and Scott Sanner. 2016. Practical linear models for large-scale one-class collaborative filtering. In Proceedings of the 25th International Joint Conference on Artificial Intelligence. 3854\u20133860."},{"doi-asserted-by":"publisher","key":"e_1_3_2_41_2","DOI":"10.1145\/2740908.2742726"},{"doi-asserted-by":"publisher","key":"e_1_3_2_42_2","DOI":"10.1145\/3336191.3371831"},{"doi-asserted-by":"publisher","key":"e_1_3_2_43_2","DOI":"10.1109\/TEVC.2017.2712906"},{"doi-asserted-by":"publisher","key":"e_1_3_2_44_2","DOI":"10.1145\/3308558.3313710"},{"key":"e_1_3_2_45_2","first-page":"19598","article-title":"Autoencoders that don\u2019t overfit towards the identity","volume":"33","author":"Steck Harald","year":"2020","unstructured":"Harald Steck. 2020. Autoencoders that don\u2019t overfit towards the identity. Advances in Neural Information Processing Systems 33 (2020), 19598\u201319608.","journal-title":"Advances in Neural Information Processing Systems"},{"doi-asserted-by":"publisher","key":"e_1_3_2_46_2","DOI":"10.1145\/3336191.3371774"},{"doi-asserted-by":"publisher","key":"e_1_3_2_47_2","DOI":"10.1109\/TIT.2014.2320500"},{"doi-asserted-by":"publisher","key":"e_1_3_2_48_2","DOI":"10.1145\/2835776.2835837"},{"doi-asserted-by":"publisher","key":"e_1_3_2_49_2","DOI":"10.1145\/3442381.3449946"},{"doi-asserted-by":"publisher","key":"e_1_3_2_50_2","DOI":"10.1145\/3459637.3482016"}],"container-title":["ACM Transactions on Recommender Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3656482","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3656482","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:57:31Z","timestamp":1750291051000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3656482"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,22]]},"references-count":49,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9,30]]}},"alternative-id":["10.1145\/3656482"],"URL":"https:\/\/doi.org\/10.1145\/3656482","relation":{},"ISSN":["2770-6699"],"issn-type":[{"type":"electronic","value":"2770-6699"}],"subject":[],"published":{"date-parts":[[2025,3,22]]},"assertion":[{"value":"2023-10-30","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-03-26","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-03-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}