Knowledge acquisition with forgetting: an incremental and developmental setting
Open accessAbstract
Identifying the balance between remembering and forgetting is the key to abstraction in the human brain and, therefore, the creation of memories and knowledge. We present an incremental, lifelong view of knowledge acquisition which tries to improve task after task by determining what to keep, consolidate and forget, overcoming the stability–plasticity dilemma. Our framework can combine any rule-based inductive engine (which learns new rules) with a deductive engine (which derives a coverage graph for all rules) and integrate them into a lifelong learner. We rate rules by introducing several metrics through the first adaptation, to our knowledge, of the minimum message length (MML) principle to a coverage graph, a hierarchical assessment structure which handles evidence and rules in a unified way. The metrics are used to forget some of the worst rules and also to consolidate those selected rules that are promoted to the knowledge base. This mechanism is also mirrored by a demotion system. We evaluate the framework with a series of tasks in a chess rule learning domain.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Solutions to forgetting may be required to maintain performance over many tasks.
“Solutions to forgetting such as (Mart´ ınez-Plumed et al. 2015) may be required to maintain performance over many tasks.”
From Memory Matters: The Need to Improve Long-Term Memory in LLM-Agents (2024) · cites this paper as Martínez-Plumed et al. 2015
Cites
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440 · see citing works
Concept cells: the building blocks of declarative memory functions
Quiroga, R. Q. (2012) · Nature reviews. Neuroscience · doi:10.1038/nrn3251 · Cited by 472 · cited 2× · see citing works
“The ability to focus on what to discard, what is not relevant, is becoming more relevant not only in cognitive science and neuroscience (Quiroga, 2012), but also in AI (e.”
Background
Flagged first, then by citations
Cited by
Sorted by citations
Memory Matters: The Need to Improve Long-Term Memory in LLM-Agents
Hatalis, K., Christou, D., Myers, J., Jones, S., Lambert, K., Amos-Binks, A., Dannenhauer, Z., & Dannenhauer, D. (2024) · Proceedings of the AAAI Symposium Series · doi:10.1609/aaaiss.v2i1.27688 · Cited by 42 · see citing works
Forgetting to Learn Logic Programs
Cropper, A. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v34i04.5776
- Authors
- Martínez-Plumed, F., Ferri, C., Hernández-Orallo, J., & Ramírez-Quintana, M. J.
- Affiliations
- DSIC, Universitat Politècnica de València, València, Spain
- Universitat Politècnica de València (ES)
- ORCID
- Ferri, Cèsar
- Venue
- Adaptive Behavior
- Publisher
- SAGE Publications
- Published
- 2015-10
- Volume
- 23
- Issue
- 5
- Pages
- 283-299
- ISSN
- 1059-7123 (ISSN-L)
- 1741-2633
- OpenAlex
- W2224049000
- Cited by
- 14
- References
- 2
- Citations by year
- 2025: 1 · 2024: 2 · 2022: 1 · 2020: 4 · 2019: 1 · 2017: 4 · 2016: 1
- FWCI
- 1.63
- Type
- journal article
- Language
- en
- Open access
- green
- hdl.handle.net
- Licence
- Locations
- Adaptive Behavior (publishedVersion)
- RiuNet (Universitat Politècnica de València) (submittedVersion, cc-by-nc-nd)
- Funders
- Ministerio de Economía y Competitividad (TIN 2013-45732-C4-1-P, PCIN-2013-037)
- Generalitat Valenciana (PROMETEO2011/052)
- CHIST-ERA
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › AI-based Problem Solving and Planning
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
- Physical Sciences › Computer Science › Artificial Intelligence › Cognitive Computing and Networks
- Keywords
- knowledge acquisition, forgetting, lifelong learning, stability-plasticity dilemma, minimum message length, rule selection, knowledge consolidation, demotion, incremental learning
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review