In gradual adaptation, how should the training time on each task change as the number of intermediate tasks increases? We study this question for overparameterized linear regression tasks that change smoothly and share a zero-loss solution. With
N tasks and training time
sN on each, the final learning progress converges to a continuum curve when
NsN→τ. The limiting progress is
Θ(τ) for small
τ and
Θ(τ−1) for large
τ, so both very short and very long training produce little progress. It follows that optimal per-task training times scale as
sN⋆=Θ(N−1), equivalently
NsN⋆=Θ(1). Experiments on gradually rotated MNIST and a natural Yearbook time shift are consistent with less per-task training as the path is divided more finely.