- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies split-conformal prediction for LLMs that undergo sequential LoRA fine-tuning. It shows that reusing a conformal threshold calibrated on an earlier model causes large drops in task-level coverage, much larger than the accompanying drops in accuracy. Across five models and seven classification sequences, coverage falls by 20.6 points on average while accuracy falls by 5.6. The authors attribute this to drift in the nonconformity-score CDF, which they measure with KS distance and decompose in theory into parameter-induced and task-distribution terms. Their remedy, “calibration replay,” keeps a small held-out labeled buffer per task (up to 200 examples) and recomputes each task’s threshold under the current model after every update. In other words, it is Mondrian split-conformal re-run after each fine-tuning step. With known task identity, standard exchangeability gives finite-sample marginal coverage. Empirically, the coverage gap shrinks to about 1–2 points with compact prediction sets, outperforming pooled recalibration, temperature scaling, ACI, weighted CP, and a max-threshold baseline. A zero-shot task router retains most of the benefit when task identity is unknown.
Critical strengths
Relevant practical warning. The paper emphasizes that continual-learning evaluations should track coverage and uncertainty, not only accuracy. This is a useful message for deployments that rely on confidence for abstention or routing. Broad empirical sweep. The evaluation covers several model families and scales, a range of task sequences, ten accuracy-preserving continual-learning methods, and multiple calibration baselines. It also reports set size and singleton rate alongside coverage. Clear scoping of claims. The claim-support table, the explicit assumptions, and the separation of exploratory generation results make it clear what is proven and what is only observed.
Critical weaknesses
- The finding is expected, and the method is standard. Conformal guarantees require exchangeability under the current model, so a threshold calibrated on an older model is not expected to stay valid after fine-tuning. Calibration replay is ordinary per-task (Mondrian) split-conformal recalibration, re-run after each update, and the theory consists of textbook results. The contribution is therefore mainly empirical.
- The advanced baselines are unconvincing. ACI has a long-run coverage guarantee, so a 7.2-point gap over thousands of test points needs explanation. Weighted CP should collapse to plain recalibration when calibration and test data share a distribution, and it remains unclear which model was used to compute its scores.
- Some results look unusually clean and need verification. Figure 2b reports between KS distance and coverage drift, although KS distance is only an upper bound on drift at a fixed threshold. Most table entries are integers with very regular standard deviations. It is also unclear whether “coverage loss” counts only under-coverage, since Table 5 contains many over-covered cells.
- The main baseline is a straw man, and the hard problem is assumed away. In practice, few would reuse an old threshold after updating the model. The interesting question is how to maintain coverage when fresh labeled calibration data is scarce. The method assumes exactly that resource: a labeled, held-out buffer for every task, plus known task identity.
Questions for authors
See weakness