Title: Pre-Generating Multi-Difficulty PDE Data For Few-Shot Neural PDE Solvers
Primary area: applications to physical sciences (physics, chemistry, biology, etc.)
Keywords: Artificial Intelligence, ML for Science, Machine Learning, Deep Learning, Partial Differential Equations

Abstract: A key aspect of learned partial differential equation (PDE) solvers is that the main cost often comes from generating training data with classical solvers rather than learning the model itself. Another is that there are clear axes of difficulty—e.g., more complex geometries and higher Reynolds numbers—along which problems become (1) harder for classical solvers and thus (2) more likely to benefit from neural speedups. Towards addressing this chicken-and-egg challenge, we study difficulty transfer on 2D incompressible Navier-Stokes, systematically varying task complexity along geometry (number and placement of obstacles), physics (Reynolds number), and their combination. Similar to how it is possible to spend compute to pre-train foundation models and improve their performance on downstream
tasks, we find that by classically solving (analogously pre-generating) many low and medium difficulty examples and including them in the training set, it is possible to learn high-difficulty physics from far fewer samples. Furthermore, we show that by combining low and high-difficulty data, we can spend 8.9× less compute on pre-generating a dataset to achieve the same error as using only high-difficulty examples. Our results highlight that how we allocate classical-solver compute across difficulty levels is as important as how much we allocate overall and suggest substantial gains from principled curation of pre-generated PDE data for neural solvers.

TL;DR: Pre-generating lower difficulty data improves the few-shot performance of neural PDE solvers.