Affiliation:
1. Université Laval, Quebec, Canada
2. Western University, London, Ontario, Canada
3. University of Macau, Taipa, Macau, China
Abstract
In this article, we formulate lifelong learning as an online transfer learning procedure over consecutive tasks, where learning a given task depends on the accumulated knowledge. We propose a novel theoretical principled framework, lifelong
online
learning, where the learning process for each task is in an incremental manner. Specifically, our framework is composed of two-level predictions: the prediction information that is solely from the current task; and the prediction from the knowledge base by previous tasks. Moreover, this article tackled several fundamental challenges: arbitrary or even non-stationary task generation process, an unknown number of instances in each task, and constructing an efficient accumulated knowledge base. Notably, we provide a provable bound of the proposed algorithm, which offers insights on the how the accumulated knowledge improves the predictions. Finally, empirical evaluations on both synthetic and real datasets validate the effectiveness of the proposed algorithm.
Funder
Natural Sciences and Engineering Research Council of Canada (NSERC), Discovery Grants program, the Science and Technology Development Fund, Macau SAR
University of Macau
Publisher
Association for Computing Machinery (ACM)
Reference41 articles.
1. Pierre Alquier The Tien Mai and Massimiliano Pontil. 2016. Regret bounds for lifelong learning. In Proceedings of the 20th International Conference on Artificial Intelligence and Statistics (Proceedings of Machine Learning Research Vol. 54) . Aarti Singh and Jerry Zhu (Eds.). PMLR 261–269. https://proceedings.mlr.press/v54/alquier17a.html.
2. Identifying Real Estate Opportunities Using Machine Learning
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献