{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/a-strategy-for-an-uncompromising-incremental","title":"A Strategy for an Uncompromising Incremental Learner","arxiv_id":"1705.00744","date":"2017-05-02","proceeding":null,"authors":["Ragav Venkatesan","Hemanth Venkateswara","Sethuraman Panchanathan","Baoxin Li"],"abstract":"Multi-class supervised learning systems require the knowledge of the entire\nrange of labels they predict. Often when learnt incrementally, they suffer from\ncatastrophic forgetting. To avoid this, generous leeways have to be made to the\nphilosophy of incremental learning that either forces a part of the machine to\nnot learn, or to retrain the machine again with a selection of the historic\ndata. While these hacks work to various degrees, they do not adhere to the\nspirit of incremental learning. In this article, we redefine incremental\nlearning with stringent conditions that do not allow for any undesirable\nrelaxations and assumptions. We design a strategy involving generative models\nand the distillation of dark knowledge as a means of hallucinating data along\nwith appropriate targets from past distributions. We call this technique,\nphantom sampling.We show that phantom sampling helps avoid catastrophic\nforgetting during incremental learning. Using an implementation based on deep\nneural networks, we demonstrate that phantom sampling dramatically avoids\ncatastrophic forgetting. We apply these strategies to competitive multi-class\nincremental learning of deep neural networks. Using various benchmark datasets\nand through our strategy, we demonstrate that strict incremental learning could\nbe achieved. We further put our strategy to test on challenging cases,\nincluding cross-domain increments and incrementing on a novel label space. We\nalso propose a trivial extension to unbounded-continual learning and identify\npotential for future development.","url_abs":"http://arxiv.org/abs/1705.00744v2","url_pdf":"http://arxiv.org/pdf/1705.00744v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"a-strategy-for-an-uncompromising-incremental","repo_url":"https://github.com/ragavvenkatesan/Incremental-GAN","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"class-incremental-learning","task_name":"Class Incremental Learning"},{"task_slug":"continual-learning","task_name":"Continual Learning"},{"task_slug":"incremental-learning","task_name":"Incremental Learning"},{"task_slug":"philosophy","task_name":"Philosophy"},{"task_slug":"class-incremental-learning-1","task_name":"class-incremental learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"ragavvenkatesan/Incremental-GAN","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"93fa4a48954cc88ec9f2f538109f84b2b8eefea20ad335b9e7cdb7c908cfaa81","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}