- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper studies model updates when outputs within one input have different permissions. It defines authorization units and proves a closed-form floor for shared controls (Theorem 1), plus a sequential depletion result (Theorem 2). It proposes AGER, which estimates per-unit permissions from base-model scores, routes response at authorization granularity, and selects interface and multiplier under simultaneous utility lower bound and protected-response upper bound (Theorem 3). Experiments on ImageNet and DocRE compare fine routing with scalar, external, and native baselines at matched utility.
Critical strengths
-
The paper’s main conceptual contribution is its formulation of model updates at the granularity of output permissions. It identifies a problem that editing and unlearning work usually ignores: when outputs inside one input have different permissions, a shared update control couples intended and protected changes, and this coupling has a closed-form floor. The authorization-unit framing and Theorem 1 give a clean structural result, and the refinement monotonicity is a useful design principle.
-
A second contribution is AGER's utility-qualified selection with a finite-sample guarantee and abstention. If the assumptions hold, this links diagnosis to a deployable method rather than a post-hoc metric.
Critical weaknesses
-
One critical weakness is that the theory is proved under assumptions that are much narrower than the claim. Theorem 1 requires locally linear utility and a fixed update direction, Theorem 3 requires a fixed candidate family and independent bounded observations, and the method treats authorization masks as given. But the paper's own Appendix admits ImageNet uses only a frozen backbone with 32 fitted coefficients and DocRE binds two specific checkpoints, so global nonlinear full-model finetuning is not covered. Permission uncertainty is also explicitly out of scope: Appendix also says a false writable label can authorize harmful change, yet no robust selector is given. So the headline "authorization-granular routing" is validated only in a narrow endpoint space, and the structural floor may not transfer to real model updates. This is consequential because the whole contribution rests on this theory.
-
Annother weakness is readability: the paper has no conceptual figure for motivation or methodology, and all figures (Figures 1, 2, 4–7) are experimental data plots. A reader cannot see the permission-coupling problem or the AGER pipeline in one place, which makes a dense formal paper harder to follow.
Questions for authors
-
Theorem 1 assumes locally linear utility and a fixed update direction. Your ImageNet setting uses a frozen backbone with 32 coefficients and DocRE binds two checkpoints. Can you show the floor and refinement result still hold under full-model nonlinear finetuning, or is this a scope limitation of the theory?
-
Appendix I.1.1 says a false writable label can authorize harmful change, and the selector treats permissions as fixed. Does Theorem 3 survive noisy or adversarial authorization masks? If not, how should a deployment decide when the permission input is untrustworthy?
-
The main reduction (97.4% median on ImageNet) is measured in a relateively narrow endpoint space. Would the advatage persist under a wider update space or a different backbone, or is it an artifact of the 32-dimensional construction?
Thank you for your constructive comments. We clarify the distinction between update generation and output routing: refinement remains valid for completed nonlinear-model updates. To address policy uncertainty, we also derive selection over a declared family of plausible permissions, with simultaneous validity whenever the true policy belongs to that family.
Q1. Which results apply to nonlinear model updates?
For completed full-model updates, refinement remains valid with nonlinear utility. The closed-form floor additionally requires linear utility along a fixed checkpoint response. Write that response as d=Fθ+Δ−Fθ. Broadcasting a route maximum u adds exactly ∑j∈P(u2−rj2)dj2≥0 protected squared change, regardless of how the checkpoints were trained. This identity therefore applies to nonlinear retraining, as in our DocRE comparisons.
The refinement proof follows by copying every coarse route to its finer child cells, producing the identical endpoint and utility. Consequently, the minimum protected response over finer routes cannot increase at the same utility constraint. Under linear utility, the closed-form value t2/(mHG) further supplies the exact optimum, its attaining strengths and the condition for zero protected response.
Q2. What happens when permissions are noisy or untrustworthy?
Theorem 3 tolerates noisy route-fitting labels when support permissions are correct and its bounded, independent-support conditions hold. A route trained from noisy labels is still a fixed candidate before support evaluation. In our fitting-label permutation comparison, the full family selects the unchanged raw-confidence route, showing how evaluation selects a useful alternative to the damaged learned route.
For uncertainty in the permission policy itself, we derive a robust extension over L plausible policies fixed before support evaluation. Replace log(4M/δ) in the confidence radii by log(4ML/δ), require the utility lower bound to reach the target under every policy, and minimize the largest protected-response upper bound. A union bound over all candidate–policy pairs gives simultaneous utility validity and a response gap of 2ϵR against uniformly utility-qualified candidates. Hence the guarantee covers the true policy whenever it belongs to this declared family. If the evidence cannot justify a policy family, retaining the base endpoint avoids authorizing an unsupported change. This distinguishes uncertainty about which outputs may change from error in predicting a supplied permission.
Q3. Is the gain an artifact of 32 fitted coefficients?
The effect also appears when routing completed full-model DocRE updates and in comparisons against million-parameter ImageNet heads. For DREEAM, even the optimal document-level strength allocation has a protected RMS floor 1.94 times the pair route's at matched utility on the 160 design documents. Separately, the 91 documents excluded from development give pair/native RMS ratios of 0.376 [0.356, 0.398] for DREEAM and 0.438 [0.416, 0.460] for ATLOP. Thus two language-model backbones exhibit the effect on a natural annotation revision.
For ImageNet, the existing native baselines train ResNet-50, DenseNet-121 and MobileNetV3-Large heads with approximately 1–2 million parameters. The route/native protected RMS ratios are 0.08, 0.09 and 0.42, respectively, with higher point-estimate utility for the route in all three. To isolate preservation within an identical update space, we additionally fitted coarse baselines with a direct protected-output MSE penalty and the same available permission labels. At exact calibration NLL targets of 0.01/0.02, fine routing reduces held-out protected MSE by 92.4–98.1%. The coarse baselines yield higher held-out NLL gains, so this comparison quantifies the protection–utility trade-off at a common calibration target. It complements the wider native-head and fixed-checkpoint evidence.
W2. Make the permission-coupling problem and pipeline easier to follow
AGER separates writable and protected controls before selecting a useful update. A two-output example makes this mechanism explicit: if only the first output may change, a shared strength applies to both, whereas separate controls can open the first and preserve the second. The pipeline is supplied permissions → route fitting → fixed route/scale candidates → separate utility and protection supports → utility-qualified selection or no update. The utility constraint comes first because suppressing every change would also suppress the requested improvement. The protected-response comparison then identifies the least disruptive useful candidate.