- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper investigates how much policy information is retained by energy observations under fixed event costs and binary arrivals. It derives a trigger count relation from queue conservation and compares gated adaptation with schedules having matched counts. It also develops a phase-level energy ledger and auditing procedure and reports embedded measurements of the counting regime and several cases where adaptation helps or fails.
Critical strengths
- Separating better scheduling from fewer updates is a useful attribution question, and work-matched energy comparisons are valuable.
- The paper distinguishes metered, replayed, simulated, and predicted evidence and reports important negative results and cost variability.
- The counting identity has an intuitive induction proof for the stated nondecaying threshold queue when the maximum arrival does not exceed the service quantum.
Critical weaknesses
- The scope is much narrower than the title suggests. Constant event cost makes energy depend on count by construction; the specific queue additionally determines count from arrivals. This does not establish that adaptive gating generally reduces to counting. Timing and sample selection can affect accuracy or future work even with constant event cost. An oracle matched using future arrival totals is not a deployable information-matched baseline.
- The regret guarantees are unsupported as stated. Theorem 3 lacks a fully specified loss/feedback model, comparator, learning update, drift budget, and detection assumptions. Its appendix proof invokes “standard” analysis and substitutes energy constants. Theorem 4 offers structural analogies to a cited result rather than a valid reduction of decision processes. Bounded reward alone is insufficient.
- The appendix incorrectly equates the accumulating threshold gate with Q_next=(Q+a-Theta)^+. For Q=0, a=1, Theta=2, these yield one and zero respectively. The Le Cam proof also contains alpha+(1-alpha)=1/2 and confuses balanced classification success with test power. Identical distributions imply power equals size, not an unconditional power bound of one half.
- Table 4 gives paired means of 0.712 J and 0.587 J, implying a gate-minus-oracle mean difference of +0.125 J, whereas Theorem 2(ii) states an arithmetic mean difference of -0.13 J. A negative Hodges–Lehmann estimate can coexist with a positive mean, but does not reconcile this mean-sign contradiction.
- A central measured difference within 2c_ad does not validate a deterministic trajectory bound under the reported event-cost variability. Nonsignificant queue-dependence tests do not establish constant cost. Exact matched counts already give equal idealized energy; the extra residual needs clarification. Reported intervals also explicitly exclude Type B measurement uncertainty.
- Hashes and sum consistency validate aspects of a ledger, not automatically its physical truth against a malicious reporter. Injected export faults cover a limited threat model. Hardware energy and simulated learning outcomes must be linked carefully before interpreting them as joint end-to-end operating points.
Questions for authors
Q1. What are the comparator, loss/feedback model, learning update, and drift assumptions for Theorem 3? Can you provide its complete proof and show that the reduction in Theorem 4 preserves every required assumption?
Q2. Why does Appendix A equate the accumulating gate with Q_next=(Q+a-Theta)^+? These differ at Q=0, a=1, Theta=2. Which recurrence does the code implement, and which claims require correction?
Q3. Why do Table 4's paired means imply a +0.125 J gate-minus-oracle difference while the text states -0.13 J? Please reconcile the paired data, sign convention, arithmetic mean, and Hodges–Lehmann estimate.
Q4. With variable measured event costs, is 2c_ad an ideal-model, probabilistic, or measured pathwise bound? How are residual costs, systematic uncertainty, and timing dependence incorporated?
Q5. Does oracle count matching require the realized future arrival total A(T)? What happens against deployable open-loop baselines with the same causal information and learning-quality requirement?
Q6. Which sensors, logs, and hash anchors are trusted? How does the audit distinguish an internally consistent ledger from a malicious but internally consistent account of physical energy?