NeurIPS · 2025 · Journal article

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

Matan Tsipory, Ran Levinstein, Itay Evron, Mark Kong, Deanna Needell, Daniel Soudry

Rendered by arXiv from the LaTeX source. If anything looks wrong, switch to the PDF.HTML · PDF · Open in a new tab ↗ · Close

Published in: Neural Information Processing Systems
Date: 2025-10-22
Citations: 3
arXiv: 2510.19941 ↗

Cite

@article{tsipory2025greedy,
  title = {Are Greedy Task Orderings Better Than Random in Continual Linear Regression?},
  author = {Matan Tsipory and Ran Levinstein and Itay Evron and Mark Kong and Deanna Needell and Daniel Soudry},
  year = {2025},
  journal = {Neural Information Processing Systems},
  eprint = {2510.19941},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2510.19941},
}