- Rating
- 1
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
- The paper studies safety certification for selective distillation with limited teacher supervision.
- It develops an entropy-based supervision allocation theory and a gated architecture with parameter-based safety guarantees.
- Experiments demonstrate the importance of targeted queries, trusted adaptation regions, and utility-aware selection.
Critical strengths
The paper provides a framework that connects supervision allocation, architectural constraints, and practical safety certification for selective distillation.
Critical weaknesses
- The paper combines many loosely connected components, making the central contribution difficult to identify.
- Several technical results rely on highly specialized assumptions, and their relevance to realistic selective distillation remains unclear.
- The experiments are limited to small synthetic environments and therefore provide insufficient evidence for practical safety claims.
- The presentation is unusually dense and sometimes reads as an aggregation of arguments and caveats rather than a coherent research narrative.
Questions for authors
- Could the authors clarify the central contribution and explain how the theoretical, architectural, and empirical components form a unified framework?
- Which assumptions are essential to the main theoretical results, and to what extent can they be relaxed in realistic selective-distillation settings?
- Could the authors provide experiments on larger-scale or real-world tasks to demonstrate the practical relevance of the proposed safety certificates?
- Could the authors streamline the presentation and more clearly distinguish the main claims, supporting results, and limitations?
2 comments
Response to Reviewer Q4e8 (2/2)
Response to Reviewer Q4e8 (2/2)
Q2 (continued). Without (i)–(iv) but with rectangular intervals, the tree-knapsack algorithm of Section 2 still finds the exact optimum in O(|V|B) operations on an explicit tree with |V| nodes, which grows exponentially in m. The gate guarantee (Proposition 3) needs none of (i)–(v). The gated certificate's cost grows with the number of safety states (states of a declared finite-state model that tracks failure) rather than with the number of histories, although the number of safety states can grow exponentially in the number of tracked protocol variables.
Q3 and W3: larger-scale or real-world tasks. We agree that this is the main limitation of our evidence: we have not run a study with real tools or pretrained models. Our certificate needs an explicit failure predicate (a program that decides whether an episode failed), a declared finite-state model and, for Section 4, a trusted gate. No benchmark we know of supplies all three. Tool-agent benchmarks such as τ-bench and AgentDojo come closest but would first need a verified parser. Synthetic settings supply all three, so the certificate can be compared with an exact or well-estimated risk. For example, a certificate that assumes the student stays within 0.01 nats of the base at unselected histories is above the observed risk for only 79.31% of 1,728 trained policies (Section 5.5).
Model size affects how closely the student fits the teacher, but not the certificate's validity or cost: the certificate uses only the gate, the base, the cell offsets and the residual's width, and Proposition 3 and its bounds (Eq. 7) hold for any residual network bounded by tanh, including a transformer over the full token history (l.170–171). As a step toward larger tasks, new Appendix I implements a synthetic protocol with eight tools, 48 calls per episode, and tool results that can be garbled in transit. Its parser agrees with the protocol specification on 1.58M stream prefixes. With 512 teacher labels, a 0.21M-parameter student, five times larger than our earlier models, has risk 20.51% (teacher: 20.59%) and a certificate of 28.54%, computed in about 16 ms. When results can be garbled, the certificate stays valid if the verifier tracks both the parsed and the true state and knows the garbling rate, and it stays useful only if the parser fails closed, reading a garbled answer to an irreversible call as a success (the riskier reading). This shows that the certificate's ingredients can be built and checked for a concrete protocol, not that the guarantee transfers to real tools or pretrained models (Section 7).
The abstract's "practical recommendation" (l.25–27) and "Practical steps" (l.460–468) were also stated too strongly, and both now apply only where the failure predicate is explicit and the gate can be verified.
Q4 and W4: streamlining, and separating claims from caveats. We cut repeated sentences and a proof sketch, moved the detail of Section 5.4 to Appendix C.4, and reduced Appendix D's local selection result to a two-sentence note in Section 5.5 that calls it a supporting approximation. Section 1 now has a table of the paper's seven main claims that says where each is supported, what it assumes and what is not claimed. Row 1 is the main result, rows 2–4 are supporting theory, and rows 5–7 are experiments. Section 7 has a labeled paragraph on limitations that points to Appendices F, G and I, and the general response lists the other presentation changes. Even after these cuts, the claims table and new summaries make the main text about one page longer than the submission, within the 10-page limit.
Response to Reviewer Q4e8 (1/2)
Response to Reviewer Q4e8 (1/2)
Thank you for your review.
Q1 and W1: the central contribution. One question ties the parts together: which resource supplies the per-history behavior bounds that a certificate needs? The options are constraints (R1), a trusted gate (R2) and teacher queries (R3). A constraint marks a history where the certificate may assume teacher rather than base behavior.
The central contribution is Theorem 1 with Corollary 2, on R1. A base policy makes m binary decisions (routers), each taking action 1 with probability at least ℓ > 1/2, and then enters one of 2^m identical copies of a short failure-prone stage (a hazard), while the teacher is far from the base. Theorem 1 shows that an optimal placement of B constraints puts none on routers and fills hazard decisions in decreasing order of route probability times risk reduction. By Corollary 2, at a fixed fractional risk reduction, log₂ of the required number of constraints grows asymptotically by h₂(ℓ) bits per router (h₂ is the binary entropy), instead of 1 bit under symmetric routing.
A gate is a parser-computed indicator of the histories where the student may adapt. By Proposition 3, a gated network keeps the base outside the gate and allows large teacher-directed changes inside it, so a trusted gate can replace per-history constraints. Teacher queries are still needed, because each cell of the gate, a class of histories sharing one learned logit offset, can be fitted only if labels reach it (Section 4). In Section 3's example (m = 8, hazards of k = 3 decisions), new Appendix E shows that a three-cell gate with offsets at the teacher's logits and no residual certifies p³ = 0.125, where p = 0.5 is the teacher's harmful-action probability. Per-history constraints (Eq. 1) reach this value only if all 768 hazard contexts are constrained to follow the teacher exactly. The price of the gate is trust in it, labels in each cell, and a teacher that behaves the same at each hazard step in every copy. Without a trusted gate, Theorem 1 still decides where constraints go.
Each experiment isolates one question. Section 5.1 varies how teacher queries are targeted (R3), for a learner with a correct gate (R2) and for one without a gate, and Section 5.2 measures what a too-coarse gate costs in fit and certificate tightness. Section 5.3 does not test Theorem 1, which optimizes a risk-only certificate. For one family of small trees and budgets up to 8, it shows that selection must account for completion: at 95% completion and B = 8 constraints, a rule that scores histories by their signed effect on risk and utility has 4.57% risk, against 17.35% for the teacher-cost rule, which ignores completion (Table 3). The submitted l.448–449 wrongly suggested that the experiments test Theorem 1's assumptions, and Section 1 now states how each part relates to the main result.
Q2 and W2: which assumptions are essential. Two are essential: identical hazards, and a bias toward action 1 shared by the routers, or at least by those at the same depth. Without either, supervising a router can be strictly optimal. Such structure arises when many earlier routes lead to the same risky protocol step (Section 3), but we do not claim it for general language-model tasks. Section 3 now says which proof step uses which assumption. Theorem 1 assumes that (i) all hazard copies are identical, (ii) a supervised router's interval contains 1/2, (iii) every unsupervised router has the same interval [ℓ, r] for the probability of action 1, with ℓ > 1/2, (iv) every hazard decision has the same caps on its harmful-action probability, v without and u < v with a constraint, and (v) the intervals at different histories can be chosen independently (rectangularity).