- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes Brain-Inspired Prior Regulation (BIPR) for improving sampling-based planning with learned world models. The main motivation is that existing prior-guided planners such as PRISM use an action prior mainly to initialize the search distribution, but subsequent optimization can drift away from prior-supported actions. BIPR addresses this with three mechanisms: Prior Anchoring, which continuously penalizes deviations from the learned action prior; Uncertainty–Conflict Arbitration, which adaptively adjusts the regularization strength based on prior spread and disagreement between model-preferred candidates and the prior; and Metaplastic Calibration, which further modulates this response using prior-head training progress. The method reuses the same candidate rollouts and adds no trainable parameters beyond the shared prior head.
The paper evaluates BIPR on four control environments using frozen LeWorldModel and Sub-JEPA backbones. BIPR improves average success over MPPI by 30.33 and 26.33 percentage points, and over the more directly comparable PRISM baseline by 8.00 and 4.83 points, respectively. The paper also reports ablations, runtime comparisons, sensitivity studies, and qualitative rollouts.
Critical strengths
- Persistent prior regulation addresses a concrete weakness of prior-guided planning. The main idea of extending action-prior guidance from initialization to candidate scoring throughout optimization is simple but meaningful. The ablation suggests that Prior Anchoring is the dominant source of improvement: on PushT and Reacher, adding Prior Anchoring improves the average success from 68.67% to 75.67%. This supports the central hypothesis that search drift after prior-guided initialization is a real problem.
- The method provides a favorable performance–compute trade-off with little additional online overhead. BIPR reuses the same world-model rollouts, introduces no additional trainable parameters over the shared prior-guided baseline, and increases evaluation time only slightly relative to PRISM. The evaluation also covers two predictive backbones and four tasks, which provides some evidence that the core regularization idea is not tied to a single world model.
Critical weaknesses
-
The evidence does not cleanly support the contribution claimed for the full BIPR method. The headline improvements of 30.33/26.33 points are measured against MPPI, but most of this improvement already comes from introducing the learned prior used by PRISM. The more informative comparison for isolating BIPR's contribution is PRISM, where the gains are 8.00 and 4.83 points. Moreover, the component ablation shows that Prior Anchoring accounts for most of the improvement, while Metaplastic Calibration contributes only 0.67 points on the two evaluated tasks. Therefore, the current presentation overstates how strongly the experiments validate all three proposed components.
-
The adaptive mechanisms are heuristic and are not sufficiently validated mechanistically. UCA uses the predicted prior variance as an uncertainty signal even though the paper explicitly notes that it is not a calibrated estimate of epistemic uncertainty. Metaplastic Calibration further uses a hard binary gate based on fixed training-progress thresholds, but the rationale for this non-monotonic rule is unclear. More importantly, the paper does not report the actual distributions or trajectories of the key internal quantities such as search drift, , , or . This makes it difficult to verify that the proposed adaptive mechanisms operate as intended rather than simply acting as tuned heuristics.
Questions for authors
- Could the authors report the actual values of , and the resulting binary gate for each environment and backbone? Since Metaplastic Calibration depends directly on these quantities, this information is necessary to understand when the module actually changes the planner behavior.
- How is the scale of the world-model cost calibrated relative to the prior penalty across different backbones? Since the two terms are directly added and different backbones may use different latent representations or native cost aggregations, could the authors clarify whether the same values are robust to changes in latent-cost scale?
- Why does varying the conflict gain in Figure 4 appear to have no effect on performance, including at a value that should effectively remove the conflict contribution, while Table 4 reports a noticeable degradation when the conflict branch is removed? Were these experiments conducted with different seeds, protocols, or model variants?
- Can the authors provide a direct comparison against a simple fixed- prior-regularized planner, ideally using the same Gaussian prior and candidate scoring but without UCA and Metaplastic Calibration? This would help determine whether the adaptive mechanisms provide a meaningful advantage beyond persistent prior regularization itself.
4 comments
Q1
The learning progress and gate state of each checkpoint have been individually verified. The table below reports the main-comparison checkpoints used in our supplementary hard-gate evaluation, all with prior-training seed 42.
denotes the initial validation MSE, and denotes the lowest validation MSE over training. is the relative reduction in validation error, clipped to [0,1]. The gate is when and otherwise.
| Backbone | Task | ||||
|---|---|---|---|---|---|
| LeWM | Cube | 1.028723 | 0.609650 | 0.407372 | 0 |
| LeWM | PushT | 0.945713 | 0.779779 | 0.175459 | 1 |
| LeWM | Reacher | 1.003968 | 0.993990 | 0.009939 | 0 |
| LeWM | TwoRoom | 1.007587 | 0.933567 | 0.073462 | 0 |
| Sub-JEPA | Cube | 1.025944 | 0.540577 | 0.473093 | 0 |
| Sub-JEPA | PushT | 0.946565 | 0.784201 | 0.171530 | 1 |
| Sub-JEPA | Reacher | 1.003868 | 0.993759 | 0.010070 | 0 |
| Sub-JEPA | TwoRoom | 1.006023 | 0.932734 | 0.072851 | 0 |
For these checkpoints, both backbones use base anchoring with a fixed on PushT and retain full arbitration on the other three tasks. The gate state is fixed per checkpoint, while UCA provides online weight adaptation. These records directly specify the planning branch selected by calibration on each task.
We will include this table and the checkpoint-to-result records in the revision to make the gating behavior directly verifiable and reproducible.
Q2
We retain each backbone’s native goal cost and consistently control the scale of the prior penalty. The supplementary experiments show that, under the tested temperature-compensated cost scaling, the same configuration maintains higher average success than PRISM across both backbones.
The prior penalty normalizes action deviations by the floored prior scale, averages over action-sequence dimensions, and is capped at 9, controlling the effects of action units and dimensionality. Both backbones use and .
We further keep this configuration unchanged while multiplying both the world-model cost and MPPI temperature by 0.25 or 4. This preserves the ratio of model cost to temperature and directly tests changes in relative prior-regularization strength. All comparisons use the hard gate in Eq. 5, with three evaluation seeds and 25 starting states per seed for each condition. Results report the mean and standard deviation.
| Backbone | Task | Scaling factor | PRISM | BIPR |
|---|---|---|---|---|
| LeWM | PushT | 0.25 | 78.67 ± 10.07% | 82.67 ± 6.11% |
| LeWM | PushT | 4 | 78.67 ± 10.07% | 81.33 ± 6.11% |
| LeWM | Reacher | 0.25 | 53.33 ± 8.33% | 61.33 ± 4.62% |
| LeWM | Reacher | 4 | 53.33 ± 8.33% | 57.33 ± 6.11% |
| Sub-JEPA | PushT | 0.25 | 90.67 ± 4.62% | 93.33 ± 6.11% |
| Sub-JEPA | PushT | 4 | 90.67 ± 4.62% | 92.00 ± 4.00% |
| Sub-JEPA | Reacher | 0.25 | 45.33 ± 2.31% | 54.67 ± 4.62% |
| Sub-JEPA | Reacher | 4 | 45.33 ± 2.31% | 46.67 ± 8.33% |
BIPR achieves higher average success than PRISM across both backbones, both tasks, and both scaling factors, supporting the applicability of the same configuration under this temperature-compensated protocol. We will include the cost definitions, temperature-compensation settings, and complete scaling results in the revision.
Q3
Yes, the two experiments use different calibration variants and evaluation protocols. The success-rate plateau in Figure 4 does not imply that the conflict gain leaves planning outcomes unchanged.
Figure 4 uses the smooth calibration variant and sweeps conflict gains of 0, 2, 4, 8, and 16 on LeWM PushT and Reacher, using evaluation seed 42 and 20 starting states per task and setting. Table 4 uses the hard gate in Eq. 5, with three evaluation seeds and 50 starting states per seed. The flat curve therefore indicates unchanged aggregate success, rather than an absence of influence from the conflict branch.
To directly evaluate the conflict branch in the final method, we added a controlled hard-gate comparison that matches the prior checkpoint, evaluation starting states, planning budget, and random-seed protocol, disabling only the conflict branch. The Sub-JEPA Reacher results below report the mean and standard deviation across three evaluation seeds, each with 50 starting states.
| Backbone | Task | Without conflict branch | Full BIPR |
|---|---|---|---|
| Sub-JEPA | Reacher | 53.33 ± 10.26% | 55.33 ± 9.87% |
The full method improves average success by 2.00 percentage points, supporting an incremental benefit from the conflict branch in this configuration. We will explicitly label Figure 4 as a supplementary analysis of the smooth calibration variant and report the configurations, evaluation protocols, and controlled hard-gate comparison in the revision.
Q4
As reported in our response to W1, we added a fixed λ baseline using the same Gaussian prior and candidate-scoring formulation, with UCA and MC removed, and tuned its weight on the validation set. Across three independently trained LeWM priors, BIPR achieves 59.11 ± 2.04% average success on Reacher, compared with 56.00 ± 8.11% for this baseline, supporting the incremental value of adaptive regulation beyond persistent prior regularization on this task.
Thank you for the clarifications and additional experiments. The tuned fixed-weight baseline and checkpoint gate records are helpful. However, the evidence for a consistent benefit from adaptive regulation and the progress-based gate remains limited. These concerns continue to affect my assessment, so I am maintaining my current rating at this stage.
We thank the reviewer for recognizing the value of persistent prior regulation and BIPR’s favorable performance–compute trade-off.
W1
BIPR’s incremental contribution is supported by direct comparisons using a shared prior. The supplementary fixed λ comparisons and hard-gate ablations provide further evidence for adaptive regulation.
1. Shared-prior comparisons directly measure BIPR’s incremental contribution
PRISM and BIPR share the action prior, initialization, world model, and planning budget. In the original paper, BIPR improves over PRISM by 8.00 and 4.83 percentage points on LeWM and Sub-JEPA, respectively. Improvements over MPPI reflect the benefit of the overall method. We will explicitly distinguish these two comparisons in the revision.
2. Validation-tuned fixed λ comparisons support the incremental value of adaptive regulation
For each prior checkpoint, we independently select the fixed λ from six candidates, using 40 validation evaluations per candidate. We evaluate three independently trained LeWM priors, with 75 test starting states per prior. Results report mean ± SD across the three priors.
On Reacher, BIPR improves average success over the tuned fixed λ baseline by 3.11 percentage points, supporting the incremental value of adaptive regulation on this task.
3. Hard-gate ablations directly evaluate calibration
Component ablations now cover two backbones and three tasks. MC uses checkpoint learning progress to select between fixed anchoring and full arbitration. In the LeWM PushT hard-gate comparison, using the same prior checkpoint and 50 starting states for each of three evaluation seeds, the full method achieves 83.33 ± 4.16%, compared with 82.00 ± 2.00% for Prior Anchoring+UCA without calibration. This comparison supports an additional benefit from calibration’s branch selection in this configuration. We will clarify its checkpoint-level role in the revision.
W2
The supplementary controlled interventions and internal-trace diagnostics show that the regulation signals respond to prior degradation and model mismatch.
1. Prior spread and conflict signals have explicit operational meanings
Prior spread describes the dispersion of the action distribution and informs the strength of prior-scale-normalized anchoring. The conflict signal v measures the excess departure from the prior among model-preferred candidates, allowing arbitration to respond to model–prior disagreement during search.
In the controlled label-corruption experiments on LeWM PushT, increasing corruption from 0% to 25% and 50% raises prior action-prediction MSE from 0.6832 to 0.8739 and 1.3297, while the mean prior standard deviation increases from 0.7755 to 2.4792 and 3.5430. These measurements link prior degradation to the spread signal.
2. The interval gate selects regulation branches using learning progress
q measures the relative reduction in validation error from its initial value and describes checkpoint learning progress. The interval gate uses this quantity to determine whether to retain additional arbitration, without imposing a monotonic relationship between q and regulation strength.
The thresholds 0.15 and 0.30 were determined empirically during PushT development experiments, frozen before the supplementary experiments, and applied unchanged across both backbones. Inside the interval, the method retains base anchoring with λ = 0.5. Outside the interval, it retains full arbitration. MC therefore performs checkpoint-level branch selection, while UCA provides online adaptation.
3. Internal traces directly characterize regulation signals and search behavior
On LeWM Reacher, we scale only the actions supplied to the world model while keeping the executed actions unchanged.
Model prediction MSE is measured on the same 75 offline windows. Online quantities are first averaged over pre-success records within each evaluation environment. We then report the mean and standard deviation across the 75 environment-level averages.
Stronger model mismatch is accompanied by a higher conflict signal, supporting v’s responsiveness to changes in model–prior disagreement under controlled errors. λ is jointly determined by u and v. We will include these diagnostics, the threshold-selection procedure, and checkpoint branch records in the revision to make the mechanism’s behavior directly verifiable.