{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:04:49Z","timestamp":1775815489657,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":58,"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:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Kuaishou Research Project"},{"name":"Anhui Provincial Natural Science Foundation","award":["2408085QF212"],"award-info":[{"award-number":["2408085QF212"]}]},{"DOI":"10.13039\/https:\/\/doi.org\/10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2024M760725"],"award-info":[{"award-number":["2024M760725"]}],"id":[{"id":"10.13039\/https:\/\/doi.org\/10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,20]]},"DOI":"10.1145\/3690624.3709275","type":"proceedings-article","created":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T18:42:22Z","timestamp":1743792142000},"page":"1515-1526","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Mitigating Redundancy in Deep Recommender Systems: A Field Importance Distribution Perspective"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-9744-220X","authenticated-orcid":false,"given":"Xianquan","family":"Wang","sequence":"first","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-2575-4779","authenticated-orcid":false,"given":"Likang","family":"Wu","sequence":"additional","affiliation":[{"name":"Tianjin University, Tianjin, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8061-7486","authenticated-orcid":false,"given":"Zhi","family":"Li","sequence":"additional","affiliation":[{"name":"Shenzhen International Graduate School, Tsinghua University, Shenzhen, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6721-065X","authenticated-orcid":false,"given":"Haitao","family":"Yuan","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3905-9352","authenticated-orcid":false,"given":"Shuanghong","family":"Shen","sequence":"additional","affiliation":[{"name":"Institute of Artificial Intelligence, Hefei Comprehensive National Science Center, Hefei, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-8093-6193","authenticated-orcid":false,"given":"Huibo","family":"Xu","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7950-4919","authenticated-orcid":false,"given":"Yu","family":"Su","sequence":"additional","affiliation":[{"name":"Hefei Normal University, Hefei, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6287-3673","authenticated-orcid":false,"given":"Chenyi","family":"Lei","sequence":"additional","affiliation":[{"name":"Kuaishou Technology, Hangzhou, China"}]}],"member":"320","published-online":{"date-parts":[[2025,7,20]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-020-09860-3"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2020.107053"},{"key":"e_1_3_2_2_3_1","article-title":"Random search for hyper-parameter optimization","volume":"13","author":"Bergstra James","year":"2012","unstructured":"James Bergstra and Yoshua Bengio. 2012. Random search for hyper-parameter optimization. Journal of machine learning research, Vol. 13, 2 (2012).","journal-title":"Journal of machine learning research"},{"key":"e_1_3_2_2_4_1","volume-title":"Variational Dropout and the Local Reparameterization Trick. In Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015","author":"Blum Avrim","year":"2015","unstructured":"Avrim Blum, Nika Haghtalab, and Ariel D. Procaccia. 2015. Variational Dropout and the Local Reparameterization Trick. In Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, December 7--12, 2015, Montreal, Quebec, Canada, Corinna Cortes, Neil D. Lawrence, Daniel D. Lee, Masashi Sugiyama, and Roman Garnett (Eds.). 2575--2583."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2964284.2964325"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939785"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2988450.2988454"},{"key":"e_1_3_2_2_8_1","unstructured":"Thomas M Cover Joy A Thomas et al. 1991. Entropy relative entropy and mutual information. Elements of information theory Vol. 2 1 (1991) 12--13."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2959100.2959190"},{"key":"e_1_3_2_2_10_1","volume-title":"LightCS: Selecting Quadratic Feature Crosses in Linear Complexity. In Companion Proceedings of the ACM Web Conference 2024 (WWW '24)","author":"Du Zhaocheng","year":"2024","unstructured":"Zhaocheng Du, Junhao Chen, Qinglin Jia, Chuhan Wu, Jieming Zhu, Zhenhua Dong, and Ruiming Tang. 2024a. LightCS: Selecting Quadratic Feature Crosses in Linear Complexity. In Companion Proceedings of the ACM Web Conference 2024 (WWW '24)."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3640457.3687094"},{"key":"e_1_3_2_2_12_1","first-page":"1","article-title":"All models are wrong, but many are useful: Learning a variable's importance by studying an entire class of prediction models simultaneously","volume":"20","author":"Fisher Aaron","year":"2019","unstructured":"Aaron Fisher, Cynthia Rudin, and Francesca Dominici. 2019. All models are wrong, but many are useful: Learning a variable's importance by studying an entire class of prediction models simultaneously. Journal of Machine Learning Research, Vol. 20, 177 (2019), 1--81.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_2_13_1","volume-title":"Proceedings of the thirteenth international conference on artificial intelligence and statistics. JMLR Workshop and Conference Proceedings, 249--256","author":"Glorot Xavier","year":"2010","unstructured":"Xavier Glorot and Yoshua Bengio. 2010. Understanding the difficulty of training deep feedforward neural networks. In Proceedings of the thirteenth international conference on artificial intelligence and statistics. JMLR Workshop and Conference Proceedings, 249--256."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/239nolinkurl10.24963\/ijcai.2017\/239"},{"key":"e_1_3_2_2_15_1","volume-title":"Gene selection for cancer classification using support vector machines. Machine learning","author":"Guyon Isabelle","year":"2002","unstructured":"Isabelle Guyon, Jason Weston, Stephen Barnhill, and Vladimir Vapnik. 2002. Gene selection for cancer classification using support vector machines. Machine learning, Vol. 46 (2002), 389--422."},{"key":"e_1_3_2_2_16_1","volume-title":"Correlation-based feature selection for machine learning. Ph.,D. Dissertation","author":"Hall Mark A","unstructured":"Mark A Hall. 1999. Correlation-based feature selection for machine learning. Ph.,D. Dissertation. The University of Waikato."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"crossref","unstructured":"David C Howell. 2011. Chi-Square Test: Analysis of Contingency Tables.","DOI":"10.1007\/978-3-642-04898-2_174"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3298689.3347043"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3133072"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3637528.3671571"},{"key":"e_1_3_2_2_21_1","volume-title":"LightGBM: A Highly Efficient Gradient Boosting Decision Tree. In NIPS'17","author":"Ke Guolin","year":"2017","unstructured":"Guolin Ke, Qi Meng, Thomas Finley, Taifeng Wang, Wei Chen, Weidong Ma, Qiwei Ye, and Tie-Yan Liu. 2017. LightGBM: A Highly Efficient Gradient Boosting Decision Tree. In NIPS'17. 3146--3154."},{"key":"e_1_3_2_2_22_1","volume-title":"Kingma and Jimmy Ba","author":"Diederik","year":"2015","unstructured":"Diederik P. Kingma and Jimmy Ba. 2015. Adam: A Method for Stochastic Optimization. In 3rd International Conference on Learning Representations, ICLR 2015, San Diego, CA, USA, May 7--9, 2015, Conference Track Proceedings, Yoshua Bengio and Yann LeCun (Eds.)."},{"key":"e_1_3_2_2_23_1","volume-title":"Wrappers for feature subset selection. Artificial intelligence","author":"Kohavi Ron","year":"1997","unstructured":"Ron Kohavi and George H John. 1997. Wrappers for feature subset selection. Artificial intelligence, Vol. 97, 1--2 (1997), 273--324."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583780.3615243"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539204"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3210104"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i4.25577"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462842"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3517902"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2556195.2556240"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0051"},{"key":"e_1_3_2_2_32_1","volume-title":"A simple and fast algorithm for K-medoids clustering. Expert systems with applications","author":"Park Hae-Sang","year":"2009","unstructured":"Hae-Sang Park and Chi-Hyuck Jun. 2009. A simple and fast algorithm for K-medoids clustering. Expert systems with applications, Vol. 36, 2 (2009), 3336--3341."},{"key":"e_1_3_2_2_33_1","volume-title":"Uncertainty in Neural Networks: Approximately Bayesian Ensembling. In The 23rd International Conference on Artificial Intelligence and Statistics, AISTATS 2020, 26--28","volume":"244","author":"Pearce Tim","year":"2020","unstructured":"Tim Pearce, Felix Leibfried, and Alexandra Brintrup. 2020. Uncertainty in Neural Networks: Approximately Bayesian Ensembling. In The 23rd International Conference on Artificial Intelligence and Statistics, AISTATS 2020, 26--28 August 2020, Online [Palermo, Sicily, Italy] (Proceedings of Machine Learning Research, Vol. 108), Silvia Chiappa and Roberto Calandra (Eds.). PMLR, 234--244."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0151"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242643"},{"key":"e_1_3_2_2_36_1","volume-title":"A mathematical theory of communication. The Bell system technical journal","author":"Shannon Claude Elwood","year":"1948","unstructured":"Claude Elwood Shannon. 1948. A mathematical theory of communication. The Bell system technical journal, Vol. 27, 3 (1948), 379--423."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357925"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2015.7364112"},{"key":"e_1_3_2_2_39_1","volume-title":"Introducing tensorflow feature columns. Google Developers Blog.[Online]. Available: https:\/\/developers. googleblog. com\/2017\/11\/introducing-tensorflow-feature-columns. html(accessed on: 10.04. 2021)","author":"Team TensorFlow","year":"2017","unstructured":"TensorFlow Team. 2017. Introducing tensorflow feature columns. Google Developers Blog.[Online]. Available: https:\/\/developers. googleblog. com\/2017\/11\/introducing-tensorflow-feature-columns. html(accessed on: 10.04. 2021) (2017)."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583780.3615089"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3124749.3124754"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450078"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3539618.3591767"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512071"},{"key":"e_1_3_2_2_46_1","unstructured":"Zhiqiang Wang Qingyun She and Junlin Zhang. 2021a. MaskNet: Introducing Feature-Wise Multiplication to CTR Ranking Models by Instance-Guided Mask. (2021)."},{"key":"e_1_3_2_2_47_1","volume-title":"Hyperparameter Ensembles for Robustness and Uncertainty Quantification. In Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020","author":"Wenzel Florian","year":"2020","unstructured":"Florian Wenzel, Jasper Snoek, Dustin Tran, and Rodolphe Jenatton. 2020. Hyperparameter Ensembles for Robustness and Uncertainty Quantification. In Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, December 6--12, 2020, virtual, Hugo Larochelle, Marc'Aurelio Ranzato, Raia Hadsell, Maria-Florina Balcan, and Hsuan-Tien Lin (Eds.)."},{"key":"e_1_3_2_2_48_1","volume-title":"Principal component analysis. Chemometrics and intelligent laboratory systems","author":"Wold Svante","year":"1987","unstructured":"Svante Wold, Kim Esbensen, and Paul Geladi. 1987. Principal component analysis. Chemometrics and intelligent laboratory systems, Vol. 2, 1--3 (1987), 37--52."},{"key":"e_1_3_2_2_49_1","volume-title":"Supporting Your Idea Reasonably: A Knowledge-Aware Topic Reasoning Strategy for Citation Recommendation","author":"Wu Likang","year":"2024","unstructured":"Likang Wu, Zhi Li, Hongke Zhao, Zhenya Huang, Yongqiang Han, Junji Jiang, and Enhong Chen. 2024a. Supporting Your Idea Reasonably: A Knowledge-Aware Topic Reasoning Strategy for Citation Recommendation. IEEE Transactions on Knowledge and Data Engineering (2024)."},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i8.28769"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1049\/icp.2023.2919"},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583780.3614781"},{"key":"e_1_3_2_2_53_1","volume-title":"Proceedings of the Twentieth International Conference (ICML 2003","author":"Yu Lei","year":"2003","unstructured":"Lei Yu and Huan Liu. 2003. Feature Selection for High-Dimensional Data: A Fast Correlation-Based Filter Solution. In Machine Learning, Proceedings of the Twentieth International Conference (ICML 2003), August 21--24, 2003, Washington, DC, USA, Tom Fawcett and Nina Mishra (Eds.). AAAI Press, 856--863."},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599277"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441761"},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531829"},{"key":"e_1_3_2_2_57_1","volume-title":"Lane: Logic alignment of non-tuning large language models and online recommendation systems for explainable reason generation. arXiv preprint arXiv:2407.02833","author":"Zhao Hongke","year":"2024","unstructured":"Hongke Zhao, Songming Zheng, Likang Wu, Bowen Yu, and Jing Wang. 2024. Lane: Logic alignment of non-tuning large language models and online recommendation systems for explainable reason generation. arXiv preprint arXiv:2407.02833 (2024)."},{"key":"e_1_3_2_2_58_1","volume-title":"Open Benchmarking for Click-Through Rate Prediction. In CIKM'21","author":"Zhu Jieming","year":"2021","unstructured":"Jieming Zhu, Jinyang Liu, Shuai Yang, Qi Zhang, and Xiuqiang He. 2021. Open Benchmarking for Click-Through Rate Prediction. In CIKM'21. ACM, 2759--2769. n"}],"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.3709275","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3690624.3709275","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T15:36:47Z","timestamp":1755358607000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3690624.3709275"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,20]]},"references-count":58,"alternative-id":["10.1145\/3690624.3709275","10.1145\/3690624"],"URL":"https:\/\/doi.org\/10.1145\/3690624.3709275","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"}}]}}