Rosca et al., 2021 - Google Patents
Discretization drift in two-player gamesRosca et al., 2021
View PDF- Document ID
- 5098459478601130257
- Author
- Rosca M
- Wu Y
- Dherin B
- Barrett D
- Publication year
- Publication venue
- International Conference on Machine Learning
External Links
Snippet
Gradient-based methods for two-player games produce rich dynamics that can solve challenging problems, yet can be difficult to stabilize and understand. Part of this complexity originates from the discrete update steps given by simultaneous or alternating gradient …
- 238000004458 analytical method 0 abstract description 72
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N99/00—Subject matter not provided for in other groups of this subclass
- G06N99/005—Learning machines, i.e. computer in which a programme is changed according to experience gained by the machine itself during a complete run
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/50—Computer-aided design
- G06F17/5009—Computer-aided design using simulation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computer systems based on biological models
- G06N3/02—Computer systems based on biological models using neural network models
- G06N3/08—Learning methods
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computer systems based on biological models
- G06N3/12—Computer systems based on biological models using genetic models
- G06N3/126—Genetic algorithms, i.e. information processing using digital simulations of the genetic system
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computer systems based on biological models
- G06N3/02—Computer systems based on biological models using neural network models
- G06N3/04—Architectures, e.g. interconnection topology
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N5/00—Computer systems utilising knowledge based models
- G06N5/02—Knowledge representation
- G06N5/022—Knowledge engineering, knowledge acquisition
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N5/00—Computer systems utilising knowledge based models
- G06N5/04—Inference methods or devices
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N7/00—Computer systems based on specific mathematical models
- G06N7/005—Probabilistic networks
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F19/00—Digital computing or data processing equipment or methods, specially adapted for specific applications
- G06F19/10—Bioinformatics, i.e. methods or systems for genetic or protein-related data processing in computational molecular biology
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/18—Digital computers in general; Data processing equipment in general in which a programme is changed according to experience gained by the computer itself during a complete run; Learning machines
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06K—RECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K9/00—Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
- G06K9/62—Methods or arrangements for recognition using electronic means
- G06K9/6217—Design or setup of recognition systems and techniques; Extraction of features in feature space; Clustering techniques; Blind source separation
- G06K9/6232—Extracting features by transforming the feature space, e.g. multidimensional scaling; Mappings, e.g. subspace methods
- G06K9/6247—Extracting features by transforming the feature space, e.g. multidimensional scaling; Mappings, e.g. subspace methods based on an approximation criterion, e.g. principal component analysis
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Song et al. | Observational overfitting in reinforcement learning | |
Damian et al. | Label noise sgd provably prefers flat global minimizers | |
Ma et al. | Is there an analog of Nesterov acceleration for gradient-based MCMC? | |
Abdullah et al. | Wasserstein robust reinforcement learning | |
Nouiehed et al. | Solving a class of non-convex min-max games using iterative first order methods | |
Rosca et al. | Discretization drift in two-player games | |
L. Salemi et al. | Gaussian Markov random fields for discrete optimization via simulation: Framework and algorithms | |
Tong et al. | Effective federated adaptive gradient methods with non-iid decentralized data | |
Bai et al. | Evolutionary reinforcement learning: A survey | |
Heess et al. | Learning to pass expectation propagation messages | |
Wilson | Lyapunov arguments in optimization | |
LeDell | Scalable ensemble learning and computationally efficient variance estimation | |
Kubota et al. | Temporal information processing induced by quantum noise | |
Gao et al. | Value function based difference-of-convex algorithm for bilevel hyperparameter selection problems | |
Pourchot et al. | Importance mixing: Improving sample reuse in evolutionary policy search methods | |
Kim et al. | Imitation with neural density models | |
Anirudh et al. | Accurate calibration of agent-based epidemiological models with neural network surrogates | |
Liu et al. | Distributionally robust off-dynamics reinforcement learning: Provable efficiency with linear function approximation | |
Wang et al. | JustQ: Automated deployment of fair and accurate quantum neural networks | |
Zhu et al. | Adversarially robust kernel smoothing | |
Vetter et al. | Sourcerer: Sample-based maximum entropy source distribution estimation | |
Chen et al. | Attention Loss Adjusted Prioritized Experience Replay | |
Peters et al. | Noise-aware qubit assignment on NISQ hardware using simulated annealing and Loschmidt Echoes | |
Luk et al. | A coordinate-free construction of scalable natural gradient | |
Cristofari et al. | New active-set frank-wolfe variants for minimization over the simplex and the ℓ1-ball |