Ideally, in order to make the memory best represents a previous task, we hope to choose diverse samples that best approximate the distribution of task data.
distribution approximation itself is a hard problem and will be inefficient due to its combinatorial optimization nature.