{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T04:39:16Z","timestamp":1767847156075,"version":"3.49.0"},"reference-count":98,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T00:00:00Z","timestamp":1714348800000},"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":"crossref","award":["62102420"],"award-info":[{"award-number":["62102420"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Beijing Outstanding Young Scientist Program","award":["BJJWZYJH012019100020098"],"award-info":[{"award-number":["BJJWZYJH012019100020098"]}]},{"name":"Intelligent Social Governance Platform, Major Innovation & Planning Interdisciplinary Platform"},{"name":"Research Funds of Renmin University of China","award":["23XNH029"],"award-info":[{"award-number":["23XNH029"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst."],"published-print":{"date-parts":[[2024,9,30]]},"abstract":"<jats:p>Fairness has been gradually recognized as a significant problem in the recommendation domain. Previous models usually achieve fairness by reducing the average performance gap between different user groups. However, the average performance may not sufficiently represent all the characteristics of the performances in a user group. Thus, equivalent average performance may not mean the recommender model is fair, for example, the variance of the performances can be different. To alleviate this problem, in this article, we define a novel type of fairness, where we require that the performance distributions across different user groups should be similar. We prove that with the same performance distribution, the numerical characteristics of the group performance, including the expectation, variance, and any higher-order moment, are also the same. To achieve distributional fairness, we propose a generative and adversarial training framework. Specifically, we regard the recommender model as the generator to compute the performance for each user in different groups, and then we deploy a discriminator to judge which group the performance is drawn from. By iteratively optimizing the generator and the discriminator, we can theoretically prove that the optimal generator (the recommender model) can indeed lead to the equivalent performance distributions. To smooth the adversarial training process, we propose a novel dual curriculum learning strategy for optimal scheduling of training samples. Additionally, we tailor our framework to better suit top-N recommendation tasks by incorporating softened ranking metrics as measures of performance discrepancies. We conduct extensive experiments based on real-world datasets to demonstrate the effectiveness of our model.<\/jats:p>","DOI":"10.1145\/3652854","type":"journal-article","created":{"date-parts":[[2024,3,18]],"date-time":"2024-03-18T14:27:50Z","timestamp":1710772070000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Distributional Fairness-aware Recommendation"],"prefix":"10.1145","volume":"42","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-5365-897X","authenticated-orcid":false,"given":"Hao","family":"Yang","sequence":"first","affiliation":[{"name":"Gaoling School of Artificial Intelligence, Renmin University of China, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1118-9710","authenticated-orcid":false,"given":"Xian","family":"Wu","sequence":"additional","affiliation":[{"name":"Tencent Youtu Lab, Jarvis Research Center, Tencent, Shenzhen, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8622-2402","authenticated-orcid":false,"given":"Zhaopeng","family":"Qiu","sequence":"additional","affiliation":[{"name":"Tencent Youtu Lab, Jarvis Research Center, Tencent, Shenzhen, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2195-2847","authenticated-orcid":false,"given":"Yefeng","family":"Zheng","sequence":"additional","affiliation":[{"name":"Tencent Youtu Lab, Jarvis Research Center, Tencent, Shenzhen, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0144-1775","authenticated-orcid":false,"given":"Xu","family":"Chen","sequence":"additional","affiliation":[{"name":"Gaoling School of Artificial Intelligence, Renmin University of China, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2024,4,29]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-72357-6"},{"key":"e_1_3_2_3_2","unstructured":"Mario Arduini Lorenzo Noci Federico Pirovano Ce Zhang Yash Raj Shrestha and Bibek Paudel. 2020. Adversarial learning for debiasing knowledge graph embeddings. Retrieved from https:\/\/arXiv:2006.16309"},{"key":"e_1_3_2_4_2","unstructured":"Martin Arjovsky and L\u00e9on Bottou. 2017. Towards principled methods for training generative adversarial networks. Retrieved from https:\/\/arXiv:1701.04862"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371832"},{"key":"e_1_3_2_6_2","unstructured":"Alex Beutel Jilin Chen Zhe Zhao and Ed H. Chi. 2017. Data decisions and theoretical implications when adversarially learning fair representations. Retrieved from https:\/\/arXiv:1707.00075"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3210063"},{"key":"e_1_3_2_8_2","first-page":"715","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Bose Avishek","year":"2019","unstructured":"Avishek Bose and William Hamilton. 2019. Compositional fairness constraints for graph embeddings. In Proceedings of the International Conference on Machine Learning. PMLR, 715\u2013724."},{"key":"e_1_3_2_9_2","unstructured":"Andrew Brock Jeff Donahue and Karen Simonyan. 2018. Large-scale GAN training for high fidelity natural image synthesis. Retrieved from https:\/\/arXiv:1809.11096"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.5555\/184656.180369"},{"key":"e_1_3_2_11_2","unstructured":"Burke Robin Sonboli Nasim Mansoury Masoud and Ordo\u00f1ez-Gauger Aldo. 2017. Balanced neighborhoods for fairness-aware collaborative recommendation. In Proceedings of the ACM FATRec Workshop."},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271743"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583341"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583355"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159668"},{"key":"e_1_3_2_16_2","first-page":"10596","volume-title":"Advances in Neural Information Processing Systems","author":"Chen Ying","year":"2020","unstructured":"Ying Chen, Weinan Zhang, and Yuyu Zhang. 2020. Adversarial training for recommendation systems with implicit feedback. In Advances in Neural Information Processing Systems. 10596\u201310606."},{"key":"e_1_3_2_17_2","first-page":"7103","article-title":"Learning fair graph neural networks with limited and private sensitive attribute information","author":"Dai Enyan","year":"2023","unstructured":"Enyan Dai and Suhang Wang. 2023. Learning fair graph neural networks with limited and private sensitive attribute information. IEEE Trans. Knowl. Data Eng. 35, 7 (2023), 7103\u20137117.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"e_1_3_2_18_2","first-page":"8596","article-title":"Two-sided fairness in rankings via Lorenz dominance","volume":"34","author":"Do Virginie","year":"2021","unstructured":"Virginie Do, Sam Corbett-Davies, Jamal Atif, and Nicolas Usunier. 2021. Two-sided fairness in rankings via Lorenz dominance. Adv. Neural Info. Process. Syst. 34 (2021), 8596\u20138608.","journal-title":"Adv. Neural Info. Process. Syst."},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i6.20606"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2020.3000681"},{"key":"e_1_3_2_21_2","unstructured":"Harrison Edwards and Amos Storkey. 2015. Censoring representations with an adversary. Retrieved from https:\/\/arXiv:1511.05897"},{"key":"e_1_3_2_22_2","doi-asserted-by":"crossref","unstructured":"Yanai Elazar and Yoav Goldberg. 2018. Adversarial removal of demographic attributes from text data. Retrieved from https:\/\/arXiv:1808.06640","DOI":"10.18653\/v1\/D18-1002"},{"key":"e_1_3_2_23_2","unstructured":"Golnoosh Farnadi Pigi Kouki Spencer K. Thompson Sriram Srinivasan and Lise Getoor. 2018. A fairness-aware hybrid recommender system. Retrieved from https:\/\/arXiv:1809.09030"},{"key":"e_1_3_2_24_2","first-page":"482","volume-title":"Proceedings of the Conference on Robot Learning","author":"Florensa Carlos","year":"2017","unstructured":"Carlos Florensa, David Held, Markus Wulfmeier, Michael Zhang, and Pieter Abbeel. 2017. Reverse curriculum generation for reinforcement learning. In Proceedings of the Conference on Robot Learning. PMLR, 482\u2013495."},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401051"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3463235"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/3422622"},{"key":"e_1_3_2_28_2","article-title":"A kernel method for the two-sample-problem","volume":"19","author":"Gretton Arthur","year":"2006","unstructured":"Arthur Gretton, Karsten Borgwardt, Malte Rasch, Bernhard Sch\u00f6lkopf, and Alex Smola. 2006. A kernel method for the two-sample-problem. Adv. Neural Info. Process. Syst. 19 (2006).","journal-title":"Adv. Neural Info. Process. Syst."},{"key":"e_1_3_2_29_2","unstructured":"Aditya Grover Eric Wang Aaron Zweig and Stefano Ermon. 2019. Stochastic optimization of sorting networks via continuous relaxations. Retrieved from https:\/\/arXiv:1903.08850"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583398"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1093\/pan\/mpr025"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401063"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3209981"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052569"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449904"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/582415.582418"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/2647868.2654918"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/3383313.3412232"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186133"},{"key":"e_1_3_2_41_2","unstructured":"Matt J. Kusner and Jos\u00e9 Miguel Hern\u00e1ndez-Lobato. 2016. GANs for sequences of discrete elements with the Gumbel-softmax distribution. Retrieved from https:\/\/arXiv:1611.04051"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772752"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1452"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3105389"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1145\/3184558.3186949"},{"key":"e_1_3_2_46_2","unstructured":"Jiwei Li Will Monroe Tianlin Shi S\u00e9bastien Jean Alan Ritter and Dan Jurafsky. 2017. Adversarial learning for neural dialogue generation. Retrieved from https:\/\/arXiv:1701.06547"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3511958"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441769"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449866"},{"key":"e_1_3_2_50_2","unstructured":"Yunqi Li Hanxiong Chen Shuyuan Xu Yingqiang Ge Juntao Tan Shuchang Liu and Yongfeng Zhang. 2022. Fairness in recommendation: A survey. Retrieved from https:\/\/arXiv:2205.13619"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462966"},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462943"},{"key":"e_1_3_2_53_2","unstructured":"Aleksander Madry Aleksandar Makelov Ludwig Schmidt Dimitris Tsipras and Adrian Vladu. 2017. Towards deep learning models resistant to adversarial attacks. Retrieved from https:\/\/arXiv:1706.06083"},{"key":"e_1_3_2_54_2","first-page":"214","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Martin Arjovsky","year":"2017","unstructured":"Arjovsky Martin, Chintala Soumith, and B. L\u00e9on. 2017. Wasserstein generative adversarial networks. In Proceedings of the International Conference on Machine Learning. 214\u2013223."},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2019.2934906"},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.soc.27.1.415"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3272027"},{"key":"e_1_3_2_58_2","unstructured":"Takeru Miyato Andrew M. Dai and Ian Goodfellow. 2016. Adversarial training methods for semi-supervised text classification. Retrieved from https:\/\/arXiv:1605.07725"},{"key":"e_1_3_2_59_2","doi-asserted-by":"crossref","unstructured":"Mohammadmehdi Naghiaei Hossein A. Rahmani and Yashar Deldjoo. 2022. Cpfair: Personalized consumer and producer fairness re-ranking for recommender systems. Retrieved from https:\/\/arXiv:2204.08085","DOI":"10.1145\/3477495.3531959"},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.1145\/3531146.3533136"},{"key":"e_1_3_2_61_2","first-page":"2642","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Odena Augustus","year":"2017","unstructured":"Augustus Odena, Christopher Olah, and Jonathon Shlens. 2017. Conditional image synthesis with auxiliary classifier gans. In Proceedings of the International Conference on Machine Learning. PMLR, 2642\u20132651."},{"key":"e_1_3_2_62_2","first-page":"651","volume-title":"Proceedings of the International Conference on Extending Database Technology (EDBT\u201920)","author":"Pitoura Evaggelia","year":"2020","unstructured":"Evaggelia Pitoura, Georgia Koutrika, and Kostas Stefanidis. 2020. Fairness in rankings and recommenders. In Proceedings of the International Conference on Extending Database Technology (EDBT\u201920). 651\u2013654."},{"key":"e_1_3_2_63_2","first-page":"1","article-title":"Fairness in rankings and recommendations: An overview","author":"Pitoura Evaggelia","year":"2022","unstructured":"Evaggelia Pitoura, Kostas Stefanidis, and Georgia Koutrika. 2022. Fairness in rankings and recommendations: An overview. VLDB J. (2022), 1\u201328.","journal-title":"VLDB J."},{"key":"e_1_3_2_64_2","doi-asserted-by":"crossref","unstructured":"Emmanouil Antonios Platanios Otilia Stretcu Graham Neubig Barnabas Poczos and Tom M. Mitchell. 2019. Competence-based curriculum learning for neural machine translation. Retrieved from https:\/\/arXiv:1903.09848","DOI":"10.18653\/v1\/N19-1119"},{"key":"e_1_3_2_65_2","doi-asserted-by":"crossref","unstructured":"Tao Qi Fangzhao Wu Chuhan Wu Peijie Sun Le Wu Xiting Wang Yongfeng Huang and Xing Xie. 2022. ProFairRec: Provider fairness-aware news recommendation. Retrieved from https:\/\/arXiv:2204.04724","DOI":"10.1145\/3477495.3532046"},{"key":"e_1_3_2_66_2","unstructured":"Alec Radford Luke Metz and Soumith Chintala. 2015. Unsupervised representation learning with deep convolutional generative adversarial networks. Retrieved from https:\/\/arXiv:1511.06434"},{"key":"e_1_3_2_67_2","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3291002"},{"key":"e_1_3_2_68_2","unstructured":"Steffen Rendle Christoph Freudenthaler Zeno Gantner and Lars Schmidt-Thieme. 2012. BPR: Bayesian personalized ranking from implicit feedback. Retrieved from https:\/\/arXiv:1205.2618"},{"key":"e_1_3_2_69_2","doi-asserted-by":"publisher","DOI":"10.1145\/3297280.3297442"},{"key":"e_1_3_2_70_2","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052612"},{"key":"e_1_3_2_71_2","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3481948"},{"key":"e_1_3_2_72_2","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583204"},{"key":"e_1_3_2_73_2","doi-asserted-by":"publisher","DOI":"10.1109\/WACV45572.2020.9093408"},{"key":"e_1_3_2_74_2","doi-asserted-by":"publisher","DOI":"10.1109\/TAI.2021.3133818"},{"key":"e_1_3_2_75_2","doi-asserted-by":"publisher","DOI":"10.1145\/3240323.3240372"},{"key":"e_1_3_2_76_2","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482420"},{"key":"e_1_3_2_77_2","doi-asserted-by":"crossref","unstructured":"Yi Tay Shuohang Wang Luu Anh Tuan Jie Fu Minh C Phan Xingdi Yuan Jinfeng Rao Siu Cheung Hui and Aston Zhang. 2019. Simple and effective curriculum pointer-generator networks for reading comprehension over long narratives. Retrieved from https:\/\/arXiv:1905.10847","DOI":"10.18653\/v1\/P19-1486"},{"key":"e_1_3_2_78_2","first-page":"24261","article-title":"MLP-mixer: An all-MLP architecture for vision","volume":"34","author":"Tolstikhin Ilya O.","year":"2021","unstructured":"Ilya O. Tolstikhin, Neil Houlsby, Alexander Kolesnikov, Lucas Beyer, Xiaohua Zhai, Thomas Unterthiner, Jessica Yung, Andreas Steiner, Daniel Keysers, Jakob Uszkoreit et\u00a0al. 2021. MLP-mixer: An all-MLP architecture for vision. Adv. Neural Info. Process. Syst. 34 (2021), 24261\u201324272.","journal-title":"Adv. Neural Info. Process. Syst."},{"key":"e_1_3_2_79_2","doi-asserted-by":"publisher","DOI":"10.1145\/3539597.3570469"},{"key":"e_1_3_2_80_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00541"},{"issue":"9","key":"e_1_3_2_81_2","first-page":"4555","article-title":"A survey on curriculum learning","volume":"44","author":"Wang Xin","year":"2021","unstructured":"Xin Wang, Yudong Chen, and Wenwu Zhu. 2021. A survey on curriculum learning. IEEE Trans. Pattern Anal. Mach. Intell. 44, 9 (2021), 4555\u20134576.","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"e_1_3_2_82_2","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441732"},{"key":"e_1_3_2_83_2","unstructured":"Chuhan Wu Fangzhao Wu Tao Qi and Yongfeng Huang. 2022. Are big recommendation models fair to cold users? Retrieved from https:\/\/arXiv:2202.13607"},{"key":"e_1_3_2_84_2","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450015"},{"key":"e_1_3_2_85_2","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531913"},{"key":"e_1_3_2_86_2","article-title":"PC-fairness: A unified framework for measuring causality-based fairness","volume":"32","author":"Wu Yongkai","year":"2019","unstructured":"Yongkai Wu, Lu Zhang, Xintao Wu, and Hanghang Tong. 2019. PC-fairness: A unified framework for measuring causality-based fairness. Adv. Neural Info. Process. Syst. 32 (2019).","journal-title":"Adv. Neural Info. Process. Syst."},{"key":"e_1_3_2_87_2","doi-asserted-by":"publisher","DOI":"10.1145\/3109859.3109887"},{"key":"e_1_3_2_88_2","article-title":"Controllable invariance through adversarial feature learning","volume":"30","author":"Xie Qizhe","year":"2017","unstructured":"Qizhe Xie, Zihang Dai, Yulun Du, Eduard Hovy, and Graham Neubig. 2017. Controllable invariance through adversarial feature learning. Adv. Neural Info. Process. Syst. 30 (2017).","journal-title":"Adv. Neural Info. Process. Syst."},{"key":"e_1_3_2_89_2","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583296"},{"key":"e_1_3_2_90_2","unstructured":"Tao Yang Zhichao Xu and Qingyao Ai. 2022. Effective exposure amortizing for fair top-k recommendation. Retrieved from https:\/\/arXiv:2204.03046"},{"key":"e_1_3_2_91_2","article-title":"Beyond parity: Fairness objectives for collaborative filtering","volume":"30","author":"Yao Sirui","year":"2017","unstructured":"Sirui Yao and Bert Huang. 2017. Beyond parity: Fairness objectives for collaborative filtering. Adv. Neural Info. Process. Syst. 30 (2017).","journal-title":"Adv. Neural Info. Process. Syst."},{"key":"e_1_3_2_92_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10804"},{"key":"e_1_3_2_93_2","first-page":"12236","article-title":"Few-cost salient object detection with adversarial-paced learning","volume":"33","author":"Zhang Dingwen","year":"2020","unstructured":"Dingwen Zhang, Haibin Tian, and Jungong Han. 2020. Few-cost salient object detection with adversarial-paced learning. Adv. Neural Info. Process. Syst. 33 (2020), 12236\u201312247.","journal-title":"Adv. Neural Info. Process. Syst."},{"key":"e_1_3_2_94_2","first-page":"21","volume-title":"Proceedings of the NIPS Workshop on Adversarial Training","volume":"21","author":"Zhang Yizhe","year":"2016","unstructured":"Yizhe Zhang, Zhe Gan, and Lawrence Carin. 2016. Generating text via adversarial training. In Proceedings of the NIPS Workshop on Adversarial Training, Vol. 21. 21\u201332."},{"key":"e_1_3_2_95_2","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449788"},{"key":"e_1_3_2_96_2","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271795"},{"key":"e_1_3_2_97_2","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462948"},{"key":"e_1_3_2_98_2","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401177"},{"key":"e_1_3_2_99_2","unstructured":"Ziwei Zhu Jianling Wang Yin Zhang and James Caverlee. 2018. Fairness-aware recommendation of information curators. Retrieved from https:\/\/arXiv:1809.03040"}],"container-title":["ACM Transactions on Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3652854","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3652854","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:53:56Z","timestamp":1750287236000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3652854"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,29]]},"references-count":98,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,9,30]]}},"alternative-id":["10.1145\/3652854"],"URL":"https:\/\/doi.org\/10.1145\/3652854","relation":{},"ISSN":["1046-8188","1558-2868"],"issn-type":[{"value":"1046-8188","type":"print"},{"value":"1558-2868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,29]]},"assertion":[{"value":"2023-06-09","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-03-11","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-04-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}