{"type":"ScholarlyArticle","title":"Towards Sharper Generalization Bounds for Adversarial Contrastive Learning","authors":[{"name":"Wen Wen","slug":"wen-wen","given":"Wen","family":"Wen","affiliation":"College of Informatics , Huazhong Agricultural University , Wuhan 430070 , China"},{"name":"Han Li","slug":"han-li","given":"Han","family":"Li","affiliation":"College of Informatics , Huazhong Agricultural University , Wuhan 430070 , China; Engineering Research Center of Intelligent Technology for Agriculture , Ministry of Education , Wuhan 430070 , China; Key Laboratory of Smart Farming for Agricultural Animals , Wuhan 430070 , China"},{"name":"Tieliang Gong","slug":"tieliang-gong","given":"Tieliang","family":"Gong","affiliation":"School of Computer Science and Technology , Xi'an Jiaotong University , Xi'an 710049 , China"},{"name":"Hong Chen","slug":"hong-chen","given":"Hong","family":"Chen","affiliation":"College of Informatics , Huazhong Agricultural University , Wuhan 430070 , China; Engineering Research Center of Intelligent Technology for Agriculture , Ministry of Education , Wuhan 430070 , China; Key Laboratory of Smart Farming for Agricultural Animals , Wuhan 430070 , China"}],"abstract":"Recently, the enhancement on the adversarial robustness of machine learning algorithms has gained significant attention across various application domains. Given the widespread label scarcity issue in real-world data, adversarial contrastive learning (ACL) has been proposed to adversarially train robust models using unlabeled data. Despite the empirical success, its generalization behavior remains poorly understood and far from being well-characterized. This paper aims to address this issue from a learning theory perspective. We establish novel high-probability generalization bounds for the general Lipschitz loss functions. The derived bounds scale O(log(k)) with respect to the number of negative samples k, which improves the existing linear dependency bounds. Our results are generally applicable to many prediction models, including linear models and deep neural networks. In particular, we obtain an optimistic generalization bound O(1/n) under the smoothness assumption of the loss function on the sample size n. To the best of our knowledge, this is the first fast-rate bound valid for ACL. Empirical evaluations on real-world datasets verify our theoretical findings.","doi":"10.24963/ijcai.2024/574","url":"https://ijcai.org/proceedings/2024/574","pdf":"https://ijcai.org/proceedings/2024/0574.pdf","markdown":"https://ijcai.org/proceedings/2024/574.md","bibtex":"https://ijcai.org/proceedings/2024/bibtex/574","volume":{"slug":"2024","title":"Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2024","url":"https://ijcai.org/proceedings/2024/","year":2024,"location":"Jeju, Korea","dates":"3-9 August 2024","editors":"Kate Larson","isbn":"978-1-956792-04-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2024"},"section":"Machine Learning","track":"Main Track","number":574,"pages":{"first":5190,"last":5198},"keywords":["Machine Learning: ML: Adversarial machine learning","Machine Learning: ML: Self-supervised Learning","Machine Learning: ML: Learning theory"],"videos":[],"references":[{"position":1,"raw":"[Anthony et al., 1999] Martin Anthony, Peter L Bartlett, Pe- ter L Bartlett, et al. Neural network learning: Theoretical foundations, volume 9. cambridge university press Cam- bridge, 1999.","title":"Neural network learning: Theoretical foundations","authors":"Martin Anthony, Peter L Bartlett, Peter L Bartlett","year":"1999","venue":null,"doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Arora et al., 2019] Sanjeev Arora, Hrishikesh Khande- parkar, Mikhail Khodak, Orestis Plevrakis, and Nikunj Saunshi. A theoretical analysis of contrastive unsuper- vised representation learning. In International Conference on Machine Learning, pages 9904-9923, 2019.","title":"A theoretical analysis of contrastive unsupervised representation learning","authors":"Sanjeev Arora, Hrishikesh Khandeparkar, Mikhail Khodak, Orestis Plevrakis, Nikunj Saunshi","year":"2019","venue":"International Conference on Machine Learning","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Awasthi et al., 2019] Pranjal Awasthi, Abhratanu Dutta, and Aravindan Vijayaraghavan. On robustness to adversarial examples and polynomial optimization. Advances in Neu- ral Information Processing Systems, 32, 2019.","title":"On robustness to adversarial examples and polynomial optimization","authors":"Pranjal Awasthi, Abhratanu Dutta, Aravindan Vijayaraghavan","year":"2019","venue":"Advances in Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Awasthi et al., 2020] Pranjal Awasthi, Natalie Frank, and Mehryar Mohri. Adversarial learning guarantees for linear hypotheses and neural networks. In International Confer- ence on Machine Learning, pages 431-441, 2020.","title":"Adversarial learning guarantees for linear hypotheses and neural networks","authors":"Pranjal Awasthi, Natalie Frank, Mehryar Mohri","year":"2020","venue":"International Conference on Machine Learning","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bartlett and Mendelson, 2002] Peter L Bartlett and Shahar Mendelson. Rademacher and gaussian complexities: Risk bounds and structural results. Journal of Machine Learn- ing Research, 3(Nov):463-482, 2002.","title":"Rademacher and gaussian complexities: Risk bounds and structural results","authors":"L Peter, Shahar Bartlett, Mendelson","year":"2002","venue":"Journal of Machine Learning Research","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Bartlett et al., 2005] Peter L Bartlett, Olivier Bousquet, and Shahar Mendelson. Local rademacher complexities. The Annals of Statistics, 33(4):1497-1537, 2005.","title":"Local rademacher complexities","authors":"Olivier Peter L Bartlett, Shahar Bousquet, Mendelson","year":"2005","venue":"The Annals of Statistics","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Chen et al., 2020] Ting Chen, Simon Kornblith, Moham- mad Norouzi, and Geoffrey Hinton. A simple framework for contrastive learning of visual representations. In Inter- national Conference on Machine Learning, pages 1597- 1607. PMLR, 2020.","title":"A simple framework for contrastive learning of visual representations","authors":"Ting Chen, Simon Kornblith, Mohammad Norouzi, Geoffrey Hinton","year":"2020","venue":"International Conference on Machine Learning","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Fan et al., 2021] Lijie Fan, Sijia Liu, Pin-Yu Chen, Gaoyuan Zhang, and Chuang Gan. When does contrastive learning preserve adversarial robustness from pretraining to finetuning? Advances in Neural Information Process- ing Systems, 34:21480-21492, 2021.","title":"When does contrastive learning preserve adversarial robustness from pretraining to finetuning?","authors":"Lijie Fan, Sijia Liu, Pin-Yu Chen, Gaoyuan Zhang, Chuang Gan","year":"2021","venue":"Advances in Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Golowich et al., 2018] Noah Golowich, Alexander Rakhlin, and Ohad Shamir. Size-independent sample complexity of neural networks. In Conference on Learning Theory, pages 297-299. PMLR, 2018.","title":"Size-independent sample complexity of neural networks","authors":"Golowich","year":"2018","venue":"Conference on Learning Theory","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Gowal et al., 2020] Sven Gowal, Po-Sen Huang, Aaron van den Oord, Timothy Mann, and Pushmeet Kohli. Self- supervised adversarial robustness for the low-label, high- data regime. In International Conference on Learning Representations, 2020.","title":"Selfsupervised adversarial robustness for the low-label, highdata regime","authors":"Sven Gowal, Po-Sen Huang, Aaron Van Den Oord, Timothy Mann, Pushmeet Kohli","year":"2020","venue":"International Conference on Learning Representations","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Grill et al., 2020] Jean-Bastien Grill, Florian Strub, Flo- rent Altché, Corentin Tallec, Pierre Richemond, Elena Buchatskaya, Carl Doersch, Bernardo Avila Pires, Zhao- han Guo, Mohammad Gheshlaghi Azar, et al. Bootstrap your own latent-a new approach to self-supervised learn- ing. Advances in Neural Information Processing Systems, 33:21271-21284, 2020.","title":"Bootstrap your own latent-a new approach to self-supervised learning","authors":"Jean-Bastien Grill, Florian Strub, Florent Altché, Corentin Tallec, Pierre Richemond, Elena Buchatskaya, Carl Doersch, Bernardo Avila Pires, Zhaohan Guo, Mohammad Gheshlaghi Azar","year":"2020","venue":"Advances in Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Hahnloser et al., 2000] Richard HR Hahnloser, Rahul Sarpeshkar, Misha A Mahowald, Rodney J Douglas, and H Sebastian Seung. Digital selection and analogue amplification coexist in a cortex-inspired silicon circuit. Nature, 405(6789):947-951, 2000.","title":"Digital selection and analogue amplification coexist in a cortex-inspired silicon circuit","authors":"Rahul Richard Hr Hahnloser, Misha A Sarpeshkar, Rodney J Mahowald, H Douglas, Seung Sebastian","year":"2000","venue":"Nature","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[He et al., 2020] Kaiming He, Haoqi Fan, Yuxin Wu, Sain- ing Xie, and Ross Girshick. Momentum contrast for un- supervised visual representation learning. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pat- tern Recognition, pages 9729-9738, 2020.","title":"Momentum contrast for unsupervised visual representation learning","authors":"Kaiming He, Haoqi Fan, Yuxin Wu, Saining Xie, Ross Girshick","year":"2020","venue":"Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Hendrycks and Dietterich, 2019] Dan Hendrycks and Thomas Dietterich. Benchmarking neural network robustness to common corruptions and perturbations. In International Conference on Learning Representations, 2019.","title":"Benchmarking neural network robustness to common corruptions and perturbations","authors":"Dietterich Hendrycks, Dan Hendrycks, Thomas Dietterich","year":"2019","venue":"International Conference on Learning Representations","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Ho and Nvasconcelos, 2020] Chih-Hui Ho and Nuno Nvas- concelos. Contrastive learning with adversarial exam- ples. Advances in Neural Information Processing Systems, 33:17081-17093, 2020.","title":"Contrastive learning with adversarial examples","authors":"Nvasconcelos Ho","year":"2020","venue":"Advances in Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Jiang et al., 2020] Ziyu Jiang, Tianlong Chen, Ting Chen, and Zhangyang Wang. Robust pre-training by adversar- ial contrastive learning. Advances in Neural Information Processing Systems, 33:16199-16210, 2020.","title":"Robust pre-training by adversarial contrastive learning","authors":"Ziyu Jiang, Tianlong Chen, Ting Chen, Zhangyang Wang","year":"2020","venue":"Advances in Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Khim and Loh, 2018] Justin Khim and Po-Ling Loh. Ad- versarial risk bounds via function transformation. ArXiv Preprint ArXiv:1810.09519, 2018.","title":"Adversarial risk bounds via function transformation","authors":"Loh Khim, Justin Khim, Po-Ling Loh","year":"2018","venue":null,"doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Khosla et al., 2020] Prannay Khosla, Piotr Teterwak, Chen Wang, Aaron Sarna, Yonglong Tian, Phillip Isola, Aaron Maschinot, Ce Liu, and Dilip Krishnan. Supervised con- trastive learning. Advances in Neural Information Process- ing Systems, 33:18661-18673, 2020.","title":"Supervised contrastive learning","authors":"Khosla","year":"2020","venue":"Advances in Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Kim et al., 2020] Minseon Kim, Jihoon Tack, and Sung Ju Hwang. Adversarial self-supervised contrastive learn- ing. Advances in Neural Information Processing Systems, 33:2983-2994, 2020.","title":"Adversarial self-supervised contrastive learning","authors":"Kim","year":"2020","venue":"Advances in Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Kingma and Ba, 2015] Diederik P Kingma and Jimmy Ba. Adam: A method for stochastic optimization. In Interna- tional Conference on Learning Representations, 2015.","title":"Adam: A method for stochastic optimization","authors":"P Diederik, Jimmy Kingma, Ba","year":"2015","venue":"International Conference on Learning Representations","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Lee et al., 2021] Seanie Lee, Dong Bok Lee, and Sung Ju Hwang. Contrastive learning with adversarial perturba- tions for conditional text generation. In International Con- ference on Learning Representations, 2021.","title":"Contrastive learning with adversarial perturbations for conditional text generation","authors":"Seanie Lee, Dong Bok Lee, Sung Ju Hwang","year":"2021","venue":"International Conference on Learning Representations","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Lei et al., 2023] Yunwen Lei, Tianbao Yang, Yiming Ying, and Ding-Xuan Zhou. Generalization analysis for contrastive representation learning. ArXiv Preprint ArXiv:2302.12383, 2023.","title":"Generalization analysis for contrastive representation learning","authors":"Lei","year":"2023","venue":null,"doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Lin et al., 2019] Ji Lin, Chuang Gan, and Song Han. De- fensive quantization: When efficiency meets robustness. In International Conference on Learning Representations, 2019.","title":"Defensive quantization: When efficiency meets robustness","authors":"Ji Lin, Chuang Gan, Song Han","year":"2019","venue":"International Conference on Learning Representations","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Ling et al., 2003] Charles X Ling, Jin Huang, and Harry Zhang. Auc: a better measure than accuracy in com- paring learning algorithms. In Advances in Artificial In- telligence: 16th Conference of the Canadian Society for Computational Studies of Intelligence, AI 2003, Halifax, Canada, June 11-13, 2003, Proceedings 16, pages 329- 341. Springer, 2003.","title":"Auc: a better measure than accuracy in comparing learning algorithms","authors":"Jin Charles X Ling, Harry Huang, Zhang","year":"2003","venue":"Advances in Artificial Intelligence: 16th Conference of the Canadian Society for Computational Studies of Intelligence, AI 2003","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Liu et al., 2022] Ye Liu, Yaya Cheng, Lianli Gao, Xiang- long Liu, Qilong Zhang, and Jingkuan Song. Practical evaluation of adversarial robustness via adaptive auto at- tack. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 15105- 15114, 2022.","title":"Practical evaluation of adversarial robustness via adaptive auto attack","authors":"Ye Liu, Yaya Cheng, Lianli Gao, Xianglong Liu, Qilong Zhang, Jingkuan Song","year":"2022","venue":"Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Ma et al., 2021] Xingjun Ma, Yuhao Niu, Lin Gu, Yisen Wang, Yitian Zhao, James Bailey, and Feng Lu. Un- derstanding adversarial attacks on deep learning based medical image analysis systems. Pattern Recognition, 110:107332, 2021.","title":"Understanding adversarial attacks on deep learning based medical image analysis systems","authors":"Xingjun Ma, Yuhao Niu, Lin Gu, Yisen Wang, Yitian Zhao, James Bailey, Feng Lu","year":"2021","venue":"Pattern Recognition","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Madry et al., 2018] Aleksander Madry, Aleksandar Makelov, Ludwig Schmidt, Dimitris Tsipras, and Adrian Vladu. Towards deep learning models resistant to adversarial attacks. In International Conference on Learning Representations, 2018.","title":"Towards deep learning models resistant to adversarial attacks","authors":"Aleksander Madry, Aleksandar Makelov, Ludwig Schmidt, Dimitris Tsipras, Adrian Vladu","year":"2018","venue":"International Conference on Learning Representations","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Maurer, 2016] Andreas Maurer. A vector-contraction in- equality for rademacher complexities. In Algorithmic Learning Theory: 27th International Conference, ALT 2016, Bari, Italy, October 19-21, 2016, Proceedings 27, pages 3-17. Springer, 2016.","title":"A vector-contraction inequality for rademacher complexities","authors":"Andreas Maurer","year":"2016","venue":"Algorithmic Learning Theory: 27th International Conference, ALT 2016","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Misra and Maaten, 2020] Ishan Misra and Laurens van der Maaten. Self-supervised learning of pretext-invariant rep- resentations. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 6707- 6717, 2020.","title":"Self-supervised learning of pretext-invariant representations","authors":"Maaten Misra, Ishan Misra, Laurens Van Der Maaten","year":"2020","venue":"Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Mustafa et al., 2022] Waleed Mustafa, Yunwen Lei, and Marius Kloft. On the generalization analysis of adversarial learning. In International Conference on Machine Learn- ing, pages 16174-16196, 2022.","title":"On the generalization analysis of adversarial learning","authors":"Waleed Mustafa, Yunwen Lei, Marius Kloft","year":"2022","venue":"International Conference on Machine Learning","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Neyshabur et al., 2015] Behnam Neyshabur, Ryota Tomioka, and Nathan Srebro. Norm-based capacity control in neural networks. In Conference on Learning Theory, pages 1376-1401. PMLR, 2015.","title":"Norm-based capacity control in neural networks","authors":"Ryota Behnam Neyshabur, Nathan Tomioka, Srebro","year":"2015","venue":"Conference on Learning Theory","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Reeve and Kaban, 2020] Henry Reeve and Ata Kaban. Op- timistic bounds for multi-output learning. In Interna- tional Conference on Machine Learning, pages 8030- 8040, 2020.","title":"Optimistic bounds for multi-output learning","authors":"Kaban ; ] Henry Reeve, Ata Reeve, Kaban","year":"2020","venue":"International Conference on Machine Learning","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Srebro et al., 2010] Nathan Srebro, Karthik Sridharan, and Ambuj Tewari. Smoothness, low noise and fast rates. Advances in Neural Information Processing Systems, 23, 2010.","title":"Smoothness, low noise and fast rates","authors":"Nathan Srebro, Karthik Sridharan, Ambuj Tewari","year":"2010","venue":"Advances in Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Szegedy et al., 2014] Christian Szegedy, Wojciech Zaremba, Ilya Sutskever, Joan Bruna, Dumitru Erhan, Ian Goodfellow, and Rob Fergus. Intriguing properties of neural networks. In International Conference on Learning Representations, 2014.","title":"Intriguing properties of neural networks","authors":"Szegedy","year":"2014","venue":"International Conference on Learning Representations","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Wu et al., 2018] Zhirong Wu, Yuanjun Xiong, Stella X Yu, and Dahua Lin. Unsupervised feature learning via non- parametric instance discrimination. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 3733-3742, 2018.","title":"Unsupervised feature learning via nonparametric instance discrimination","authors":"Zhirong Wu, Yuanjun Xiong, Stella X Yu, Dahua Lin","year":"2018","venue":"Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition","doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[Xiao et al., 2022] Jiancong Xiao, Yanbo Fan, Ruoyu Sun, Jue Wang, and Zhi-Quan Luo. Stability analysis and gen- eralization bounds of adversarial training. In Advances in Neural Information Processing Systems, 2022.","title":"Stability analysis and generalization bounds of adversarial training","authors":"Xiao","year":"2022","venue":"Advances in Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Xing et al., 2021] Yue Xing, Qifan Song, and Guang Cheng. On the algorithmic stability of adversarial train- ing. Advances in Neural Information Processing Systems, 34:26523-26535, 2021.","title":"On the algorithmic stability of adversarial training","authors":"Yue Xing, Qifan Song, Guang Cheng","year":"2021","venue":"Advances in Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Xu et al., 2019] Kaidi Xu, Sijia Liu, Pu Zhao, Pin-Yu Chen, Huan Zhang, Quanfu Fan, Deniz Erdogmus, Yanzhi Wang, and Xue Lin. Structured adversarial attack: Towards gen- eral implementation and better interpretability. In Interna- tional Conference on Learning Representations, 2019.","title":"Structured adversarial attack: Towards general implementation and better interpretability","authors":"Kaidi Xu, Sijia Liu, Pu Zhao, Pin-Yu Chen, Huan Zhang, Quanfu Fan, Deniz Erdogmus, Yanzhi Wang, Xue Lin","year":"2019","venue":"International Conference on Learning Representations","doi":null,"url":null,"internal_url":null},{"position":39,"raw":"[Yin et al., 2019] Dong Yin, Ramchandran Kannan, and Pe- ter Bartlett. Rademacher complexity for adversarially ro- bust generalization. In International Conference on Ma- chine Learning, pages 7085-7094, 2019.","title":"Rademacher complexity for adversarially robust generalization","authors":"Dong Yin, Ramchandran Kannan, Peter Bartlett","year":"2019","venue":"International Conference on Machine Learning","doi":null,"url":null,"internal_url":null},{"position":40,"raw":"[Zhang et al., 2023] Yanghao Zhang, Wenjie Ruan, Fu Wang, and Xiaowei Huang. Generalizing univer- sal adversarial perturbations for deep neural networks. Machine Learning, 112(5):1597-1626, 2023.","title":"Generalizing universal adversarial perturbations for deep neural networks","authors":"Zhang","year":"2023","venue":"Machine Learning","doi":null,"url":null,"internal_url":null},{"position":41,"raw":"[Zheng et al., 2020] Haizhong Zheng, Ziqi Zhang, Juncheng Gu, Honglak Lee, and Atul Prakash. Efficient adversarial training with transferable adversarial examples. In Pro- ceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 1181-1190, 2020.","title":"Efficient adversarial training with transferable adversarial examples","authors":"Zheng","year":"2020","venue":"Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition","doi":null,"url":null,"internal_url":null},{"position":42,"raw":"[Zhou, 2002] Ding-Xuan Zhou. The covering number in learning theory. Journal of Complexity, 18(3):739-767, 2002.","title":"The covering number in learning theory","authors":"Ding-Xuan Zhou","year":"2002","venue":"Journal of Complexity","doi":null,"url":null,"internal_url":null},{"position":43,"raw":"[Zou and Liu, 2023] Xin Zou and Weiwei Liu. Generaliza- tion bounds for adversarial contrastive learning. Machine Learning Research, 24:1-54, 2023.","title":"Generalization bounds for adversarial contrastive learning","authors":"Liu ; ] Xin Zou, Weiwei Zou, Liu","year":"2023","venue":"Machine Learning Research","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}