Alternating Gradient Descent Ascent for Nonconvex Min-Max Problems in Robust Learning and GANs.
Songtao LuRahul SinghXiangyi ChenYongxin ChenMingyi HongPublished in: ACSSC (2019)
Keyphrases
- min max
- learning algorithm
- objective function
- solving problems
- optimization problems
- learning process
- learning tasks
- learning systems
- reinforcement learning
- artificial neural networks
- probabilistic model
- np complete
- unsupervised learning
- max min
- learning problems
- knowledge acquisition
- online learning
- markov random field
- cost function
- learning environment
- e learning