{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T08:02:34Z","timestamp":1774252954335,"version":"3.50.1"},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T00:00:00Z","timestamp":1769299200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T00:00:00Z","timestamp":1769472000000},"content-version":"vor","delay-in-days":2,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100001794","name":"The University of Queensland","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001794","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Sci. Eng."],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s41019-025-00327-5","type":"journal-article","created":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T18:35:20Z","timestamp":1769366120000},"page":"230-247","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Sparse Gradient Training for Recommender Systems"],"prefix":"10.1007","volume":"11","author":[{"given":"Yunke","family":"Qu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang","family":"Qu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangyu","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianxin","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1395-261X","authenticated-orcid":false,"given":"Hongzhi","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,25]]},"reference":[{"key":"327_CR1","doi-asserted-by":"crossref","unstructured":"Xia X, Yu J, Wang Q, Yang C, Hung NQV, Yin H (2023) Efficient on-device session-based recommendation. TIIS. 41(4)","DOI":"10.1145\/3580364"},{"key":"327_CR2","doi-asserted-by":"crossref","unstructured":"Xia X, Yin H, Yu J, Wang Q, Xu G, Nguyen QVH (2022) On-device next-item recommendation with self-supervised knowledge distillation. In: SIGIR, pp. 546\u2013555","DOI":"10.1145\/3477495.3531775"},{"key":"327_CR3","doi-asserted-by":"crossref","unstructured":"Wang Q, Yin H, Chen T, Huang Z, Wang H, Zhao Y, Viet Hung NQ (2020) Next point-of-interest recommendation on resource-constrained mobile devices. In: WWW, pp. 906\u2013916","DOI":"10.1145\/3366423.3380170"},{"key":"327_CR4","doi-asserted-by":"crossref","unstructured":"Addula SR, Sekhar Sajja G (2024) Automated machine learning to streamline data-driven industrial application development. In: 2024 Sec Intl Conf Comput Charact Techniques Eng Sci (IC3TES), pp. 1\u20134","DOI":"10.1109\/IC3TES62412.2024.10877481"},{"key":"327_CR5","first-page":"3363","volume":"36","author":"R Zheng","year":"2024","unstructured":"Zheng R, Qu L, Chen T, Zheng K, Shi Y, Yin H (2024) Personalized elastic embedding learning for on-device recommendation. TKDE 36:3363\u20133375","journal-title":"TKDE"},{"issue":"5","key":"327_CR6","first-page":"1","volume":"56","author":"S Li","year":"2024","unstructured":"Li S, Guo H, Tang X, Tang R, Hou L, Li R, Zhang R (2024) Embedding compression in recommender systems: a survey. ACM Comput Surv 56(5):1\u201321","journal-title":"ACM Comput Surv"},{"key":"327_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106622","volume":"212","author":"X He","year":"2021","unstructured":"He X, Zhao K, Chu X (2021) Automl: a survey of the state-of-the-art. Knowl Based Syst 212:106622","journal-title":"Knowl Based Syst"},{"key":"327_CR8","unstructured":"Shen Z, Zhang Y, Wei L, Zhao H, Yao Q (2024) Automated Machine Learning: From Principles to Practices"},{"key":"327_CR9","doi-asserted-by":"crossref","unstructured":"Liang X, Chen T, Nguyen QVH, Li J, Yin H (2023) Learning compact compositional embeddings via regularized pruning for recommendation. In: ICDM, pp. 378\u2013387","DOI":"10.1109\/ICDM58522.2023.00047"},{"key":"327_CR10","doi-asserted-by":"crossref","unstructured":"Liang X, Chen T, Cui L, Wang Y, Wang M, Yin H (2024) Lightweight embeddings for graph collaborative filtering. In: SIGIR","DOI":"10.1145\/3626772.3657820"},{"key":"327_CR11","doi-asserted-by":"crossref","unstructured":"Kang W-C, Cheng DZ, Yao T, Yi X, Chen T, Hong L, Chi EH (2021) Learning to embed categorical features without embedding tables for recommendation. In: KDD, pp. 840\u2013850","DOI":"10.1145\/3447548.3467304"},{"key":"327_CR12","doi-asserted-by":"crossref","unstructured":"Shi H-JM, Mudigere D, Naumov M, Yang J (2020) Compositional embeddings using complementary partitions for memory-efficient recommendation systems. In: KDD, pp. 165\u2013175","DOI":"10.1145\/3394486.3403059"},{"key":"327_CR13","doi-asserted-by":"crossref","unstructured":"Liu H, Zhao X, Wang C, Liu X, Tang J (2020) Automated embedding size search in deep recommender systems. In: SIGIR, pp. 2307\u20132316","DOI":"10.1145\/3397271.3401436"},{"key":"327_CR14","doi-asserted-by":"crossref","unstructured":"Qu Y, Chen T, Zhao X, Cui L, Zheng K, Yin H (2023) Continuous input embedding size search for recommender systems. In: SIGIR, pp. 708\u2013717","DOI":"10.1145\/3539618.3591653"},{"key":"327_CR15","doi-asserted-by":"crossref","unstructured":"Qu Y, Qu L, Chen T, Xiangyu Z, Hung NQV, Yin H (2024) Scalable dynamic embedding size search for streaming recommendation. In: CIKM","DOI":"10.1145\/3627673.3679638"},{"key":"327_CR16","unstructured":"Liu S, Gao C, Chen Y, Jin D, Li Y (2021) Learnable embedding sizes for recommender systems. In: ICLR"},{"key":"327_CR17","doi-asserted-by":"crossref","unstructured":"Wang S, Sui Y, Wu J, Zheng Z, Xiong H (2024) Dynamic sparse learning: A novel paradigm for efficient recommendation. In: WSDM, pp. 740\u2013749","DOI":"10.1145\/3616855.3635780"},{"issue":"5","key":"327_CR18","first-page":"3006","volume":"37","author":"Y Wang","year":"2022","unstructured":"Wang Y, Sui Y, Wang X, Liu Z, He X (2022) Exploring lottery ticket hypothesis in media recommender systems. IJIS 37(5):3006\u20133024","journal-title":"IJIS"},{"key":"327_CR19","doi-asserted-by":"crossref","unstructured":"Qu Y, Chen T, Nguyen QVH, Yin H (2024) Budgeted embedding table for recommender systems. In: WSDM, pp. 557\u2013566","DOI":"10.1145\/3616855.3635778"},{"key":"327_CR20","doi-asserted-by":"crossref","unstructured":"Peng H, Gurevin D, Huang S, Geng T, Jiang W, Khan O, Ding C (2022) Towards sparsification of graph neural networks. In: 2022 IEEE 40th Intl Conf on Computer Design, pp. 272\u2013279","DOI":"10.1109\/ICCD56317.2022.00048"},{"key":"327_CR21","unstructured":"Evci U, Gale T, Menick J, Castro PS, Elsen E (2020) Rigging the lottery: making all tickets winners. In: ICML, pp. 2943\u20132952"},{"issue":"1","key":"327_CR22","doi-asserted-by":"publisher","first-page":"2383","DOI":"10.1038\/s41467-018-04316-3","volume":"9","author":"DC Mocanu","year":"2018","unstructured":"Mocanu DC, Mocanu E, Stone P, Nguyen PH, Gibescu M, Liotta A (2018) Scalable training of artificial neural networks with adaptive sparse connectivity inspired by network science. Nat Commun 9(1):2383","journal-title":"Nat Commun"},{"key":"327_CR23","unstructured":"Lee N, Ajanthan T, Torr P (2019) Snip: Single-shot network pruning based on connection sensitivity. In: ICLR"},{"key":"327_CR24","unstructured":"Wang C, Zhang G, Grosse R (2020) Picking winning tickets before training by preserving gradient flow. In: ICLR"},{"key":"327_CR25","unstructured":"Tanaka H, Kunin D, Yamins DLK, Ganguli S (2020) Pruning neural networks without any data by iteratively conserving synaptic flow. In: NeurIPS"},{"key":"327_CR26","doi-asserted-by":"crossref","unstructured":"Heddes M, Srinivasa N, Givargis T, Nicolau A (2024) Always-Sparse Training by Growing Connections with Guided Stochastic Exploration","DOI":"10.1109\/IJCNN64981.2025.11229016"},{"key":"327_CR27","doi-asserted-by":"crossref","unstructured":"Yin H, Qu L, Chen T, Yuan W, Zheng R, Long J, Xia X, Shi Y, Zhang C (2024) On-Device Recommender Systems: A Comprehensive Survey","DOI":"10.1007\/s41019-025-00308-8"},{"key":"327_CR28","doi-asserted-by":"crossref","unstructured":"He X, Zhang H, Kan M-Y, Chua T-S (2016) Fast matrix factorization for online recommendation with implicit feedback. In: SIGIR, pp. 549\u2013558","DOI":"10.1145\/2911451.2911489"},{"key":"327_CR29","doi-asserted-by":"crossref","unstructured":"Hu Y, Koren Y, Volinsky C (2008) Collaborative filtering for implicit feedback datasets. In: ICDM, pp. 263\u2013272","DOI":"10.1109\/ICDM.2008.22"},{"key":"327_CR30","doi-asserted-by":"crossref","unstructured":"Koren Y, Rendle S, Bell R (2021) Advances in collaborative filtering. Recommender syst handbook, 91\u2013142","DOI":"10.1007\/978-1-0716-2197-4_3"},{"key":"327_CR31","doi-asserted-by":"crossref","unstructured":"He X, Liao L, Zhang H, Nie L, Hu X, Chua T-S (2017) Neural collaborative filtering. In: WWW, pp. 173\u2013182","DOI":"10.1145\/3038912.3052569"},{"key":"327_CR32","doi-asserted-by":"crossref","unstructured":"Wang X, He X, Wang M, Feng F, Chua T-S (2019) Neural graph collaborative filtering. In: SIGIR, pp. 165\u2013174","DOI":"10.1145\/3331184.3331267"},{"key":"327_CR33","doi-asserted-by":"crossref","unstructured":"He X, Deng K, Wang X, Li Y, Zhang Y, Wang M (2020) Lightgcn: Simplifying and powering graph convolution network for recommendation. In: SIGIR, pp. 639\u2013648","DOI":"10.1145\/3397271.3401063"},{"key":"327_CR34","doi-asserted-by":"crossref","unstructured":"Mao K, Zhu J, Xiao X, Lu B, Wang Z, He X (2021) Ultragcn: Ultra simplification of graph convolutional networks for recommendation. In: CIKM, pp. 1253\u20131262","DOI":"10.1145\/3459637.3482291"},{"key":"327_CR35","first-page":"3281","volume":"36","author":"J Hu","year":"2022","unstructured":"Hu J, Hooi B, Qian S, Fang Q, Xu C (2022) Mgdcf: distance learning via markov graph diffusion for neural collaborative filtering. TKDE 36:3281\u20133296","journal-title":"TKDE"},{"key":"327_CR36","doi-asserted-by":"crossref","unstructured":"Yin H, Cui B, Huang Z, Wang W, Wu X, Zhou X (2015) Joint modeling of users\u2019 interests and mobility patterns for point-of-interest recommendation. In: MM, pp. 819\u2013822","DOI":"10.1145\/2733373.2806339"},{"key":"327_CR37","doi-asserted-by":"crossref","unstructured":"Wang Q, Yin H, Chen T, Huang Z, Wang H, Zhao Y, Viet Hung NQ (2020) Next point-of-interest recommendation on resource-constrained mobile devices. In: WWW, pp. 906\u2013916","DOI":"10.1145\/3366423.3380170"},{"key":"327_CR38","doi-asserted-by":"crossref","unstructured":"Yin H, Cui B (2016) Spatio-Temporal Recommendation in Social Media. 1st edn. Springer","DOI":"10.1007\/978-981-10-0748-4_1"},{"key":"327_CR39","unstructured":"Zhang C, Shi T, Zhang X, Zheng Y, Xie R, Liu Q, Xu J, Wen J-R (2024) QAGCF: Graph Collaborative Filtering for Q &A Recommendation"},{"key":"327_CR40","doi-asserted-by":"crossref","unstructured":"Li J, Wang M, Li J, Fu J, Shen X, Shang J, McAuley J (2023) Text is all you need: Learning language representations for sequential recommendation. In: KDD, pp. 1258\u20131267","DOI":"10.1145\/3580305.3599519"},{"key":"327_CR41","doi-asserted-by":"crossref","unstructured":"Zhang C, Chen S, Zhang X, Dai S, Yu W, Xu J (2024) Reinforcing long-term performance in recommender systems with user-oriented exploration policy. In: SIGIR, pp. 1850\u20131860","DOI":"10.1145\/3626772.3657714"},{"key":"327_CR42","doi-asserted-by":"crossref","unstructured":"Wang S, Wang Y, Tang J, Shu K, Ranganath S, Liu H (2017) What your images reveal: Exploiting visual contents for point-of-interest recommendation. In: WWW, pp. 391\u2013400","DOI":"10.1145\/3038912.3052638"},{"key":"327_CR43","doi-asserted-by":"crossref","unstructured":"Lee J, Abu-El-Haija S, Varadarajan B, Natsev A (2018) Collaborative deep metric learning for video understanding. In: KDD, pp. 481\u2013490","DOI":"10.1145\/3219819.3219856"},{"key":"327_CR44","unstructured":"Zhang C, Shi T, Zhang X, Liu Q, Xie R, Xu J, Wen J-R (2024) Modeling Domain and Feedback Transitions for Cross-Domain Sequential Recommendation"},{"key":"327_CR45","doi-asserted-by":"crossref","unstructured":"Wang Y, Li Z, Zhang C, Chen S, Zhang X, Xu J, Lin Q (2024) Do not wait: Learning re-ranking model without user feedback at serving time in e-commerce. In: RecSys, pp. 896\u2013901","DOI":"10.1145\/3640457.3688165"},{"issue":"2","key":"327_CR46","first-page":"914","volume":"34","author":"H Chen","year":"2022","unstructured":"Chen H, Yin H, Chen T, Wang W, Li X, Hu X (2022) Social boosted recommendation with folded bipartite network embedding. TKDE 34(2):914\u2013926","journal-title":"TKDE"},{"key":"327_CR47","doi-asserted-by":"crossref","unstructured":"Pawar PP, Femy FF, Rajkumar N, Jeevitha S, Bhuvanesh A, DK (2025) Blockchain-enabled cybersecurity for iot using elliptic curve cryptography and black winged kite model. Intl J Info Tech","DOI":"10.1007\/s41870-025-02576-z"},{"key":"327_CR48","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2021.107121","volume":"92","author":"S Liu","year":"2021","unstructured":"Liu S, Ha DS, Shen F, Yi Y (2021) Efficient neural networks for edge devices. Comput Electr Eng 92:107121","journal-title":"Comput Electr Eng"},{"key":"327_CR49","doi-asserted-by":"crossref","unstructured":"Wang X, Jia W (2025) Optimizing Edge AI: A Comprehensive Survey on Data, Model, and System Strategies","DOI":"10.32388\/IZOHCH"},{"key":"327_CR50","doi-asserted-by":"publisher","first-page":"6600","DOI":"10.1103\/PhysRevA.39.6600","volume":"39","author":"SA Janowsky","year":"1989","unstructured":"Janowsky SA (1989) Pruning versus clipping in neural networks. Phys Rev A 39:6600\u20136603","journal-title":"Phys Rev A"},{"key":"327_CR51","doi-asserted-by":"crossref","unstructured":"Str\u00f6m N (1997) Sparse connection and pruning in large dynamic artificial neural networks. In: Proc 5th European Conf on Speech Commn Tech, pp. 2807\u20132810","DOI":"10.21437\/Eurospeech.1997-708"},{"key":"327_CR52","unstructured":"Thimm G, Fiesler E (1995) Evaluating pruning methods. In: Proc of the Intl Symp Artif Neural Netw, pp. 20\u201325"},{"key":"327_CR53","doi-asserted-by":"crossref","unstructured":"Molchanov P, Mallya A, Tyree S, Frosio I, Kautz J (2019) Importance estimation for neural network pruning. In: CVPR, pp. 11264\u201311272","DOI":"10.1109\/CVPR.2019.01152"},{"key":"327_CR54","unstructured":"LeCun Y, Denker J, Solla S (1989) Optimal brain damage. In: Touretzky D. (ed.) NeurIPS, 2: 598\u2013605"},{"key":"327_CR55","unstructured":"Mozer MC, Smolensky P (1989) Skeletonization: A technique for trimming the fat from a network via relevance assessment. In: NeurIPS, pp. 107\u2013115"},{"key":"327_CR56","unstructured":"Molchanov P, Tyree S, Karras T, Aila T, Kautz J (2017) Pruning convolutional neural networks for resource efficient inference. In: ICLR"},{"key":"327_CR57","unstructured":"Frankle J, Carbin M (2019) The lottery ticket hypothesis: Finding sparse, trainable neural networks. In: ICLR"},{"key":"327_CR58","unstructured":"Han S, Pool J, Tran J, Dally WJ (2015) Learning both weights and connections for efficient neural networks. In: NeurIPS, pp. 1135\u20131143"},{"key":"327_CR59","unstructured":"Dettmers T, Zettlemoyer L (2019) Sparse Networks from Scratch: Faster Training without Losing Performance"},{"key":"327_CR60","doi-asserted-by":"crossref","unstructured":"Wu C, Xu Y (2020) Greedy coordinate descent method on non-negative quadratic programming. In: 2020 IEEE 11th Sensor Array and Multichannel Sig Proc Workshop (SAM), pp. 1\u20135. IEEE, ???","DOI":"10.1109\/SAM48682.2020.9104264"},{"issue":"2","key":"327_CR61","first-page":"913","volume":"36","author":"J Yu","year":"2024","unstructured":"Yu J, Xia X, Chen T, Cui L, Hung NQV, Yin H (2024) Xsimgcl: towards extremely simple graph contrastive learning for recommendation. TKDE 36(2):913\u2013926","journal-title":"TKDE"},{"key":"327_CR62","doi-asserted-by":"crossref","unstructured":"Qu Y, Qu L, Chen T, Nguyen QVH, Yin H (2025) Efficient multimodal streaming recommendation via expandable side mixture-of-experts. In: CIKM","DOI":"10.1145\/3746252.3761390"},{"key":"327_CR63","unstructured":"Rendle S, Freudenthaler C, Gantner Z, Schmidt-Thieme L (2009) Bpr: Bayesian personalized ranking from implicit feedback. In: Proc of the 25th Conf on Uncertainty in Artif Intell, pp. 452\u2013461"},{"key":"327_CR64","unstructured":"Kingma DP (2014) Adam: A method for stochastic optimization. arXiv:1412.6980"},{"key":"327_CR65","unstructured":"Liu S, Yin L, Mocanu D, Pechenizkiy M (2021) Do we actually need dense over-parameterization? in-time over-parameterization in sparse training. In: ICML, pp. 6989\u20137000"}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41019-025-00327-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-025-00327-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-025-00327-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T07:18:37Z","timestamp":1774250317000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41019-025-00327-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,25]]},"references-count":65,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["327"],"URL":"https:\/\/doi.org\/10.1007\/s41019-025-00327-5","relation":{},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"value":"2364-1185","type":"print"},{"value":"2364-1541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,25]]},"assertion":[{"value":"9 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 October 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 November 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}