Lifelong Machine Learning Systems: Beyond Learning Algorithms
Bibliographic record
Abstract
Lifelong Machine Learning, or LML, considers sys-tems that can learn many tasks from one or more do-mains over its lifetime. The goal is to sequentially re-tain learned knowledge and to selectively transfer that knowledge when learning a new task so as to develop more accurate hypotheses or policies. Following a re-view of prior work on LML, we propose that it is now appropriate for the AI community to move beyond learning algorithms to more seriously consider the na-ture of systems that are capable of learning over a life-time. Reasons for our position are presented and poten-tial counter-arguments are discussed. The remainder of the paper contributes by defining LML, presenting a ref-erence framework that considers all forms of machine learning, and listing several key challenges for and ben-efits from LML research. We conclude with ideas for next steps to advance the field.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.009 | 0.027 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.002 | 0.011 |
| Scholarly communication | 0.009 | 0.031 |
| Open science | 0.004 | 0.006 |
| Research integrity | 0.005 | 0.009 |
| Insufficient payload (model declined to judge) | 0.007 | 0.002 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".