报告人
Chengchang Liu
Chinese University of Hong Kong
时间
2025年9月30日 星期二
下午 14:00-15:00
地点
102会议室
Abstract
Minimax optimization has garnered significant attention in recent years due to its diverse applications in generative modeling, fairness-aware machine learning, game theory, and more. Various first- and second-order methods have been developed with "optimal" oracle complexities. This talk will introduce several novel methods that achieve even faster convergence rates or better computational complexities compared to the existing optimal methods by effectively incorporating curvature information and leveraging the min-max structure.
Biography
Chengchang Liu is currently a Ph.D candidate at the Chinese University of Hong Kong (CUHK), supervised by Prof. John C.S. Lui. His research interests include second-order optimization, distributed optimization, and quantum optimization. His research was awarded by COLT best student paper in 2025 and KDD best paper runner-up in 2022. His works have also been selected as oral or spotlight at ICLR and NeurIPS. He is the recipient of the NSFC basic research scheme for Ph.D student.
