Paper Overview
Research area: Machine Learning Authors: Jinpai Zhao, Nishant Panda, Yen Ting Lin, Eirik Valseth, Diane Oyen, Clint Dawson Published: 2026-05-01 arXiv: 2605.00820
Summary
This paper introduces HyCOP, a modular framework that learns parametric PDE solution operators by composing simple modules (advection, diffusion, learned closures, boundary handling) in a query-conditioned way. Rather than learning a monolithic map, HyCOP learns a policy over short programs — which module to apply and for how long — conditioned on regime features and state statistics.
Modules may be numerical sub-solvers or learned components, enabling hybrid surrogates evaluated at arbitrary query times without autoregressive rollout.
Key Contributions
- Interpretable programs: Across diverse PDE benchmarks, HyCOP produces human-readable module sequences rather than opaque monolithic mappings.
- Strong OOD generalization: Delivers order-of-magnitude out-of-distribution improvements over monolithic neural operators.
- Modular transfer: Supports transfer through dictionary updates, e.g., boundary swaps and residual enrichment.
- Theoretical grounding: The theory characterizes expressivity and provides an error decomposition that separates composition error from module error, doubling as a process-level diagnostic.
Original Abstract
> We introduce HyCOP, a modular framework that learns parametric PDE solution operators by composing simple modules (advection, diffusion, learned closures, boundary handling) in a query-conditioned way. Rather than learning a monolithic map, HyCOP learns a policy over short programs - which module to apply and for how long - conditioned on regime features and state statistics. Modules may be numerical sub-solvers or learned components, enabling hybrid surrogates evaluated at arbitrary query times without autoregressive rollout. Across diverse PDE benchmarks, HyCOP produces interpretable programs, delivers order-of-magnitude OOD improvements over monolithic neural operators, and supports modular transfer through dictionary updates (e.g., boundary swaps, residual enrichment). Our theory characterizes expressivity and gives an error decomposition that separates composition error from module error and doubles as a process-level diagnostic.
---
*Auto-collected on 2026-05-05*