ICML · 2020 · Conference paper · Top venue

Optimal Continual Learning has Perfect Memory and is NP-hard

Jeremias Knoblauch, Hisham Husain, Tom Diethe

University of Warwick · The Alan Turing Institute · Australian National University · Amazon (Germany)

Published in
International Conference on Machine Learning
Date
2020-06-09
Citations
119
arXiv
2006.05188
Cite
@inproceedings{knoblauch2020optimal,
  title = {Optimal Continual Learning has Perfect Memory and is NP-hard},
  author = {Jeremias Knoblauch and Hisham Husain and Tom Diethe},
  year = {2020},
  booktitle = {International Conference on Machine Learning},
  eprint = {2006.05188},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2006.05188},
}