acceptodds
Under review as a conference paper at ICLR 2027

STATE-AWARE PROSPECTIVE RECOVERY AFTER NEURAL TRAINING DAMAGE

Abstract

Neural training can enter damaged states with several admissible recovery inter- ventions, yet one action must be chosen before its future consequences are known. The central question is whether current task behavior contains enough information for that choice. In controlled digits AdamW states, 79 of 80 confirmatory matched pairs reverse the preferred retain/reset action after exact parameter restoration, showing that matched current behavior can conceal different recovery-action val- ues. Self-Dynamics Network (SDN) is the branch-supervised recovery-decision framework used to study this problem. On held-out AdamW cohorts, state-aware scorers outperform a loss-only reference in binary retain/reset control, while state- conditioned policies have lower final-cohort cost than the lowest-cost fixed action in a four-action setting. Classical and neural scorers perform nearly identically, so these results do not support neural function-class superiority. A symmetry- compatible control identifies optimizer non-equivariance as one controlled route to divergent futures, while a separate seven-action Transformer teacher extends the decision principle under explicit future rollouts. These results support recovery- relevant training state as a source of decision value in the tested settings. Natural prevalence, large-scale competing actuation, and operational cost benefits remain open.

Primary area:
optimization
Keywords:
training recovery, optimizer state, prospective control

Reviews

Among:
Shape:
1234this paper, Bottom 10%
Figure 1. Mean review rating of the reviewed papers at ICLR 2027. This paper averages 1.67 over 3 reviews, above 10% of the others.
Reviewer_zgN9OpenReview ↗
Rating
2
Confidence
3
Informativeness
2
Presentation
2
Soundness
2
Read review
Paper summary

This paper studies prospective recovery decisions after neural training damage. Its central premise is that two training states can be indistinguishable under current task behavior yet have different optimal recovery actions because their optimizer states differ. The authors formalize this as recovery-specific observation aliasing and introduce the Self-Dynamics Network (SDN) framework, in which a scorer estimates the future cost associated with each admissible recovery action before committing to one. Candidate recovery branches are executed during development to generate action-specific supervisory targets; at deployment, the scorer operates on the information available at decision time rather than observing those future outcomes.

The paper builds its argument through several controlled experiments. First, it constructs matched-state pairs using momentum SGD on a sine-regression problem and AdamW on a digits-classification problem. In the AdamW experiment, one clone receives an optimizer-state update using true labels and another receives an update using 50%-corrupted labels, after which the parameters are restored exactly. The resulting states therefore have matched parameters and represented functions but different optimizer histories. Across the reported confirmatory pairs, 33/80 sine pairs and 79/80 AdamW pairs prefer different retain/reset actions. Second, the authors study optimizer non-equivariance under function-preserving ReLU rescaling, contrasting Adam with a symmetry-compatible Path-SGD control. They also examine whether admissible internal interventions can affect recovery.

The main policy experiments evaluate state-aware action selection on held-out AdamW cohorts. In the binary retain/reset task, a loss-only reference has a mean cost of 64.6614, compared with 50.0788 for the reported classical state-aware reference and 50.2302 for the neural SDNN scorer. In the four-action task, both the classical and neural state-conditioned policies have lower reported cost than the hindsight best fixed action on the final cohort. A separate seven-action Transformer teacher evaluates recovery selection using explicit 500-step future rollouts before committing. The results are promising in the controlled tasks, but the Transformer experiment is not operationally equivalent to the state-only SDN policy and incurs substantially greater update-equivalent compute.

The paper also reports useful negative evidence. Its classical and neural scorers perform almost identically; a matched-state test in another setting fails to reproduce the reversal pattern; fresh sine-controller experiments do not detect statistically significant neural-versus-fixed-controller gains; and the larger-model experiments do not execute competing recovery branches. The authors accordingly acknowledge that natural prevalence, large-scale competing recovery, and operational cost benefits remain unresolved.

Critical strengths
  1. A well-motivated problem with a concrete counterfactual construction

The most compelling contribution is the explicit separation between current predictive behavior and the complete training state needed to determine future optimization. This is a meaningful distinction for recovery: identical current predictions do not guarantee identical future trajectories after the same intervention. The matched-state construction is considerably stronger than a correlation study. By restoring parameters after the optimizer-state write, the authors control the current parameterization and represented function while manipulating optimizer history. The use of paired action branches then makes it possible to compare recovery outcomes from the same decision-time state. This provides a credible proof of possibility that restricted task-behavior observations can fail to identify the preferred recovery action.

  1. Appropriate emphasis on action value rather than future prediction alone

The paper correctly distinguishes predicting a future quantity from choosing an action that improves a recovery objective. Its self-prediction experiments show that high correlation with future dynamics is not, by itself, evidence that a model will select a better intervention. This distinction is conceptually useful. A recovery controller should ultimately be evaluated by the consequences of its decisions, not only by its ability to predict future loss or recovery time. The held-out binary and four-action experiments move beyond the diagnostic prediction tasks and test that more consequential objective.

  1. Controlled investigation of optimizer non-equivariance

The comparison between Adam and a symmetry-compatible Path-SGD control is a useful mechanistic component. The reported function preservation, nonzero Adam equivariance defect, and subsequent path divergence connect a specific optimizer property to different future training trajectories. The control helps distinguish optimizer-induced divergence from a simple failure to preserve the represented function at the intervention boundary. The authors appropriately limit this conclusion to one controlled mechanism rather than claiming that optimizer non-equivariance explains every recovery failure.

  1. Relatively careful reporting of limitations and negative results

The paper is commendably explicit about the scope of its evidence. It distinguishes state-aware decision experiments from larger-scale outcome-prediction diagnostics, identifies the Transformer teacher's extra information and compute requirements, and acknowledges that the main experiments do not establish natural prevalence or large-scale operational benefit. The absence of a detected neural-function-class advantage is also reported rather than obscured. The near-parity between classical and neural scorers is informative: it suggests that the useful information may lie in the decision-time representation and action-value formulation, rather than in the use of a neural scorer specifically.

Critical weaknesses

1: The Adam moment-reset action is confounded with bias-correction behavior

This is the most important methodological concern.

The manuscript specifies that RESET clears Adam's first- and second-moment buffers while preserving the optimizer step counter. However, Adam uses that counter to compute bias-correction factors. Clearing the moments without resetting or otherwise correcting the counter therefore changes the effective scale of the next adaptive parameter update.

To see why, let the first post-reset gradient be gg, with both moment buffers initially zero. The moment recurrences produce

v_{t+1}=(1-\beta_2)g^2.$$ If the old step counter is retained, the bias-corrected terms are $$\widehat m_{t+1} =\frac{(1-\beta_1)g}{1-\beta_1^{t+1}}, \qquad \widehat v_{t+1} =\frac{(1-\beta_2)g^2}{1-\beta_2^{t+1}}.$$ For a large counter and negligible numerical $\epsilon$, the magnitude of the adaptive gradient term approaches $$\left|\frac{\widehat m_{t+1}} {\sqrt{\widehat v_{t+1}}}\right| \approx \frac{1-\beta_1}{\sqrt{1-\beta_2}}.$$ With standard Adam settings $\beta_1=0.9$ and $\beta_2=0.999$, this factor is approximately $3.16$. By contrast, resetting the counter as well as the moment buffers gives the usual first-step bias correction, for which the corresponding ratio is approximately $1$, ignoring $\epsilon$. Thus the adaptive gradient component of the first post-reset update can differ substantially depending on whether the counter is retained. This calculation does not prove that the reported recovery improvements are caused by the discrepancy, but it shows that the RESET intervention changes more than the availability of accumulated moments. This distinction matters because the paper interprets the results as evidence for the prospective value of optimizer history. The experiment certainly evaluates a well-defined intervention, but it does not cleanly isolate moment-history removal from the accompanying bias-correction effect. The difference could influence the relative costs of KEEP and RESET and, consequently, the action-value labels used to train the recovery policy. Required clarification or experiment: Report the exact AdamW hyperparameters and counter semantics. Compare at least the existing moment-reset/counter-retained action with a moment-and-counter reset, and ideally include a control that matches the effective first post-reset update scale. If the current action is intentionally defined as moment reset with clock retention, the claims and terminology should consistently reflect that specific intervention. This concern does not invalidate the generic observation-aliasing result, but it materially weakens the interpretation of the AdamW results as isolating optimizer-moment history. Critical weakness 2: The evidence for a general recovery framework is substantially narrower than the framing suggests The headline 79/80 AdamW action reversals come from a deliberately constructed optimizer-state perturbation: one update is performed using corrupted labels, followed by exact restoration of the parameters. This design is valuable for isolating optimizer-state effects, but it is not equivalent to demonstrating that naturally occurring neural training damage frequently produces the same type of recovery-action ambiguity. The authors acknowledge that natural prevalence is unknown. The problem is that the paper's broader claims concern state-aware prospective recovery, while the strongest action-selection evidence comes from controlled, relatively small systems. The larger-scale measurements are mostly diagnostic: the manuscript explicitly states that competing recovery branches were not executed at those scales. Consequently, the large-model experiments do not establish that the proposed policy chooses better interventions for an actual large-model training incident. There is also meaningful negative evidence within the paper. The MNIST matched-state test reports 0/30 sine-direction reversals and an interaction with the opposite sign. The fresh sine-controller experiments do not detect significant neural-versus-fixed-controller gains. These results do not negate the existence of a carefully engineered counterexample, but they indicate that the effect and policy benefit should not be presumed to transfer across settings. The paper therefore supports a narrower conclusion than a general recovery framework: decision-time state can be useful in specific controlled recovery environments. It does not yet establish how broadly this advantage generalizes, how often such ambiguity occurs in natural training failures, or whether state-conditioned selection is reliable for realistic high-cost training runs. Suggested improvement: More sharply distinguish the proof-of-possibility contribution from the efficacy of a broadly applicable recovery framework. An independent replication under a different damage mechanism, optimizer-reset definition, or model/task setting would materially strengthen the empirical contribution. If that evidence is unavailable, the claims should remain explicitly confined to the tested decision problems. 3: The contribution of state-aware information is not completely separated from the contribution of the scorer and training procedure The central algorithmic question is whether additional optimizer- and gradient-state information improves recovery decisions. The paper compares a loss-only reference against state-aware classical and neural scorers, and it acknowledges in the continuation/checkpoint experiment that the estimator and representation change together. The comparisons would be easier to interpret if the restricted and state-aware observations were evaluated using identical model classes, hyperparameter-selection budgets, training partitions, and decision rules. In particular, the same logistic or histogram-gradient-boosting estimator should be trained once on restricted behavior features and once on the extended state-aware features. The neural scorer should receive an analogous ablation. Without this matched comparison, the performance difference does not fully isolate the value of additional state information from differences in model selection or fitting. The near-identical performance of classical and neural scorers is helpful, but it does not by itself resolve the information-versus-estimator question. This is not a demand for neural methods to outperform classical ones. Rather, it is a request to make the causal claim about the value of state-aware information as clean as the paper's matched-state intervention. 4: The formal results are sound at a basic level but provide limited new theory Proposition 1 formalizes the excess cost incurred when two states with the same restricted observation require different actions. Its two-action expression is a useful characterization of the decision problem, but it is a direct consequence of the definition of action value and the standard logic of partial-observation decision theory. Proposition 2 similarly formalizes the consequence of optimizer equivariance and bounds trajectory divergence by accumulating one-step defects under Lipschitz conditions. The argument is reasonable, but the conclusion follows through a standard recurrence bound once the state transformation and update equivariance assumptions are established. The paper appropriately acknowledges that the generic aliasing principle and optimizer-state dependence are established ideas. Even so, the theoretical sections do not provide a new guarantee for learning the recovery policy, estimating action values, or generalizing to previously unseen recovery states. Most of the novel contribution is empirical and conceptual rather than a new theorem or algorithmic guarantee. The related-work boundary also deserves a more explicit treatment. For example, Guo (2026), Delayed Optimizer-State Transport Shapes Short-Horizon Training Decisions directly studies optimizer-state transport in prospective training-intervention decisions, while Or (2026), Automatic Stability and Recovery for Neural Network Training studies automatic recovery after training instability. The manuscript cites these works, so the issue is not simply missing citations. It is that the precise incremental contribution of SDN relative to existing optimizer-aware intervention selection and training-recovery systems could be more sharply demonstrated. 5: The Transformer teacher does not establish deployment-equivalent recovery performance The seven-action Transformer experiment uses explicit 500-step shadow rollouts for the candidate actions before selecting one. The manuscript correctly identifies this as a different operating regime from a state-only SDN policy. The reported teacher and identity comparison also does not reach significance on the binary recovered/unrecovered outcome under the stated McNemar test ((p=0.0703)); the comparison with the predeclared fixed gauge is significant ((p=0.0215)). The continuous (V_{50}) difference and binary recovery test measure different outcomes, so the results are not inherently contradictory. Nevertheless, the evidence of improvement depends on the endpoint and comparator. Moreover, the teacher requires 5,000 recovery-update equivalents versus 2,000 for one identity trajectory, and wall-clock time, energy, and I/O are not measured. This experiment is appropriately described as a teacher or rollout-enabled extension, but it should not be interpreted as direct evidence that the state-only SDN policy is useful at Transformer scale. The distinction is especially important because the larger-model diagnostics do not evaluate competing recovery actions. Additional reproducibility concerns The paper provides a useful split summary, including fit, validation, and final cohorts, and states that final cohorts are held out from later tuning. However, the provided PDF does not expose all details necessary to reproduce the complete intervention and scorer pipeline. Important details include the precise AdamW settings, reset-clock implementation, damage-generation protocol, exact cost and utility definitions for every experiment, the hyperparameter-selection procedure for each scorer, and the unit used to calculate uncertainty in the different cohorts. The authors mention a source package and preserved experimental records. Providing executable intervention-generation and evaluation scripts, together with the complete scorer-selection configuration, would make the claims much easier to independently verify.
Questions for authors
  1. How sensitive are the AdamW findings to the reset-clock convention?

The paper resets both moment buffers while retaining the optimizer step counter. Can the authors report results for a reset that also resets the counter, alongside the current intervention? Please report the exact (β1,β2,ϵ)(\beta_1,\beta_2,\epsilon) values and whether the action reversals and held-out policy gains persist after controlling for the first post-reset effective update scale. This answer would materially affect my confidence in the main AdamW interpretation.

  1. Can the value of the state-aware information be isolated using matched scorer ablations?

Can the authors evaluate loss-only and state-aware observations using the same logistic-regression and histogram-gradient-boosting pipelines, with matching cohort splits, tuning budgets, and selection criteria? An analogous ablation for SDNN would help establish whether the observed gain is genuinely attributable to additional decision-time information rather than differences in model fitting.

  1. What exactly is supported by the larger-model experiments?

The paper reports large-model damage/outcome diagnostics but states that competing recovery branches were not executed at those scales. Could the authors identify the largest setting where the actual action-conditioned recovery policy was trained and evaluated, and clearly separate that result from outcome prediction and observational recovery logs? A bounded additional experiment in which at least two candidate recovery actions are compared under matched conditions would materially strengthen the scope of the contribution.

  1. How should the negative cross-setting result affect the stated claim?

The paper reports 0/30 matched-state reversals in its MNIST test, with an opposite interaction sign, while the fresh sine-controller comparisons do not detect a significant gain. What property of the intervention or training protocol accounts for the discrepancy with the confirmatory AdamW result? Do the authors have evidence that predicts when the aliasing construction will be effective rather than treating transfer as an open question?

  1. Limitations and Ethical Considerations

The paper is transparent about several major limitations: natural prevalence is unknown, the larger-scale studies do not execute competing recovery actions, the neural scorer shows no clear advantage over the classical scorers, and operational costs have not been measured. These are appropriate disclosures.

The remaining issue is the distinction between the demonstrated proof of possibility and the implied scope of a prospective recovery framework. The paper should ensure that the abstract and conclusion preserve this boundary. The reset-clock confound also deserves explicit treatment in the limitations or main experimental discussion, since it affects how the primary optimizer-reset results should be interpreted.

I see no clear ethics or Code of Ethics concern in the supplied manuscript. The experiments do not appear to involve human subjects or sensitive personal data, and the stated application is training stability and recovery. I would not flag the paper for ethics review based on the evidence available.

  1. Additional / Minor Suggestions

Define every recovery cost and utility quantity in one consistent location, including the normalization used for the cumulative-loss metrics and the precise interpretation of each recovery endpoint.

Clearly distinguish the state-only SDN policy, the classical state-aware scorers, the rollout-enabled Transformer teacher, and any retrospective oracle. They have different information and compute budgets and should not be conflated.

Provide an experiment-level table listing the independent evaluation unit, the number of independent states or seeds, the paired structure, the uncertainty method, and the relevant holdout boundary.

Report the action-selection agreement with the future-aware minimum together with the realized cost. Agreement alone is insufficient when action costs are heterogeneous, and cost alone can conceal whether the controller reliably chooses the correct action.

Temper claims about the Transformer extension to reflect the nonsignificant binary comparison against identity, the dependence on the chosen recovery metric, and the extra rollout computation.

Clarify the intended role of the two propositions. The formalism is useful, but the paper would be stronger if it explicitly stated which claims are established by the elementary decision-theoretic results and which require the new experiments.

2 comments
AuthorsOpenReview ↗

Response to zgN9 (1/2): AdamW accounting and the continuity of the mechanism

We appreciate the reviewer's detailed technical examination and the recognition of the original paper's distinction between current function and future training dynamics. We address the important original confound precisely and explain the mathematical connection to the current revision.

  1. AdamW moment reset and step counter. The reviewer's calculation identifies a genuine compound intervention. When moment buffers are zeroed but a large step counter is retained, the first post-reset adaptive ratio (for nonzero gradient and negligible epsilon) approaches (1-beta_1)/sqrt(1-beta_2), approximately 3.162 for beta_1=0.9 and beta_2=0.999. The reported original comparison therefore concerns moment reset with counter retention; attributing it solely to erasing momentum history would require the separate counter-reset and update-scale controls requested. The revised SDNN evidence uses an independently specified ReLU learning rule and does not rely on the old 79/80 AdamW reversal statistic.

  2. An explicit connection between the two investigations. The original Section 3 and Table 2 analyze function-preserving ReLU rescalings and their optimizer-dependent future trajectories. The new Section 2 studies the physical Jacobian and the local correction directions; Section 3 uses slice knot/amplitude coordinates invariant under positive ReLU rescaling and a balanced physical lift. Thus both address the gap between equivalent current functions and their underlying learning-state geometry, although the mechanisms and evaluation objectives differ. This relation is algebraically explicit, while the old action values and the new learning-risk endpoints remain separate mathematical quantities.

  3. Designed incidents and scope. The revision reports 150 confirmation runs under its specified four-Gaussian weight-damage and stream-switch protocol, together with 40 matched-state transport-rule experiments. It also records 0/24 successes when population spacing is tightened to 0.75d, and historical long continuations with forgetting (Section 4, Tables 5–6). The original large-model measurements were diagnostics without competing branches; no large-model recovery-selection inference is carried into the new manuscript.

  4. Information-versus-estimator identification. A matched restricted/full-observation classifier experiment would have sharpened the earlier action-selection inference. The new experiment asks a different identification question: after a common state at observation 560, how do specified transport rules change subsequent function learning? It holds the supervised/replay/cap protocol fixed and reports seed-level endpoints, while later branch trajectories evolve independently (Section 4, Figure 4).

AuthorsOpenReview ↗

Response to zgN9 (2/2): theory, negative findings, compute, and reproducibility

  1. Theory and incremental novelty. The earlier observation-aliasing proposition and optimizer-equivariance recurrence are useful formalizations of established reasoning; the revision presents different, precisely scoped results. Section 2 derives a conditional Omega_P(N log N) first-hitting-time lower bound for a specified near-collinear reference gradient flow, necessary signed-curvature and physical-energy conditions for the four-Gaussian objective, and an exact residual-contraction identity for a local three-knot hat coefficient correction. Existing ReLU/spline literature supplies related tools and precedents. The full coupled SDNN algorithm in Section 3 is distinct from the reference flow, and the paper claims no general convergence theorem for it.

  2. Former Transformer experiment. The seven-action teacher's candidate rollouts and extra update-equivalent cost gave it a different information and compute budget from the state-only policy. The original recovery-rate comparison to identity had p=0.0703, with recovery speed measured separately. These claims are not used to establish the revised SDNN results. In the new Table 4, external baselines receive equal observations but have substantially lower realized parameter energy than SDNN; this precludes a resource-matched superiority conclusion.

  3. Negative evidence. The original MNIST matched-state probe produced 0/30 sine-direction reversals with an opposite interaction sign, and the fresh sine-controller experiments lacked significant neural-versus-fixed gains. These limited transfer of the original recovery results. The new study transparently reports its own limitations: 0/24 successes at 0.75d spacing and historical long-run forgetting examples (Tables 5–6). These are distinct tests, not a purported replication of the old probes.

  4. Reproducibility and endpoints. The prepared reproducibility archive contains the revision's LaTeX, fixed learner source, experimental scripts, seed-level records, and the matched-state diagnostic analyses. We distinguish frozen outputs from independently rerun checks and do not equate observed worker time with matched FLOPs. The revised endpoint is four-population squared-error risk, evaluated for old and new populations; the original recovery cost and action utility are different endpoints. Accordingly, the current claims are restricted to the explicitly specified learner, synthetic observation stream, and achieved-resource regime.

Thank you for insisting that mechanism, evidence scope, and causal attribution be presented with mathematical precision.

Reviewer_QeGrOpenReview ↗
Rating
1
Confidence
3
Informativeness
1
Presentation
1
Soundness
1
Read review
Paper summary

This paper studies whether current task behavior is sufficient for choosing recovery actions after neural training damage. It constructs states with identical parameters and loss observations but different optimizer memories, showing that their preferred recovery actions can differ. The proposed SDN framework predicts action-specific recovery costs from decision-time information. Held-out AdamW experiments show benefits from optimizer-state features, with classical and neural scorers performing nearly identically. A separate Transformer experiment evaluates recovery selection using explicit candidate rollouts.

Critical strengths
  • Well-controlled mechanism experiments. Exact parameter restoration isolates optimizer memory while matching current model behavior. The resulting action reversals provide direct evidence that loss observations can conceal recovery-relevant information.

  • Careful separation of development and evaluation. Scorers are selected and frozen before fresh final cohorts are generated. The analysis also treats damaged states, rather than their correlated action branches, as the inferential units.

  • Transparent reporting of limitations and negative results. The paper distinguishes information benefits from neural-model superiority, explicitly separates rollout-based control from state-only deployment, and acknowledges that large-scale diagnostics do not establish recovery-policy effectiveness.

Critical weaknesses
  • The practical relevance of the constructed damage remains uncertain. The strongest results rely on deliberately modifying optimizer memory and then restoring model parameters exactly. This construction establishes that recovery-action ambiguity can occur, but not its prevalence or importance in naturally occurring failures. Evaluation should include realistic damage affecting parameters and optimizer states jointly, together with transfer to unseen failure mechanisms.

  • The algorithmic contribution beyond standard cost prediction is limited. SDN uses supervised action-cost estimation followed by minimum-cost selection, and classical models match or slightly outperform the neural scorer. The main contribution therefore rests on identifying useful decision information. Comparisons with simple optimizer-state thresholds and established recovery heuristics are needed to establish the value of learning a scorer.

  • The Transformer improvement requires substantially greater computation. The teacher executes seven candidate rollouts and uses 5,000 recovery-update equivalents, compared with 2,000 for the identity baseline. Its recovery-rate improvement over identity is not significant at the two-sided 5% level (p=0.0703p=0.0703), although the recovery-speed metric improves. Equal-total-compute comparisons are necessary to determine whether branching offers a practical advantage.

Questions for authors

See weakness

2 comments
AuthorsOpenReview ↗

Response to QeGr: mechanism, synthetic damage, and computational comparison

Thank you for the detailed review and, in particular, for recognizing the strength of the original matched-state construction and the separation of development from evaluation. Your concerns about artificial interventions, the modest algorithmic increment of cost scoring, and computational comparability are central to evaluating the revised study.

  1. Scientific and algorithmic contribution. The new manuscript studies a specified fixed-width ReLU learner rather than a supervised recovery-action scorer. Its update combines activity-directed movement of existing gates, coefficient-dependent attenuation, supervised local three-knot correction, and bounded replay (Section 3). Adaptive ReLU knots and spline hats are established ideas; the specific subject here is their coupling during online learning and its effect on retaining responses after a population change. In 40 matched-state continuations, the full rule yields mean risk 0.0253, coefficient-weighted movement matching 0.0533, and raw-movement matching 0.4665 (Section 4, Figure 4); the respective mean final physical energies per neuron for the full and raw-matched variants are 59.989 and 59.893. Because branch states later diverge, these results measure the ensuing learning trajectories, not a pure one-step effect.

  2. Constructed damage and external validity. The protocol imposes first-layer weight noise and readout-sign changes after 240 old-population observations, then presents 480 observations from new Gaussian populations without a switch flag (Section 4). All 150 confirmation width-seed runs attain R_720<0.1. Conversely, shrinking population spacing to 0.75 of the nominal distance produces 0/24 successes in a development stress test (Table 6). These results establish reproducible behavior and a clear failure regime in a synthetic model; they leave natural failure prevalence and transfer to larger architectures as separate empirical questions.

  3. The original classical/neural scorer comparison. The previous observation that classical state-aware scorers match the neural cost scorer remains an important limit on the original neural-function-class claim. The current study evaluates a different learning mechanism and makes no claim of neural scorer superiority.

  4. Compute and the seven-action teacher. The original Transformer teacher used future candidate rollouts and substantially greater compute, and its recovery-rate comparison against identity had a two-sided p-value of 0.0703. It is not an evidentiary basis for the revised method. The current paper separately reports runtime and the substantially unequal physical energies of SDNN and external baselines; it does not claim compute- or energy-matched dominance (Section 4, Table 4).

The revised contribution is therefore a testable representation-learning mechanism with explicit mathematical and experimental scope. We hope this more direct evidence addresses the concern about what the Self-Dynamics study actually contributes.

Reviewer_QeGrOpenReview ↗

Reviewer response to the revision and rebuttal

Thank you for the candid response and for clearly documenting the scope of the revision.

I appreciate that the authors openly acknowledge the limitations of the original submission (e.g., the AdamW step-counter confound, the parity between classical and neural cost scorers, and the compute-unmatched, statistically non-significant Transformer teacher result with p=0.0703).

However, rather than resolving these issues on the originally reviewed recovery-action selection problem, the revision replaces the core algorithm, evaluation endpoints, theoretical results, and experimental suite with a substantially different study (online ReLU gate reorganization on a synthetic four-Gaussian task). Assessing an essentially new manuscript and experimental pipeline from scratch falls outside the scope of a normal rebuttal revision. Moreover, even on its own stated terms, the revised evidence remains confined to a synthetic toy setup, lacks resource-matched superiority over external baselines (due to unequal parameter energies), and fails under tighter spacing (0/24 at 0.75d).

Therefore, while I commend the authors' transparency and scientific care in scoping the new draft, the manuscript is not ready for acceptance at ICLR, and I maintain my original rating.

Reviewer_vpP3OpenReview ↗
Rating
2
Confidence
2
Informativeness
2
Presentation
1
Soundness
1
Read review
Paper summary

This paper introduces the Self-Dynamics Network (SDN), a framework that predicts the future recovery costs of different recovery actions using training-state information. The authors show that state-aware recovery decisions outperform a baseline that uses only loss information in their binary recovery experiments.

Critical strengths

The paper provides controlled experiments showing that training states with identical model parameters and task behavior can require different recovery actions due to differences in optimizer states.

Critical weaknesses
  1. Limited recovery action space. Although the paper considers several recovery methods across different experiments, the main evaluation is limited to a small number of predefined actions, particularly KEEP and RESET. It is unclear how well the proposed framework would work when selecting among a broader range of practical recovery methods.

  2. Weak motivation for the loss-only baseline. The main baseline uses only loss information, while gradient and optimizer statistics are typically available during training. It is unclear why a recovery controller would be restricted to loss information. Comparisons with practical recovery heuristics that use these additional statistics would make the results more convincing.

  3. Unclear necessity of a learned recovery-action selector. Given that training-state statistics are available, it is unclear whether recovery-action selection is sufficiently challenging to require a learned scorer. For example, simple diagnostic rules based on abnormal gradient or optimizer statistics might already identify appropriate recovery actions. The paper does not sufficiently demonstrate cases where such approaches fail or where the proposed framework provides a clear advantage.

Questions for authors
  1. Why were these particular recovery methods selected for evaluation?
  2. Why does the baseline use only loss information when other training statistics are available?
  3. Why is a learned scorer needed instead of simple diagnostic rules?
1 comment
AuthorsOpenReview ↗

Response to vpP3: action scope, comparison controls, and the learned mechanism

Thank you for recognizing the matched-state finding and for identifying three important limits of the original recovery-selection formulation. The revision examines the learning process behind the broader Self-Dynamics question, with a different and explicitly specified empirical objective.

  1. Limited action space. The original KEEP/RESET and layerwise experiments evaluated predefined recovery actions. The revised SDNN updates existing ReLU gates and coefficients continuously within a fixed-width network (Section 3, Algorithm 1). Its claims concern online function adaptation and retention, rather than selection from a broader catalog of recovery interventions. This also makes the mechanism itself observable through knot positions, local corrections, and changes in fitted function.

  2. Loss-only comparison. The reviewer is right that loss-only was an intentionally restricted information baseline in the initial recovery experiment, and that practical optimizer-aware heuristics are stronger alternatives. The revised evidence uses a more direct test of the structural-learning mechanism: 40 paired seeds undergo multiple post-560 branches that alter specified gate-transport rules, while retaining the supervised-update, replay, and cap protocols (Section 4, Figure 4). External learner comparisons use equal observations but reach very different physical energies; the paper reports this and limits its comparison claims.

  3. Why learn? The present method uses no learned action-cost selector. Instead, supervised coefficient changes affect subsequent activity-driven motion through the amplitude factor in the gate-transport rule (Section 3, Eq. (3)). In the 40 paired seeds, mean final risk is 0.0253 for SDNN, 0.0533 for coefficient-weighted movement matching, and 0.4665 for raw-displacement matching. These tests identify a consequential coupling between learned coefficients and structural movement within the tested four-Gaussian setting. They support the mechanistic contribution without claiming universal superiority over simpler or previously developed moving-knot methods.

The original function-preserving ReLU rescaling analysis and the revised Jacobian and knot-coordinate analysis share a concrete mathematical concern: present function equivalence versus subsequent learning dynamics. The revision supplies a concrete representation-level algorithm and controlled tests of that distinction. We appreciate the opportunity to make the evidence and its scope clearer.

Comments on the paper

1 comment
AuthorsOpenReview ↗

Scientific continuity and technical evidence in Submission 3934

We thank the reviewers and Area Chair for their careful evaluation. We would like to make the scientific continuity of the Self-Dynamics study explicit and identify exactly what the revised manuscript establishes.

The shared question is how the internal state and parameterization of a neural network determine its subsequent learning, beyond the function currently observed. The original submission studied this through recovery: matched present behavior could conceal optimizer histories that produce different future trajectories and intervention values. The revision investigates the representation dynamics more directly: which function changes are locally accessible, and how can existing ReLU gates reorganize while previous responses are retained?

A precise mathematical link is positive-homogeneous ReLU reparameterization. The original Section 3 and Table 2 examine function-preserving ReLU rescalings and optimizer non-equivariance. For c[w^T x]_+, positive rescaling (w,c) -> (lambda w,c/lambda) preserves the represented function while altering the physical parameter Jacobian and energy. The revision studies learning accessibility through K=NJJ^T (Section 2), and uses slice knot/amplitude coordinates invariant under this same rescaling and a balanced physical lift (Section 3). This shared structure connects present-function equivalence to future learning dynamics; it does not equate the former action-selection model with the new update rule.

The revised contribution is a defined, fixed-width online method combining activity-driven gate transport, coefficient-sensitive attenuation, supervised local correction and bounded replay (Section 3, Algorithm 1), with explicit theoretical scope and controlled experiments. In 40 matched-state continuations (Section 4, Figure 4), full SDNN reaches mean terminal risk 0.02526, versus 0.46647 under raw-displacement matching, with respective mean terminal physical energies per neuron of 59.989 and 59.893. The experiment tests the importance of the transport rule within the same learning protocol; branch states subsequently evolve independently. Across three widths, 50 confirmation seeds each meet the reported R_720 < 0.1 threshold. Geometry sensitivity and unequal achieved energy against external baselines are also reported.

The revision changes the method and evaluation endpoints from recovery-action scoring to direct function learning after disruption. We regard it as a mechanism-focused development of the same Self-Dynamics research question, with its new evidence evaluated on its stated terms. We respectfully ask the reviewers and Area Chair to consider this explicit mathematical continuity and the revised paper's actual technical results in their assessment of Submission 3934.

From OpenReview, CC BY 4.0. Authors as signed there; shown unedited.

Related papers

Loading the map…

Discussion (0)

Sign in to comment.