Optimal Continual Learning has Perfect Memory and is NP-hard.
Jeremias KnoblauchHisham HusainTom DiethePublished in: CoRR (2020)
Keyphrases
- np hard
- learning algorithm
- learning tasks
- learning systems
- optimal solution
- worst case
- learning problems
- scheduling problem
- online learning
- knowledge acquisition
- supervised learning
- cognitive load
- learning scheme
- learning analytics
- main memory
- unsupervised learning
- neural network
- dynamic programming
- active learning
- learning process
- lower bound
- case study
- feature selection
- machine learning