ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2002.05820
  4. Cited By
A Limited-Capacity Minimax Theorem for Non-Convex Games or: How I
  Learned to Stop Worrying about Mixed-Nash and Love Neural Nets

A Limited-Capacity Minimax Theorem for Non-Convex Games or: How I Learned to Stop Worrying about Mixed-Nash and Love Neural Nets

14 February 2020
Gauthier Gidel
David Balduzzi
Wojciech M. Czarnecki
M. Garnelo
Yoram Bachrach
ArXivPDFHTML

Papers citing "A Limited-Capacity Minimax Theorem for Non-Convex Games or: How I Learned to Stop Worrying about Mixed-Nash and Love Neural Nets"

2 / 2 papers shown
Title
Adversarial Example Games
Adversarial Example Games
A. Bose
Gauthier Gidel
Hugo Berrard
Andre Cianflone
Pascal Vincent
Simon Lacoste-Julien
William L. Hamilton
AAML
GAN
38
51
0
01 Jul 2020
High Fidelity Speech Synthesis with Adversarial Networks
High Fidelity Speech Synthesis with Adversarial Networks
Mikolaj Binkowski
Jeff Donahue
Sander Dieleman
Aidan Clark
Erich Elsen
Norman Casagrande
Luis C. Cobo
Karen Simonyan
243
239
0
25 Sep 2019
1