{"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/negotiated-representations-to-prevent","title":"Negotiated Representations to Prevent Forgetting in Machine Learning Applications","arxiv_id":"2312.00237","date":"2023-11-30","proceeding":null,"authors":["Nuri Korhan","Ceren Öner"],"abstract":"Catastrophic forgetting is a significant challenge in the field of machine learning, particularly in neural networks. When a neural network learns to perform well on a new task, it often forgets its previously acquired knowledge or experiences. This phenomenon occurs because the network adjusts its weights and connections to minimize the loss on the new task, which can inadvertently overwrite or disrupt the representations that were crucial for the previous tasks. As a result, the the performance of the network on earlier tasks deteriorates, limiting its ability to learn and adapt to a sequence of tasks. In this paper, we propose a novel method for preventing catastrophic forgetting in machine learning applications, specifically focusing on neural networks. Our approach aims to preserve the knowledge of the network across multiple tasks while still allowing it to learn new information effectively. We demonstrate the effectiveness of our method by conducting experiments on various benchmark datasets, including Split MNIST, Split CIFAR10, Split Fashion MNIST, and Split CIFAR100. These datasets are created by dividing the original datasets into separate, non overlapping tasks, simulating a continual learning scenario where the model needs to learn multiple tasks sequentially without forgetting the previous ones. Our proposed method tackles the catastrophic forgetting problem by incorporating negotiated representations into the learning process, which allows the model to maintain a balance between retaining past experiences and adapting to new tasks. By evaluating our method on these challenging datasets, we aim to showcase its potential for addressing catastrophic forgetting and improving the performance of neural networks in continual learning settings.","url_abs":"https://arxiv.org/abs/2312.00237v1","url_pdf":"https://arxiv.org/pdf/2312.00237v1.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":"negotiated-representations-to-prevent","repo_url":"https://github.com/nurikorhan/negotiated-representations-for-continual-learning","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"continual-learning","task_name":"Continual Learning"},{"task_slug":"image-classification","task_name":"Image Classification"},{"task_slug":null,"task_name":"Split-CIFAR-10"},{"task_slug":null,"task_name":"Split-MNIST"}],"methods":[{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"non","method_name":"NON"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/image-classification-on-split-cifar-10","task":"Image Classification","dataset":"Split CIFAR-10","model":"Model with negotiation paradigm","rank_in_archive_order":1,"of":1,"metrics":{"Percentage Average accuracy - 5 tasks":"46.5"},"uses_additional_data":false},{"leaderboard":"/sota/image-classification-on-split-fashion-m-nist","task":"Image Classification","dataset":"Split Fashion M-NIST","model":"Model with negotiation paradigm","rank_in_archive_order":1,"of":1,"metrics":{"Percentage Average accuracy - 5 tasks":"54.8"},"uses_additional_data":false},{"leaderboard":"/sota/image-classification-on-split-m-nist","task":"Image Classification","dataset":"Split M-NIST","model":"Model with negotiation paradigm","rank_in_archive_order":1,"of":1,"metrics":{"Percentage Average accuracy - 5 tasks":"82.3"},"uses_additional_data":false},{"leaderboard":"/sota/image-classification-on-split-cifar-100","task":"Image Classification","dataset":"split CIFAR-100","model":"Model with negotiation paradigm","rank_in_archive_order":2,"of":2,"metrics":{"Percentage Average accuracy - 5 tasks":"34.9"},"uses_additional_data":false}],"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":"nurikorhan/negotiated-representations-for-continual-learning","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":"16a3567c4e822dcdf6034f5b513a21410c969bc60710ef11070e221441933f4d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}