- Rating
- 1
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper propose a "shared latent predictor" that takes as input a request—defined by a specific time span and a descriptive mode (such as continuous, microscopic, or macroscopic). Symbolic heads feed predicted predicates back into this predictor. The system employs dynamic programming to perform labeling and extract a policy, which is optimized based on "duration-weighted prediction error" and the number of linear MAC (multiply-accumulate) operations. Our experimental evaluation is multifaceted: it includes performance comparisons over fixed time spans across three physics-based benchmarks; an assessment of candidate ranking for nine distinct types of requests using the NovPhy dataset; and a comparison between our adaptive joint model and a system trained independently, which considers only the prediction time horizon.
Critical strengths
-
By employing a shared carrier, it becomes possible to switch between temporal and symbolic feedback within a single rollout, without requiring transformations between independently learned latent spaces.
-
This paper address the matching of training budgets, the use of three random seeds, explicit computational accounting, and the standardization of evaluation inventories.
Critical weaknesses
- The data processed by the NovPhy predictor includes carrier frames that span both a single engine step and 50 engine steps, with request horizons also defined in terms of these same carrier frames. This method of temporal-rate encoding is poorly characterized, making it difficult to evaluate its transferability.
- The comparison of computational costs for the "adjusting horizons only" scenario actually involves simultaneous changes to the predictor width, the tokenization training method, the utilization of representations, and the training dataset—all within a "development state" context. Consequently, this does not substantiate the claim that "jointly selecting the representation for each prediction" yields actual savings in computational cost. Furthermore, the dynamic programming approach optimizes an "additive error proxy" based on a fixed-context carrier, rather than the actual, state-dependent recursive rollout cost.
Questions for authors
- Do the training windows and evaluation contexts mentioned on page 15 originate from the same CLEVRER scenes? Please provide the scene IDs used for fitting (training) and evaluation, ensuring there is absolutely no overlap between the two sets, and recalculate Table 1.
- Regarding the predictor input, what specific metric (e.g., rate or elapsed time variable) is used to capture the distinction between a "one-engine-step" and a "50-engine-step" execution?
- Using the same checkpoints and an equivalent decision budget, how does the joint policy perform compared to the following approaches: fixed macro-step size with adaptive horizons, fixed horizon with adaptive descriptions, and a time-only request scheduling strategy?
- For the NovPhy task comparisons, please report the results pairing uncertainty with task success rate (or Top-1 decision quality). Provide a complete list of results—covering all successful and failed cases—rather than just the data summarized by the AUC metric. Does the previously observed marginal gain of 0.004 from the offset-set still hold?
- What is the specific objective function that the dynamic programming (DP) approach is guaranteed to optimize? Furthermore, for requests that were not visited during the rollouts in "round 1," how are their successor contexts constructed for "round 2"?