{"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/online-continual-learning-with-no-task","title":"Gradient based sample selection for online continual learning","arxiv_id":"1903.08671","date":"2019-03-20","proceeding":"NeurIPS 2019 12","authors":["Rahaf Aljundi","Min Lin","Baptiste Goujaud","Yoshua Bengio"],"abstract":"A continual learning agent learns online with a non-stationary and never-ending stream of data. The key to such learning process is to overcome the catastrophic forgetting of previously seen data, which is a well known problem of neural networks. To prevent forgetting, a replay buffer is usually employed to store the previous data for the purpose of rehearsal. Previous works often depend on task boundary and i.i.d. assumptions to properly select samples for the replay buffer. In this work, we formulate sample selection as a constraint reduction problem based on the constrained optimization view of continual learning. The goal is to select a fixed subset of constraints that best approximate the feasible region defined by the original constraints. We show that it is equivalent to maximizing the diversity of samples in the replay buffer with parameters gradient as the feature. We further develop a greedy alternative that is cheap and efficient. The advantage of the proposed method is demonstrated by comparing to other alternatives under the continual learning setting. Further comparisons are made against state of the art methods that rely on task boundaries which show comparable or even better results for our method.","url_abs":"https://arxiv.org/abs/1903.08671v5","url_pdf":"https://arxiv.org/pdf/1903.08671v5.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":"online-continual-learning-with-no-task","repo_url":"https://github.com/rahafaljundi/Gradient-based-Sample-Selection","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"online-continual-learning-with-no-task","repo_url":"https://github.com/wannabeOG/MAS-PyTorch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"online-continual-learning-with-no-task","repo_url":"https://gitlab.com/viper-purdue/ocil-real-world-food-image-classification","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"online-continual-learning-with-no-task","repo_url":"https://github.com/ContinualAI/avalanche","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"online-continual-learning-with-no-task","repo_url":"https://github.com/aimagelab/mammoth","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"class-incremental-learning","task_name":"Class Incremental Learning"},{"task_slug":"continual-learning","task_name":"Continual Learning"},{"task_slug":"diversity","task_name":"Diversity"},{"task_slug":"class-incremental-learning-1","task_name":"class-incremental learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1903.08671","atlas_url":"https://app.syntology.ai/?focus=1903.08671","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1903.08671"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1903.08671\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1903.08671"},"call":"get_concepts_for_paper(arxiv_id=\"1903.08671\")"}],"by_repo":[{"repo":"rahafaljundi/Gradient-based-Sample-Selection","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"wannabeOG/MAS-PyTorch","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["1612.00796","1711.09601"],"harvested_for_calls":[{"arxiv_id":"1612.00796","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1612.00796"},"call":"get_harvested_code_for_paper(arxiv_id=\"1612.00796\")"},{"arxiv_id":"1711.09601","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1711.09601"},"call":"get_harvested_code_for_paper(arxiv_id=\"1711.09601\")"}]},{"repo":"gitlab.com/viper-purdue/ocil-real-world-food-image-classification","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"ContinualAI/avalanche","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["1606.09282","2007.13904"],"harvested_for_calls":[{"arxiv_id":"1606.09282","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1606.09282"},"call":"get_harvested_code_for_paper(arxiv_id=\"1606.09282\")"},{"arxiv_id":"2007.13904","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2007.13904"},"call":"get_harvested_code_for_paper(arxiv_id=\"2007.13904\")"}]},{"repo":"aimagelab/mammoth","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2407.15793"],"harvested_for_calls":[{"arxiv_id":"2407.15793","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2407.15793"},"call":"get_harvested_code_for_paper(arxiv_id=\"2407.15793\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"3f70cd2c9720d80a38e40eb39c680a44e35808f82bd2189a0bcf95ba6498bf89","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}