{"list":"other","total":71,"rows":[{"id":"2203.00667","title":"Generative Adversarial Networks","created":"2022-03-01","cited_by_count":5627},{"id":"1810.00826","title":"How Powerful are Graph Neural Networks?","created":"2018-10-01","cited_by_count":4393},{"id":"1502.01852","title":"Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classification","created":"2015-02-06","cited_by_count":3611},{"id":"1606.03498","title":"Improved Techniques for Training GANs","created":"2016-06-10","cited_by_count":2970},{"id":"1912.06680","title":"Dota 2 with Large Scale Deep Reinforcement Learning","created":"2019-12-13","cited_by_count":1103},{"id":"1703.03864","title":"Evolution Strategies as a Scalable Alternative to Reinforcement Learning","created":"2017-03-10","cited_by_count":574},{"id":"1711.00832","title":"A Unified Game-Theoretic Approach to Multiagent Reinforcement Learning","created":"2017-11-02","cited_by_count":268},{"id":"1709.04326","title":"Learning with Opponent-Learning Awareness","created":"2017-09-13","cited_by_count":222},{"id":"1711.00141","title":"Training GANs with Optimism","created":"2017-10-31","cited_by_count":217},{"id":"2001.06937","title":"A Review on Generative Adversarial Networks: Algorithms, Theory, and Applications","created":"2020-01-20","cited_by_count":209},{"id":"1312.2139","title":"Optimal rates for zero-order convex optimization: the power of two function evaluations","created":"2013-12-07","cited_by_count":198},{"id":"1703.00573","title":"Generalization and Equilibrium in Generative Adversarial Nets (GANs)","created":"2017-03-02","cited_by_count":166},{"id":"2206.15378","title":"Mastering the Game of Stratego with Model-Free Multiagent Reinforcement Learning","created":"2022-06-30","cited_by_count":131},{"id":"1802.05642","title":"The Mechanics of n-Player Differentiable Games","created":"2018-02-15","cited_by_count":118},{"id":"1507.08752","title":"An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback","created":"2015-07-31","cited_by_count":111},{"id":"1705.10461","title":"The Numerics of GANs","created":"2017-05-30","cited_by_count":105},{"id":"1903.03088","title":"Self-Tuning Networks: Bilevel Optimization of Hyperparameters using Structured Best-Response Functions","created":"2019-03-07","cited_by_count":105},{"id":"1712.04086","title":"PacGAN: The power of two samples in generative adversarial networks","created":"2017-12-12","cited_by_count":104},{"id":"2103.05180","title":"An Introduction to Deep Generative Modeling","created":"2021-03-09","cited_by_count":104},{"id":"2006.05132","title":"A Survey on Generative Adversarial Networks: Variants, Applications, and Training","created":"2020-06-09","cited_by_count":97},{"id":"2006.07228","title":"FedGAN: Federated Generative Adversarial Networks for Distributed Data","created":"2020-06-12","cited_by_count":90},{"id":"1908.08465","title":"On the convergence of single-call stochastic extra-gradient methods","created":"2019-08-22","cited_by_count":89},{"id":"2111.05803","title":"Gradients are Not All You Need","created":"2021-11-10","cited_by_count":86},{"id":"1608.07310","title":"Learning in games with continuous action sets and unknown payoff functions","created":"2016-08-25","cited_by_count":81},{"id":"1802.09419","title":"Stochastic Hyperparameter Optimization through Hypernetworks","created":"2018-02-26","cited_by_count":73},{"id":"1809.04040","title":"Solving Imperfect-Information Games via Discounted Regret Minimization","created":"2018-09-11","cited_by_count":68},{"id":"1905.01332","title":"A Theoretical and Empirical Comparison of Gradient Approximations in Derivative-Free Optimization","created":"2019-05-03","cited_by_count":68},{"id":"1611.01673","title":"Generative Multi-Adversarial Networks","created":"2016-11-05","cited_by_count":60},{"id":"2002.00057","title":"Last Iterate is Slower than Averaged Iterate in Smooth Convex-Concave Saddle Point Problems","created":"2020-01-31","cited_by_count":60},{"id":"1704.02906","title":"Multi-Agent Diverse Generative Adversarial Networks","created":"2017-04-10","cited_by_count":59},{"id":"2007.14358","title":"Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descent","created":"2020-07-28","cited_by_count":57},{"id":"1709.03831","title":"Dual Discriminator Generative Adversarial Nets","created":"2017-09-12","cited_by_count":55},{"id":"2006.09065","title":"The limits of min-max optimization algorithms: convergence to spurious non-critical sets","created":"2020-06-16","cited_by_count":50},{"id":"1811.03850","title":"MD-GAN: Multi-Discriminator Generative Adversarial Networks for Distributed Datasets","created":"2018-11-09","cited_by_count":49},{"id":"1811.08469","title":"Stable Opponent Shaping in Differentiable Games","created":"2018-11-20","cited_by_count":49},{"id":"1804.05464","title":"On Gradient-Based Learning in Continuous Games","created":"2018-04-16","cited_by_count":48},{"id":"1905.04926","title":"Differentiable Game Mechanics","created":"2019-05-13","cited_by_count":43},{"id":"2203.04098","title":"COLA: Consistent Learning with Opponent-Learning Awareness","created":"2022-03-08","cited_by_count":38},{"id":"1901.00838","title":"On Finding Local Nash Equilibria (and Only Local Nash Equilibria) in Zero-Sum Games","created":"2019-01-03","cited_by_count":35},{"id":"1910.07512","title":"On Solving Minimax Optimization Locally: A Follow-the-Ridge Approach","created":"2019-10-16","cited_by_count":34},{"id":"2103.06426","title":"XDO: A Double Oracle Algorithm for Extensive-Form Games","created":"2021-03-11","cited_by_count":34},{"id":"1905.12103","title":"Competitive Gradient Descent","created":"2019-05-28","cited_by_count":32},{"id":"1903.05614","title":"Computing Approximate Equilibria in Sequential Adversarial Games by Exploitability Descent","created":"2019-03-13","cited_by_count":31},{"id":"1906.01217","title":"Convergence of Learning Dynamics in Stackelberg Games","created":"2019-06-04","cited_by_count":28},{"id":"2004.09677","title":"Approximate exploitability: Learning a best response in large games","created":"2020-04-20","cited_by_count":23},{"id":"2010.13514","title":"Delta-STN: Efficient Bilevel Optimization for Neural Networks using Structured Response Jacobians","created":"2020-10-26","cited_by_count":17},{"id":"1808.01531","title":"Global Convergence to the Equilibrium of GANs using Variational Inequalities","created":"2018-08-04","cited_by_count":15},{"id":"1805.10364","title":"Detecting Deceptive Reviews using Generative Adversarial Networks","created":"2018-05-25","cited_by_count":12},{"id":"1401.3888","title":"Stackelberg vs. Nash in Security Games: An Extended Investigation of Interchangeability, Equivalence, and Uniqueness","created":"2014-01-16","cited_by_count":11},{"id":"2106.01285","title":"Sample-based Approximation of Nash in Large Many-Player Games via Gradient Descent","created":"2021-06-02","cited_by_count":11},{"id":"2207.06541","title":"Self-Play PSRO: Toward Optimal Populations in Two-Player Zero-Sum Games","created":"2022-07-13","cited_by_count":11},{"id":"2009.12185","title":"Double Oracle Algorithm for Computing Equilibria in Continuous Games","created":"2020-09-25","cited_by_count":9},{"id":"2201.07700","title":"Anytime PSRO for Two-Player Zero-Sum Games","created":"2022-01-19","cited_by_count":9},{"id":"1911.07755","title":"Learning Probably Approximately Correct Maximin Strategies in Simulation-Based Games with Infinite Strategy Spaces","created":"2019-11-18","cited_by_count":8},{"id":"2106.01488","title":"Minimax Optimization with Smooth Algorithmic Adversaries","created":"2021-06-02","cited_by_count":8},{"id":"1811.08010","title":"Stackelberg GAN: Towards Provable Minimax Equilibrium via Multi-Generator Architectures","created":"2018-11-19","cited_by_count":7},{"id":"2001.03376","title":"microbatchGAN: Stimulating Diversity with Multi-Adversarial Discrimination","created":"2020-01-10","cited_by_count":7},{"id":"1905.05927","title":"Game Theoretic Optimization via Gradient-based Nikaido-Isoda Function","created":"2019-05-15","cited_by_count":6},{"id":"2106.06976","title":"Game of GANs: Game-Theoretical Models for Generative Adversarial Networks","created":"2021-06-13","cited_by_count":6},{"id":"2208.02036","title":"Computing Bayes Nash Equilibrium Strategies in Auction Games via Simultaneous Online Dual Averaging","created":"2022-08-03","cited_by_count":6},{"id":"2210.10207","title":"Exploitability Minimization in Games and Beyond","created":"2022-10-18","cited_by_count":6},{"id":"1612.01294","title":"Message Passing Multi-Agent GANs","created":"2016-12-05","cited_by_count":3},{"id":"1612.07547","title":"Equilibrium Approximation Quality of Current No-Limit Poker Bots","created":"2016-12-22","cited_by_count":3},{"id":"2006.07443","title":"Algorithm for Computing Approximate Nash Equilibrium in Continuous Games with Application to Continuous Blotto","created":"2020-06-12","cited_by_count":3},{"id":"2103.12685","title":"Generative Minimization Networks: Training GANs Without Competition","created":"2021-03-23","cited_by_count":3},{"id":"2109.04178","title":"Multiple Oracle Algorithm to Solve Continuous Games","created":"2021-09-09","cited_by_count":3},{"id":"2103.00187","title":"Multi-agent Reinforcement Learning in OpenSpiel: A Reproduction Report","created":"2021-02-27","cited_by_count":2},{"id":"2111.08565","title":"Polymatrix Competitive Gradient Descent","created":"2021-11-16","cited_by_count":1},{"id":"2208.09452","title":"Unified Policy Optimization for Continuous-action Reinforcement Learning in Non-stationary Tasks and Games","created":"2022-08-19","cited_by_count":1},{"id":"2208.09690","title":"Gradient Descent Ascent in Min-Max Stackelberg Games","created":"2022-08-20","cited_by_count":1},{"id":"2212.09941","title":"Anticipatory Fictitious Play","created":"2022-12-20","cited_by_count":1}],"next_cursor":null}