A Minimax Approach for Learning Gaussian Mixtures
Generative adversarial networks (GANs) learn the distribution of observed samples through a zero-sum game between two machine players, a generator and a discriminator. While GANs achieve great success in learning the complex distribution of image, sound, and text data, they perform suboptimally in l...
Main Author: | Wang, William Wei |
---|---|
Other Authors: | Jadbabaie, Ali |
Format: | Thesis |
Published: |
Massachusetts Institute of Technology
2022
|
Online Access: | https://hdl.handle.net/1721.1/139991 |
Similar Items
-
A special algorithm for learning mixtures of spherical Gaussians
by: Wang, Grant J. (Grant Jenhorn), 1979-
Published: (2014) -
Robustly Learning General Mixtures of Gaussians
by: Liu, Allen, et al.
Published: (2023) -
Optimization and Generalization of Minimax Algorithms
by: Pattathil, Sarath
Published: (2023) -
Learning a Mixture of Gaussians via Mixed-Integer Optimization
by: Bandi, Hari, et al.
Published: (2021) -
Multi-feature spectral clustering with minimax optimization
by: Wang, Hongxing, et al.
Published: (2015)