- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This paper formulates task-incremental continual learning as an asymmetric Nash bargaining problem with absent players represented by imperfect proxies. It introduces second-order utilities and tolerable-forgetting budgets, and derives a robust bargaining objective under bounded proxy errors. The analysis connects bargaining sensitivity to one-step loss increases and provides a computable damage certificate. Experiments examine proxy dominance, certificate coverage, curvature approximation errors, and task-incremental CIFAR-100 performance. The curvature bargain outperforms the tested first-order bargains but remains below replay at substantially greater computational cost.
Critical strengths
1.The paper presents a novel formulation of continual learning as an asymmetric Nash bargaining problem.
2.The theoretical analysis connects proxy errors, update deviations, and catastrophic forgetting.
3.The experiments include mechanism diagnostics, and the paper candidly reports its practical limitations.
Critical weaknesses
1.The method does not sufficiently address its central motivation. The paper is motivated by systematic, non-vanishing proxy errors that evolve with parameter drift. However, the proposed robust bargain relies on reliable gradient and curvature error bounds, which are precisely the quantities that are difficult to obtain when past tasks are absent. Training sets the gradient uncertainty radius to zero and uses a curvature uncertainty constant far below the measured operator-norm error. Although the analysis explains how to protect past tasks when error bounds are known, it does not sufficiently explain how this protection can be achieved when proxy errors are unknown and continually changing. The central difficulty is therefore partly shifted to reliably estimating these error bounds.
2.The experiments do not sufficiently isolate the contribution of Nash bargaining itself. The method incorporates second-order utilities, tolerable-forgetting budgets, and worst-case uncertainty penalties into the Nash bargaining objective. However, these components could also be incorporated into optimization methods that directly constrain damage to past tasks. The existing analysis does not sufficiently clarify what additional task-protection properties or update behavior Nash bargaining itself provides.
3.The experimental scope and computational efficiency provide insufficient support for broad effectiveness. The real-data experiments cover only one task-incremental CIFAR-100 setting, a small network, and three random seeds. Systematic evaluations across different numbers of tasks, memory capacities, and tolerable-forgetting budgets are missing.
Questions for authors
1.How can the gradient and curvature error bounds be reliably estimated and dynamically updated when past tasks are absent and proxy errors evolve with model updates?
2.Compared with constrained optimization using the same second-order information, uncertainty penalties, and tolerable-forgetting budgets, what additional task-protection properties or update behavior does the Nash bargaining objective provide? Could controlled comparisons that match these components distinguish the contributions of curvature modeling, budget choices, and the bargaining mechanism, and further clarify how the framework captures update-induced proxy drift?
3.Given that 99.99% of proposed updates require shrinkage, could the authors compare retention of past tasks, learning on the current task, and wall-clock time with and without the admission control mechanism? Could its benefits also be evaluated across different budgets and task-sequence lengths to establish whether high certificate coverage and substantial computational overhead translate into effective continual-learning performance?
Response to Reviewer xhY8
We thank the reviewer for identifying the central weakness of the submission. Please first see the General Response (GR), which corrects errors in the submission; we apologize for them.
W1 / Q1. How can gradient and curvature error bounds be estimated when tasks are absent and proxy errors drift? We agree with the premise: they cannot be estimated reliably, and the submission trained with r = 0 and ζ far below the measured error. Rather than estimating these bounds, the revised approach no longer needs them. Forgetting is certified directly on held-out examples from each task that never influence training, using concentration bounds on paired 0-1 loss differences relative to each task's anchor (revised Section 6.2). Because the certificate measures realized forgetting at the delivered model, proxy drift during training does not affect its validity. With δ = 0.05 fixed in advance we observe no coverage violations, and the bound width is ≈ 0.03. The quadratic model remains only as a proposal mechanism.
W2 / Q2. What does Nash bargaining add over constrained optimization with the same second-order information, penalties, and budgets? We ran exactly this comparison, with the same proxies and budgets. Our first constrained baseline was flawed (the trust radius equaled τ, GR §1c), which produced a misleading 35-point gap. After correcting it, constrained QP attains the highest A_20 on all three seeds (0.672); bargaining does not (0.647, or 0.663 on seed 0 after tuning). The difference between the objectives is behavioral. At three shared checkpoints (same parameters and proxies, both solvers, 3 solves each), at matched step length (‖Δ‖ ≈ 0.55) the bargaining step causes ~3× lower true damage to past tasks (0.0065 vs. 0.0207) and never makes a constraint tight, whereas QP saturates them. However, this lower per-step damage does not yield a lower certified bound at the delivered model (mean UCB 0.122 vs. 0.113 for QP). We no longer claim an advantage for Nash bargaining (GR §4).
Q3. Admission control on vs. off, budgets, and sequence lengths. We now compare training with and without admission control, plus a fixed step-scaling control with the same mean step length: A_20 is 0.593 (off), 0.551 (fixed scaling), and 0.472 ± 0.120 (admission). In some runs the budget is exhausted late in the stream and the last tasks are not learned; the variance comes from kernel nondeterminism amplified ~38× by the line search and vanishes under deterministic kernels. We therefore certify after training rather than enforcing budgets during training. Across budgets τ ∈ {0.05, 0.1, 0.4}, certification succeeds in 0/18, 1/18, and 18/18 cells. We did not evaluate different sequence lengths within the discussion period; we acknowledge this limitation.
W3. Scope. We agree that a single dataset and backbone are insufficient for broad claims, and we have narrowed the claims accordingly (GR §4).