- Rating
- 4(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
MuPS provides a novel formulation to directly learn condition-dependent sets of admissible physical solutions from branch-unlabeled input-solution observations, without requiring governing equations, physical objectives, or branch annotations during training. The method combines multiple-hypothesis learning with condition-dependent activation to select the admissible subset of candidate solutions for each physical condition. Its performance is assessed across three model families (Fourier neural operators, neural fields, and conditional diffusion models) and three benchmarks (reaction–diffusion, cloth simulation, and continuum robotics), primarily comparing against the corresponding unmodified models, with additional comparisons against multimodal prediction methods on a continuum-robot bifurcation experiment.
Critical strengths
-
Broad applicability across model families. The formulation is largely architecture-agnostic and can be integrated into different physics-learning frameworks. The authors demonstrate its applicability to three model families, consistently improving multi-solution prediction accuracy across the studies physical benchmarks.
-
Data-driven multi-solution learning. MuPS learns multiple solution hypotheses and their condition-dependent activation directly from branch-unlabeled input–solution observations, without requiring governing equations, physical objectives, solver structure, or branch annotations during training. This is particularly valuable for physical systems where the underlying equations or other problem-specific information may be unavailable or difficult to incorporate.
Critical weaknesses
-
Limited comparison with existing multi-solution methods. Although learning multiple solutions is an established problem, the main experiments primarily compare MuPS against unmodified single-output models and conditional diffusion. While the improvements over these baselines are substantial, they provide limited evidence of how MuPS compares with existing approaches specifically designed to represent multiple solutions. The paper includes comparisons with established multimodal methods (Section 5.4) and alternative multiple-hypothesis parameterizations (Appendix A.8), but these are restricted to the continuum-robot benchmark. A broader evaluation against relevant existing multi-solution approaches would help better establish the relative merits of the proposed framework.
-
Limited evaluation of varying solution multiplicity. Although MuPS is evaluated across three different physical systems, two benchmarks have a fixed number of admissible solutions across all conditions (four for reaction–diffusion and two for cloth). Only the continuum-robot benchmark evaluates changing solution multiplicity, with a transition between one and three solutions. Since adapting the number of predicted solutions to the physical condition is a central aspect of MuPS, evaluation on systems with more complex changes in multiplicity would provide stronger evidence of the approach's generality.
Questions for authors
-
Evaluation of condition-dependent solution multiplicity. Two of the three benchmarks have constant solution multiplicity, while the continuum-robot benchmark exhibits a transition between one and three solutions. How do the authors expect MuPS to perform on systems with more complex changes in multiplicity, such as multiple bifurcations or several transitions in the number of admissible solutions?
-
Estimating the number of admissible solutions. The activation model uses target solution counts estimated by clustering observations at the same and nearby conditions (Appendix A.3). How sensitive is this estimation to the choice of clustering threshold and the availability of repeated observations? In particular, how would the approach behave when only a few observations are available for each physical condition, or when distinct solution branches become very close near bifurcation points?
-
Interpretation of branch-count results. Table 3 provides evidence that activation can recover the correct number of solution branches. However, some of the reported results are relatively trivial, while others are obtained on benchmarks where the number of admissible solutions is constant across physical conditions. This limits how much the table demonstrates about the effectiveness of condition-dependent activation.
-
Reaction-diffusion: For FNO and neural fields, the perfect branch-count accuracy without activation follows directly from setting the number of candidates equal to the true number of solutions.
-
Cloth: The true number of branches is always two, and activation achieves 100% exact-match accuracy. However, it is unclear whether the same two hypotheses are retained for every condition or whether their identities vary with stiffness.
-
Robot: This is the most informative experiment because the true branch count (one or three) varies with the physical condition. It therefore provides meaningful evidence of condition-dependent cardinality prediction.
Suggestions:
3a. Report the candidate budget in Table 3 or its caption.
3b. Include a condition-independent activation baseline that retains the same fixed subset of candidates for every physical condition. For instance, setting means retaining the same two candidates across all conditions. With , there are six possible subsets of two candidates. The subset could be selected by minimizing symmetric set error on the validation set and then evaluated on the test set. Comparing its symmetric set error with that of condition-dependent activation would help determine whether the improvements in Table 2 arise primarily from consistently suppressing the same hypotheses or whether adapting hypothesis selection to the physical condition provides an additional measurable benefit.
-
-
Clarity of Figure 2. The different panels are confusing, as they provide limited information about the problem setup, and the relationship between them is unclear. I suggest combining panels 1 and 2 to explain the problem setup as an input–output mapping, making it clear that the input is the physical condition and the output is one or several solutions , so that is not mistaken for the input. Panels 3 and 4 could also be combined to compare single-solution and multiple-solution approaches.
3 comments
I thank the authors for their detailed response. The updated paper addresses most of my original concerns and makes the results more informative.
I have three remaining observations:
1. Evaluation of rMCL. I have a concern about the fairness of the rMCL comparison. The authors note that rMCL normalizes its scores across hypotheses to sum to one. Applying an activation threshold of 0.5 to these scores makes it very difficult for rMCL to select more than one branch, and impossible to select two branches with scores higher than 0.5. This could explain why it always predicts one branch and achieves 81.7% exact-match accuracy, same as a trivial always-one baseline. Could the authors clarify how they selected the threshold? I think a validation-calibrated threshold or another selection strategy that allows rMCL to predict multiple active branches would make the comparison more meaningful.
2. Benefits of condition-dependent activation. The fixed-selection comparison is useful to understand the contribution of condition-dependent activation. Although the gains of adaptive selection are limited in some settings, it generally performs better than fixed selection when their results differ, especially on the robot benchmark. It would be useful to know how many hypotheses the fixed-selection baseline selects in each setting. This could be reported in the appendix.
3. Complexity of the benchmarks. The main benchmarks still have relatively limited variation in the number of solutions. For example, it appears 81.7% of the robot benchmark conditions have only one admissible solution, making branch-count accuracy less informative about performance in multi-solution regimes. The cantilever experiment is a useful addition, as it has more complex changes in solution multiplicity, including multiple bifurcations. However, the evaluation is mostly visual, and the method appears to miss some active regions at higher multiplicities. Could the authors also report quantitative metrics such as symmetric set error and branch-count accuracy for this benchmark? Exploring more challenging physical systems with complex bifurcation structures would be an important direction for future work.
I appreciate the authors' transparency in reporting results that show both the strengths and limitations of the proposed approach. Overall, I think the additional evidence and analyses have made the paper stronger, and I am inclined to upgrade my rating to clear accept.
We sincerely thank the reviewer for the encouraging feedback and thoughtful suggestions. We appreciate the recognition of our revisions and have conducted further evaluations to address the three remaining concerns.
Q1: Fair Comparison with rMCL
A: We thank the reviewer for pointing out the limitation of the fixed 0.5 threshold. While this threshold was initially applied consistently across methods, we agree that it restricts rMCL's ability to select multiple branches due to its normalized scores.
To provide a fairer comparison, we have calibrated the activation thresholds separately for both methods using the same protocol, allowing rMCL to select multiple branches. Our method achieves higher branch-count exact-match accuracy for FNO (95.0% vs. 91.7%) and conditional diffusion (91.7% vs. 81.7%), while matching rMCL for neural fields (93.3%). The corresponding count MAEs are 0.050 vs. 0.117, 0.083 vs. 0.333, and 0.100 vs. 0.083, respectively.
We have incorporated this evaluation into Appendix A.8 (page 32) of the revised manuscript.
Q2: Number of Hypotheses Selected by Fixed-Subset Activation
A: We appreciate this suggestion and have updated Section 5.2 (Table 3) to report the number of hypotheses retained by the fixed-subset baseline.
For reaction–diffusion, the fixed baseline retains all candidates (4 for FNO and neural fields, 6 for diffusion). For cloth, it selects 2 candidates across all three backbones. For the robot benchmark, it selects 2, 1, and 3 candidates for FNO, neural fields, and conditional diffusion, respectively.
Q3: Quantitative Evaluation of the Cantilever Benchmark
A: We thank the reviewer for this suggestion. We have added Table 14 to quantitatively evaluate the cantilever benchmark alongside Figure 23, reporting branch-count exact-match accuracy, count MAE, and symmetric set MSE across all four complexity settings.
For maximum solution multiplicities of 1–3, our method achieves 87.9–97.0% branch-count accuracy and consistently reduces symmetric set error compared with retaining all candidates. At the highest multiplicity (Nmax = 4), accuracy decreases to 60.6%, reflecting the difficulty of recovering active branches in more complex bifurcation structures. Nevertheless, activation reduces symmetric set error from 0.183 to 0.043, a 4.3× reduction.
These results complement the visualizations by quantifying both the benefits and limitations of our method as solution multiplicity increases. We agree that extending the evaluation to higher-dimensional physical systems with more complex bifurcations is an important direction for future work.
Again, we appreciate the reviewer's constructive feedback, which has helped strengthen the manuscript.
Q1: Comparison with Existing Multi-Solution Methods
A: To further strengthen these comparisons, we have added evaluations against rMCL (Figure 22) and distance-based deduplication. Under the same 0.5 activation threshold, rMCL achieves 81.7% branch-count accuracy and a count MAE of 0.333 on the robot benchmark, compared with 88.3% and 0.200 for our method. On Cloth, distance-based deduplication yields 8.9–18.5× higher reconstruction error than our activation mechanism across all three backbones. Together, these comparisons provide additional evidence for the benefits of explicitly learning condition-dependent admissibility over alternative multimodal prediction and candidate-selection approaches.
Q2: Evaluation of More Complex Changes in Solution Multiplicity
A: We appreciate this suggestion and have introduced a new cantilever benchmark (Figure 23) to evaluate increasingly complex changes in solution multiplicity. The benchmark includes maximum stable-solution counts ranging from 1 to 4, with up to 20 branch-count transitions as the applied force varies. Our method accurately recovers the emergence and disappearance of solution branches at lower multiplicities and captures the overall bifurcation structure in more challenging settings, with some missed active regions at the highest multiplicity. These results extend our evaluation beyond the original continuum-robot benchmark and demonstrate the ability of our method to recover evolving solution sets across multiple bifurcations.
Q3: Robustness of Solution-Count Estimation
A: We would like to highlight an existing evaluation and a newly added experiment addressing the sensitivity of solution-count estimation.
Q4: Branch-Count Recovery Near Bifurcations
A: We thank the reviewer for highlighting this challenging setting. We have added a new analysis in Section 5.3 that evaluates branch-count recovery near bifurcation points on the continuum robot benchmark. Considering a window of ±5 sampled conditions around each transition, we observe that branch-count exact-match accuracy decreases by approximately 5, 2, and 5 percentage points for FNO, neural fields, and diffusion, respectively, compared with regions away from bifurcations. These results demonstrate that our method maintains relatively high branch-count accuracy near transitions, while quantifying the additional difficulty of recovering admissible solutions when branches emerge or disappear.
Q5: Condition-Dependent Activation vs. Fixed-Subset Selection
A: We have added a fixed-subset baseline in Section 5.2 (Table 3), which selects a condition-independent subset by minimizing training-set symmetric set error and evaluates it on the held-out test set. Our activation achieves lower or equal symmetric set error across all three backbones on Cloth, with a particularly notable improvement for FNO (6.07 × 10⁻⁴ vs. 1.90 × 10⁻³). This demonstrates that even when solution multiplicity is constant, the appropriate learned hypotheses may vary across conditions. We further provide a breakdown by true solution multiplicity in Appendix A.8 (Table 13) on the robot benchmark. Our method outperforms fixed-subset selection in most multiplicity regimes, particularly for neural fields across all three branch counts, although some individual cases favor the fixed baseline. Together, these results demonstrate the benefit of adapting hypothesis selection to the physical condition rather than relying on a globally fixed subset.
Q6: Candidate Budget Clarification
A: We have explicitly reported the candidate budget K for each dataset and backbone in Table 4 (formerly Table 3) of the revised manuscript.
Q7: Clarity of Figure 2
A: We appreciate the suggestion and have revised Figure 2 to more clearly illustrate the problem formulation, distinguishing the physical condition as input from the potentially multiple admissible solutions as outputs.