We study forgetting rates, the loss of earlier knowledge as new tasks arrive in continual learning. We provide improved bounds under random orderings, optimal rates via regularization, and an analysis of greedy task ordering.
