- Rating
- 3
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper introduces SPLICE, a method for adapting a pretrained operator library to unlabeled mixture trajectories. Each library entry is a learned time-stepper: an encoder maps a context window to a latent code, a hypernetwork maps that code to vector-field weights, and RK4 advances one step. Discovery alternates an exact convex assignment step with a gradient refinement step, and extends the library by reseeding when residuals persist. Each discovered operator is then graded post hoc against reference solvers using a displacement distance on a fixed probe set. Experiments cover 1D mixtures, coupled Navier-Stokes, and transfer from The Well.
Critical strengths
A key strength is that identification is falsifiable and separate from training. Discovered operators are compared with reference solvers on a fixed probe set, with a margin over the second-closest mechanism and a null calibrated from wrong-kind operators. Because labels are withheld, this tests real identification, not renamed decomposition. That is a genuine conceptual contribution.
The strongest evidence is coupled Navier-Stokes, where no supervised data exist. Euler and diffusion act together at every step, yet the discovered library identifies both on all 10 seeds and composes at 0.0116 plus or minus 0.0014, about 32 percent better than the 0.017 persistence baseline. In this setting, label-free adaptation stands in for supervised training rather than competing with it. Pure mechanisms show it can match supervised training when both are possible; coupled flow shows a result that supervised training cannot provide, because no labeled data exist.
Critical weaknesses
The abstract says the method adds operators for dynamics the library cannot express, but the paper itself says adaptation cannot introduce a mechanism absent from the initial library. Reseeding can only recover mechanisms the pretrained network already represents, not mechanisms absent from it, so the grow claim conflates not active with not represented.
The coupled-flow result lacks a composition-only baseline. Coupled flows beat persistence, but the paper reports no supervised row and no baseline that composes pretrained mechanisms without discovery. Readers cannot tell how much of the gain comes from composition and how much from discovery. Pure mechanisms have a supervised row; coupled flows do not.
Questions for authors
Given Appendix C.2, should the “adds an operator” claim be restricted to mechanisms already represented but inactive?
On coupled flows, can you report a baseline that composes the pretrained mechanisms without any discovery, so readers can see how much of the gain comes from composition rather than discovery?
Each 2D discovery seed is graded on its own probe set and null. How is cross-seed identification assessed?
Thank you for recognizing the value of learning reusable operators from trajectories where several mechanisms always act together.
Identity is not constrained during learning. This is a fair point. A lower prediction error does not by itself mean the mechanisms are separated, which is why we grade identity against reference solvers rather than infer it from accuracy. We also tested using that grading as a constraint on coupled Navier–Stokes. Starting from the library discovered on pure mixtures, we run the adaptation rounds and check each operator against the reference solvers after every round. If an update makes an operator lose its identity, the update is undone. Identification then constrains learning rather than only evaluating it afterwards. Over three seeds, this keeps the advective operator from drifting toward diffusion, at no cost in accuracy (0.157 to 0.184 against 0.183 without it, on the 12 held-out viscosities; Appendix C.3, “Identity gate”). For discovery from coupled flows, we also graded every adaptation round. Both mechanisms are identified on all ten seeds at each of the eight rounds, with positive margins throughout (Appendix C.3, “Discovery at native 256²”).
When Grow can recover a missing mechanism (Appendix C.2)., and when it works. Reseeding creates a new code for the same frozen network, so it can only recover a mechanism that network can already produce. When the network was pretrained with Euler, reseeding regrows a missing Euler operator on three of three seeds (§5.4). On the network pretrained without Euler, it cannot. Even a single code fitted with labels on pure Euler windows still identifies as diffusion (Appendix C.2). A mechanism the network cannot produce would therefore require new parameters rather than a new code. The revised text states both conditions, and claims growth only for mechanisms the pretrained network can already produce.
Reviewer cWsU
We thank the reviewer for the careful review, and for seeing the falsifiable identification protocol as a conceptual contribution.
Adding mechanisms that are not represented. Yes, and we revised the abstract and §3.3 accordingly. Reseeding recovers mechanisms that the pretrained network can produce but that are inactive in the library. It cannot add a mechanism the network does not represent, as Appendix C.2 shows. The revised claim is restricted to the first case, and we state the second as a limitation, since it would require a new operator with its own parameters.
Composition-only baseline on coupled flows. The supervised library is this baseline, since it composes operators pretrained on pure mechanisms without any discovery. Following your request, we extended the Navier–Stokes evaluation to the coupled-flow test set over 12 held-out viscosities and 16 steps. This also corrects the test split used in the submitted Tables 3 and 12, which changes the scale of every number, including the 0.0116 you cite. On the corrected split the coupled-flow result is stronger, 0.139 against 0.741 for persistence. Discovery from coupled flows starts from the supervised library, so the gain from 0.159 to 0.139 is what discovery adds on top of composition. We also add NOS trained with one operator per viscosity as a supervised upper bound. It is trained with a label for each viscosity seen at test time, whereas our supervised library uses mechanism labels only and our label-free libraries use no labels during discovery. Appendix D defines each row.
Mean ± std over 10 seeds (3 for supervised). NOS and persistence are single models.
Cross-seed identification. For the Navier–Stokes results of Table 3, all seeds are now graded on one shared probe set and one shared null. Both mechanisms are identified on all ten seeds, for both label-free libraries, and this holds when we redraw the null five times (Appendix B.1).