MINIMAX OPTIMIZATION WITH SMOOTH ALGORITHMIC ADVERSARIES

Computer Science

• Experimental Result 100%
• Generative Adversarial Networks 100%
• Learning System 100%
• Machine Learning 100%
• Optimization Problem 100%
• Starting Point 100%
• Stationary Point 100%
• Theoretical Framework 100%

Keyphrases

• Adversary 100%
• Computable 33%
• Computational Budget 33%
• Existing Algorithms 33%
• Generative Adversarial Networks 33%
• Limit Cycle 33%
• Machine Learning Paradigms 33%
• Minimax Optimization 100%
• Non-convexity 66%
• Nonconcave 66%
• NP-hard 33%
• Number of Iterations 33%
• Optimization Problem 33%
• Smoothing Algorithm 66%
• Stationary Point 33%
• Stochastic Gradient Descent 33%

Mathematics

• Limit Cycle 33%
• Minimax 100%
• Optimality 33%
• Polynomial 33%
• Starting Point 33%
• Stationary Point 33%
• Stochastics 33%