MMP.17:11 - SoTA-Echoing

The practice question is how to obtain a reusable response at lower total effort without losing what the receiver must do with it. The selected answer is a response-specific construction with informative cases, retained structure, and refinement or source return where the receiving consequence remains unresolved. It does not select one model family for every input dimension, data budget and error claim.

Adaptive construction versus a fixed case budget. Winovich et al., Active operator learning with predictive uncertainty quantification for partial differential equations, v4 (2026), §§2 and 5 compares uncertainty-guided construction with alternatives that differ in accuracy and training cost. Adapt this experimental line in :4.2 and :4.5: target informative queries while counting the guidance cost. Fixed distributed cases remain a serious alternative when guidance is unreliable or expensive. The PDE experiments establish neither general superiority nor error bounds at arbitrary inputs. Reopen the choice when consequential errors escape the indicator or the cost balance changes.

Combined models versus a single replacement. Brunel et al., A survey on multi-fidelity surrogates for simulators with functional outputs: unified framework and benchmark (2025), §§3 and 6.6 compares correction, mapping and fusion; its benchmark has no universal winner. Adopt paired correction in :4.3 and adapt the comparison in :4.5: retain the cheap model when its discrepancy is easier to represent than the whole response at comparable total effort. Interpolation or single-source construction can otherwise win. The functional-output results inform this branch, not the method’s domain boundary. Lost features or weak correspondence reopen the choice.

Structural restriction versus expressive universality. Kovachki, Lanthaler and Mhaskar, Data Complexity Estimates for Operator Learning, v2, introduction and main results supplies a theoretical counterweight to choosing an expressive learner first. Their general operator classes can require exponentially many examples, while more restricted approximation classes permit better rates under their assumptions. Reject expressive capacity as sufficient grounds for affordable construction; adapt the consequence in :4.1–:4.3 by reducing the target and using justified structure before expanding the learner. The results concern specified classes and access models, not the sample count for an arbitrary engineering model. Reopen the restriction when it excludes a consequential response.

For the scalar bounded case in :5.1, interpolation already answers the needed comparison with one added case and a supplied curvature bound. An operator learner or statistical uncertainty model would add assumptions and construction work without improving that answer. For coupled outputs or large response families, the retained contemporary branches can instead justify their extra cost. That difference, rather than a universal ranking of algorithms, selects the branch.