ABSTRACT The success of minimax learning problems of generative adversarial networks (GANs) and adversarial training has been observed to depend on the minimax optimization algorithm used for their training. This dependence is commonly attributed to the convergence speed and robustness properties of the underlying optimization algorithm. In this talk, we present theoretical and numerical results…

Tea talks are 20-minute-long informal chalk-talks for the purpose of sharing ideas and making others aware of some of the topics that may be of interest to the LIDS and Stats audience. If you are interested in presenting in the upcoming tea talks, please email lids_stats_tea@mit.edu.