{"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/revisiting-a-knn-based-image-classification","title":"Revisiting a kNN-based Image Classification System with High-capacity Storage","arxiv_id":"2204.01186","date":"2022-04-03","proceeding":null,"authors":["Kengo Nakata","Youyang Ng","Daisuke Miyashita","Asuka Maki","Yu-Chieh Lin","Jun Deguchi"],"abstract":"In existing image classification systems that use deep neural networks, the knowledge needed for image classification is implicitly stored in model parameters. If users want to update this knowledge, then they need to fine-tune the model parameters. Moreover, users cannot verify the validity of inference results or evaluate the contribution of knowledge to the results. In this paper, we investigate a system that stores knowledge for image classification, such as image feature maps, labels, and original images, not in model parameters but in external high-capacity storage. Our system refers to the storage like a database when classifying input images. To increase knowledge, our system updates the database instead of fine-tuning model parameters, which avoids catastrophic forgetting in incremental learning scenarios. We revisit a kNN (k-Nearest Neighbor) classifier and employ it in our system. By analyzing the neighborhood samples referred by the kNN algorithm, we can interpret how knowledge learned in the past is used for inference results. Our system achieves 79.8% top-1 accuracy on the ImageNet dataset without fine-tuning model parameters after pretraining, and 90.8% accuracy on the Split CIFAR-100 dataset in the task incremental learning setting.","url_abs":"https://arxiv.org/abs/2204.01186v2","url_pdf":"https://arxiv.org/pdf/2204.01186v2.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":[],"tasks":[{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"continual-learning","task_name":"Continual Learning"},{"task_slug":"image-classification","task_name":"Image Classification"},{"task_slug":"incremental-learning","task_name":"Incremental Learning"},{"task_slug":"high","task_name":"Vocal Bursts Intensity Prediction"},{"task_slug":"image-classification","task_name":"image-classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/continual-learning-on-cifar100-20-tasks","task":"Continual Learning","dataset":"Cifar100 (20 tasks)","model":"kNN-CLIP","rank_in_archive_order":3,"of":9,"metrics":{"Average Accuracy":"90.8"},"uses_additional_data":true},{"leaderboard":"/sota/image-classification-on-cifar-10","task":"Image Classification","dataset":"CIFAR-10","model":"kNN-CLIP","rank_in_archive_order":88,"of":265,"metrics":{"Percentage correct":"97.3"},"uses_additional_data":true},{"leaderboard":"/sota/image-classification-on-cifar-100","task":"Image Classification","dataset":"CIFAR-100","model":"kNN-CLIP","rank_in_archive_order":115,"of":211,"metrics":{"Percentage correct":"81.7"},"uses_additional_data":true},{"leaderboard":"/sota/image-classification-on-imagenet","task":"Image Classification","dataset":"ImageNet","model":"kNN-CLIP","rank_in_archive_order":736,"of":1060,"metrics":{"Top 1 Accuracy":"79.8%"},"uses_additional_data":false},{"leaderboard":"/sota/image-classification-on-imagenet-real","task":"Image Classification","dataset":"ImageNet ReaL","model":"kNN-CLIP","rank_in_archive_order":46,"of":57,"metrics":{"Accuracy":"84%"},"uses_additional_data":true},{"leaderboard":"/sota/image-classification-on-stl-10","task":"Image Classification","dataset":"STL-10","model":"kNN-CLIP","rank_in_archive_order":2,"of":117,"metrics":{"Percentage correct":"99.6"},"uses_additional_data":true},{"leaderboard":"/sota/incremental-learning-on-imagenet-10-steps","task":"Incremental Learning","dataset":"ImageNet - 10 steps","model":"kNN-CLIP","rank_in_archive_order":1,"of":10,"metrics":{"Average Incremental Accuracy":"85.5"},"uses_additional_data":true},{"leaderboard":"/sota/incremental-learning-on-imagenet100-10-steps","task":"Incremental Learning","dataset":"ImageNet100 - 10 steps","model":"kNN-CLIP","rank_in_archive_order":1,"of":13,"metrics":{"Average Incremental Accuracy":"85.1"},"uses_additional_data":true}],"syntology":{"syntology_url":"https://syntology.ai/paper/2204.01186","atlas_url":"https://app.syntology.ai/?focus=2204.01186","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":"2204.01186"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2204.01186\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2204.01186"},"call":"get_concepts_for_paper(arxiv_id=\"2204.01186\")"}],"by_repo":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"0e8b9d039dade53a071d6f59cc57c466749bd91f2d6b9d69036882fad7e4006b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}