Breakeven complexity: A new perspective on neural partial differential equation solvers
Yijing Zhang, Nicholas Roberts, Tanya Marwah, Mikhail Khodak

TL;DR
This paper introduces a new evaluation framework called breakeven complexity for neural PDE solvers, accounting for total costs including data generation and training, and compares their efficiency to classical solvers across various scenarios.
Contribution
It proposes the breakeven complexity metric to evaluate neural PDE solvers considering end-to-end costs and applies scaling laws to optimize training budget allocation.
Findings
Neural PDE solvers become more effective as problem complexity increases.
The framework helps determine when neural solvers are cost-effective compared to classical methods.
Neural solvers show promising results on multiple PDE benchmarks.
Abstract
Neural surrogate solvers of partial differential equations (PDEs) promise dramatic speedups over numerical methods, especially in scenarios requiring many solves. However, current accuracy-based evaluations do not fully consider two central issues: (1) neural solvers incur substantial up-front costs for data generation, training, and tuning; and (2) classical solvers can also generate low-fidelity solutions at a sufficiently low simulation cost. To explicitly account for these realities and fully incorporate end-to-end costs, we propose an evaluation framework centered on breakeven complexity, a metric that counts the forward solves before a learned solver is cost-effective relative to an error-equivalent traditional solver. To evaluate this measure, we apply scaling laws to determine how much training budget to allocate to data generation and discuss how to achieve smooth…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
