Multi-Agent Learning of Numerical Methods for Hyperbolic PDEs with Factored Dec-MDP
Yiwei Fu, Dheeraj S.K. Kapilavai, Elliot Way

TL;DR
This paper models the learning of numerical methods for hyperbolic PDEs as a factored Dec-MDP, enabling multi-agent RL to develop adaptable and generalizable schemes like WENO.
Contribution
It formalizes the use of factored Dec-MDPs for learning numerical PDE solvers, introducing RL and behavior cloning approaches for multi-agent systems.
Findings
RL-trained agents generalize across discretizations and dimensions
Homogeneous policies can be learned for all agents using policy gradients
The approach produces adaptable numerical methods for hyperbolic PDEs
Abstract
Factored decentralized Markov decision process (Dec-MDP) is a framework for modeling sequential decision making problems in multi-agent systems. In this paper, we formalize the learning of numerical methods for hyperbolic partial differential equations (PDEs), specifically the Weighted Essentially Non-Oscillatory (WENO) scheme, as a factored Dec-MDP problem. We show that different reward formulations lead to either reinforcement learning (RL) or behavior cloning, and a homogeneous policy could be learned for all agents under the RL formulation with a policy gradient algorithm. Because the trained agents only act on their local observations, the multi-agent system can be used as a general numerical method for hyperbolic PDEs and generalize to different spatial discretizations, episode lengths, dimensions, and even equation types.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
