← Search

Matan Tsipory

1 accepted papers

2025

Are Greedy Task Orderings Better Than Random in Continual Linear Regression?

NeurIPS 2025poster

We analyze task orderings in continual learning for linear regression, assuming joint realizability of training data. We focus on orderings that greedily maximize dissimilarity between consecutive tasks, a concept briefly explored in prior work but still surrounded by open questions. Using tools fro…

Cited by 0SourceScholar