Seminar, Hosted by Institute for Computational and Experimental Research in Mathematics (ICERM), Brown University
Asynchronous Iterative Methods: From Numerical Solvers to Reinforcement Learning
Abstract
Edmond Chow examines how asynchronous updates improve parallel iterative computation. The first part covers asynchronous versions of classical first- and second-order linear iterations, Chebyshev methods, and multigrid, with attention to efficiency and fault tolerance. The second introduces reinforcement learning and asynchronous state-value estimation for finding optimal policies. When the state space is too large to enumerate, these updates focus computational effort on frequently visited regions.