Coordinate Methods for Matrix Games
Offered By: IEEE via YouTube
Course Description
Overview
Explore coordinate methods for solving matrix games in this 25-minute IEEE conference talk presented by researchers from Stanford University. Delve into bilinear saddle point problems, algorithms for matrix games, and the rationale behind using coordinate methods. Examine key technical challenges and learn from a specific matrix games example. Gain insights into the design of estimators, implementation strategies, and data structure interfaces. Investigate a simpler problem with zero drift before reaching the concluding remarks on this advanced topic in game theory and optimization.
Syllabus
Intro
Bilinear saddle point problems
Algorithms for matrix games
Why coordinate methods?
Key technical challenges
Example: matrix games
Design of estimators
Implementation
Data structure interface
A simpler problem: zero drift
Conclusion
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against NatureIEEE via YouTube Computation in the Brain Tutorial - Part 2
IEEE via YouTube Computation in the Brain - Part 1
IEEE via YouTube Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model
IEEE via YouTube Cookbook Lower Bounds for Statistical Inference in Distributed and Constrained Settings - Part 1
IEEE via YouTube