🤖 AI Summary
This work proposes RLMesh, a novel framework that introduces reinforcement learning to surrogate modeling for parametric partial differential equations (PDEs) by optimizing mesh generation. Traditional approaches rely on numerous high-resolution simulations, which are computationally expensive. RLMesh addresses this by adaptively allocating mesh points non-uniformly, concentrating resolution in regions most critical to solution accuracy. To enhance training efficiency, the framework employs a lightweight surrogate model to accelerate the reinforcement learning process. Evaluated across multiple PDE benchmarks, RLMesh achieves accuracy comparable to baseline methods while requiring significantly fewer simulation queries, thereby substantially improving surrogate training efficiency and enabling solver-level spatial adaptivity.
📝 Abstract
Deep surrogate models for parametric partial differential equations (PDEs) can deliver high-fidelity approximations but remain prohibitively data-hungry: training often requires thousands of fine-grid simulations, each incurring substantial computational cost. To address this challenge, we introduce RLMesh, an end-to-end framework for efficient surrogate training under limited simulation budget. The key idea is to use reinforcement learning (RL) to adaptively allocate mesh grid points non-uniformly within each simulation domain, focusing numerical resolution in regions most critical for accurate PDE solutions. A lightweight proxy model further accelerates RL training by providing efficient reward estimates without full surrogate retraining. Experiments on PDE benchmarks demonstrate that RLMesh achieves competitive accuracy to baselines but with substantially fewer simulation queries. These results show that solver-level spatial adaptivity can dramatically improve the efficiency of surrogate training pipelines, enabling practical deployment of learning-based PDE surrogates across a wide range of problems.