{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T09:22:10Z","timestamp":1780392130132,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T00:00:00Z","timestamp":1752969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"NIFA","award":["2020-67021-32799"],"award-info":[{"award-number":["2020-67021-32799"]}]},{"name":"NSF","award":["2416070"],"award-info":[{"award-number":["2416070"]}]},{"name":"IBM-Illinois Discovery Accelerator Institute"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,20]]},"DOI":"10.1145\/3690624.3709299","type":"proceedings-article","created":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T18:42:22Z","timestamp":1743792142000},"page":"1833-1843","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Generalizable Recommender System During Temporal Popularity Distribution Shifts"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5253-5646","authenticated-orcid":false,"given":"Hyunsik","family":"Yoo","sequence":"first","affiliation":[{"name":"University of Illinois Urbana-Champaign, Urbana, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-3253-8890","authenticated-orcid":false,"given":"Ruizhong","family":"Qiu","sequence":"additional","affiliation":[{"name":"University of Illinois Urbana-Champaign, Urbana, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3746-4795","authenticated-orcid":false,"given":"Charlie","family":"Xu","sequence":"additional","affiliation":[{"name":"Amazon.com, Inc., Seattle, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8265-0602","authenticated-orcid":false,"given":"Fei","family":"Wang","sequence":"additional","affiliation":[{"name":"Amazon.com, Inc., Sunnyvale, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4405-3887","authenticated-orcid":false,"given":"Hanghang","family":"Tong","sequence":"additional","affiliation":[{"name":"University of Illinois Urbana-Champaign, Urbana, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,7,20]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Ee-net: Exploitation-exploration neural networks in contextual bandits. arXiv preprint arXiv:2110.03177","author":"Ban Yikun","year":"2021","unstructured":"Yikun Ban, Yuchen Yan, Arindam Banerjee, and Jingrui He. 2021. Ee-net: Exploitation-exploration neural networks in contextual bandits. arXiv preprint arXiv:2110.03177 (2021)."},{"key":"e_1_3_2_2_2_1","volume-title":"Linked: The new science of networks.","author":"Barab\u00e1si Albert-L\u00e1szl\u00f3","year":"2003","unstructured":"Albert-L\u00e1szl\u00f3 Barab\u00e1si. 2003. Linked: The new science of networks."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.1120.1641"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531952"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401043"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3383313.3412216"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1108\/17465640710835373"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401063"},{"key":"e_1_3_2_2_9_1","volume-title":"Towards a definition of disentangled representations. arXiv preprint arXiv:1812.02230","author":"Higgins Irina","year":"2018","unstructured":"Irina Higgins, David Amos, David Pfau, Sebastien Racaniere, Loic Matthey, Danilo Rezende, and Alexander Lerchner. 2018. Towards a definition of disentangled representations. arXiv preprint arXiv:1812.02230 (2018)."},{"key":"e_1_3_2_2_10_1","volume-title":"Measuring preferential attachment in evolving networks. Europhysics letters","author":"Jeong Hawoong","year":"2003","unstructured":"Hawoong Jeong, Zoltan N\u00e9da, and Albert-L\u00e1szl\u00f3 Barab\u00e1si. 2003. Measuring preferential attachment in evolving networks. Europhysics letters, Vol. 61, 4 (2003), 567."},{"key":"e_1_3_2_2_11_1","volume-title":"Proceedings of the Tenth ACM International Conference on Web Search and Data Mining","author":"Joachims Thorsten","year":"2016","unstructured":"Thorsten Joachims, Adith Swaminathan, and Tobias Schnabel. 2016. Unbiased Learning-to-Rank with Biased Feedback. Proceedings of the Tenth ACM International Conference on Web Search and Data Mining (2016). https:\/\/api.semanticscholar.org\/CorpusID:300418"},{"key":"e_1_3_2_2_12_1","volume-title":"Adam: A method for stochastic optimization. Computing in science & engineering","author":"Kingma Diederik P","year":"2011","unstructured":"Diederik P Kingma and Jimmy Ba. 2011. Adam: A method for stochastic optimization. Computing in science & engineering, Vol. 13 (2011), 22--30."},{"key":"e_1_3_2_2_13_1","volume-title":"Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980","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)."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403226"},{"key":"e_1_3_2_2_15_1","volume-title":"International Conference on Machine Learning. PMLR, 5815--5826","author":"Krueger David","year":"2021","unstructured":"David Krueger, Ethan Caballero, Joern-Henrik Jacobsen, Amy Zhang, Jonathan Binas, Dinghuai Zhang, Remi Le Priol, and Aaron Courville. 2021. Out-of-distribution generalization via risk extrapolation (rex). In International Conference on Machine Learning. PMLR, 5815--5826."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371786"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.3934\/naco.2021057"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599371"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3523227.3546777"},{"key":"e_1_3_2_2_20_1","volume-title":"BPR: Bayesian personalized ranking from implicit feedback. arXiv preprint arXiv:1205.2618","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)."},{"key":"e_1_3_2_2_21_1","volume-title":"Tatsunori B Hashimoto, and Percy Liang.","author":"Sagawa Shiori","year":"2019","unstructured":"Shiori Sagawa, Pang Wei Koh, Tatsunori B Hashimoto, and Percy Liang. 2019. Distributionally robust neural networks for group shifts: On the importance of regularization for worst-case generalization. arXiv preprint arXiv:1911.08731 (2019)."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-17849-8_21"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043932.2043957"},{"key":"e_1_3_2_2_24_1","volume-title":"Brownian distance covariance. The annals of applied statistics","author":"Sz\u00e9kely G\u00e1bor J","year":"2009","unstructured":"G\u00e1bor J Sz\u00e9kely and Maria L Rizzo. 2009. Brownian distance covariance. The annals of applied statistics (2009), 1236--1265."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"crossref","unstructured":"G\u00e1bor J Sz\u00e9kely Maria L Rizzo and Nail K Bakirov. 2007. Measuring and testing dependence by correlation of distances. (2007).","DOI":"10.1214\/009053607000000505"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3539618.3591951"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401137"},{"key":"e_1_3_2_2_28_1","volume-title":"International Conference on Machine Learning. https:\/\/api.semanticscholar.org\/CorpusID:174800959","author":"Wang Xiaojie","year":"2019","unstructured":"Xiaojie Wang, Rui Zhang, Yu Sun, and Jianzhong Qi. 2019. Doubly Robust Joint Learning for Recommendation on Data Missing Not at Random. In International Conference on Machine Learning. https:\/\/api.semanticscholar.org\/CorpusID:174800959"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512255"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3539618.3591624"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583271"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645536"},{"key":"e_1_3_2_2_33_1","volume-title":"Proceedings of the 45th international ACM SIGIR conference on research and development in information retrieval. 1294--1303","author":"Yu Junliang","year":"2022","unstructured":"Junliang Yu, Hongzhi Yin, Xin Xia, Tong Chen, Lizhen Cui, and Quoc Viet Hung Nguyen. 2022. Are graph augmentations necessary? simple graph contrastive learning for recommendation. In Proceedings of the 45th international ACM SIGIR conference on research and development in information retrieval. 1294--1303."},{"key":"e_1_3_2_2_34_1","first-page":"7866","article-title":"Incorporating bias-aware margins into contrastive loss for collaborative filtering","volume":"35","author":"Zhang An","year":"2022","unstructured":"An Zhang, Wenchang Ma, Xiang Wang, and Tat-Seng Chua. 2022. Incorporating bias-aware margins into contrastive loss for collaborative filtering. Advances in Neural Information Processing Systems, Vol. 35 (2022), 7866--7878.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583461"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462875"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583780.3615492"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3543873.3584637"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449788"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441820"}],"event":{"name":"KDD '25: The 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Toronto ON Canada","acronym":"KDD '25","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3690624.3709299","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3690624.3709299","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3690624.3709299","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T15:40:01Z","timestamp":1755358801000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3690624.3709299"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,20]]},"references-count":40,"alternative-id":["10.1145\/3690624.3709299","10.1145\/3690624"],"URL":"https:\/\/doi.org\/10.1145\/3690624.3709299","relation":{},"subject":[],"published":{"date-parts":[[2025,7,20]]},"assertion":[{"value":"2025-07-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}