{"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/learning-classifier-synthesis-for-generalized","title":"Learning Adaptive Classifiers Synthesis for Generalized Few-Shot Learning","arxiv_id":"1906.02944","date":"2019-06-07","proceeding":null,"authors":["Han-Jia Ye","Hexiang Hu","De-Chuan Zhan"],"abstract":"Object recognition in the real-world requires handling long-tailed or even open-ended data. An ideal visual system needs to recognize the populated head visual concepts reliably and meanwhile efficiently learn about emerging new tail categories with a few training instances. Class-balanced many-shot learning and few-shot learning tackle one side of this problem, by either learning strong classifiers for head or learning to learn few-shot classifiers for the tail. In this paper, we investigate the problem of generalized few-shot learning (GFSL) -- a model during the deployment is required to learn about tail categories with few shots and simultaneously classify the head classes. We propose the ClAssifier SynThesis LEarning (CASTLE), a learning framework that learns how to synthesize calibrated few-shot classifiers in addition to the multi-class classifiers of head classes with a shared neural dictionary, shedding light upon the inductive GFSL. Furthermore, we propose an adaptive version of CASTLE (ACASTLE) that adapts the head classifiers conditioned on the incoming tail training examples, yielding a framework that allows effective backward knowledge transfer. As a consequence, ACASTLE can handle GFSL with classes from heterogeneous domains effectively. CASTLE and ACASTLE demonstrate superior performances than existing GFSL algorithms and strong baselines on MiniImageNet as well as TieredImageNet datasets. More interestingly, they outperform previous state-of-the-art methods when evaluated with standard few-shot learning criteria.","url_abs":"https://arxiv.org/abs/1906.02944v5","url_pdf":"https://arxiv.org/pdf/1906.02944v5.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":"learning-classifier-synthesis-for-generalized","repo_url":"https://github.com/Sha-Lab/CASTLE","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"learning-classifier-synthesis-for-generalized","repo_url":"https://github.com/codelion/adaptive-classifier","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"few-shot-learning","task_name":"Few-Shot Learning"},{"task_slug":"generalized-few-shot-learning","task_name":"Generalized Few-Shot Learning"},{"task_slug":"object-recognition","task_name":"Object Recognition"},{"task_slug":"transfer-learning","task_name":"Transfer Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1906.02944","atlas_url":"https://app.syntology.ai/?focus=1906.02944","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.02944"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1906.02944"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1906.02944"},"call":"get_harvested_code_for_paper(arxiv_id=\"1906.02944\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"1906.02944"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1906.02944\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1906.02944"},"call":"get_concepts_for_paper(arxiv_id=\"1906.02944\")"}],"by_repo":[{"repo":"Sha-Lab/CASTLE","kind":"official","samples":6,"ran":4,"instrument":1,"unverified":2},{"repo":"codelion/adaptive-classifier","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["1612.00796","2501.06252"],"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":"2501.06252","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2501.06252"},"call":"get_harvested_code_for_paper(arxiv_id=\"2501.06252\")"}]}],"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","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/1906.02944.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/1906.02944.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/Sha-Lab/CASTLE","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/codelion/adaptive-classifier","reach":null}],"summary":{"ran_draft_wrong":1,"ran":2,"ran_honours":1,"unverified":2},"n_samples":6,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":2,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"official":{"samples":6,"ran":4,"n_ran_checked":3,"n_instrument":1,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":3,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":3,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":3,"n_ran_without_level_date":1,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-25","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","census_is":"Syntology's function-name census ran implementations with this entry name on one shared input per bucket (the positional rank, kind and dtype of each array argument) and counted the distinct output digests (sha256 of the output rounded to 6 decimals). implementations and papers count the compared samples; distinct_outputs counts digests across all buckets; n_buckets is how many shared inputs were used. It is not a statement that any two samples compute one thing, and the name is a string, not an identity.","samples":[{"code_sha256":"4a4efe7627515cc5","code_sha256_prefix":"4a4efe7627515cc5","entry":"load_data","repo":"Sha-Lab/CASTLE","repo_kind":"official","path":"model/dataloader/tiered_imagenet.py","file_url":"https://github.com/Sha-Lab/CASTLE/blob/HEAD/model/dataloader/tiered_imagenet.py","link_basis":"harvester_set","language":"python","status":"ran_draft_wrong","verification_level":2,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"file:str/0/str","fixture_out_type":"dict","code_page":"/code/load-data","census":null,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from few-shot-learning-on-chest-x-ray/fsl_subspace, and GitHub detected no licence in that repository when it was checked","mcp_get_code":{"code_sha256":"4a4efe7627515cc5"}},{"code_sha256":"57889d72f516d105","code_sha256_prefix":"57889d72f516d105","entry":"buildLabelIndex","repo":"Sha-Lab/CASTLE","repo_kind":"official","path":"model/dataloader/tiered_imagenet.py","file_url":"https://github.com/Sha-Lab/CASTLE/blob/HEAD/model/dataloader/tiered_imagenet.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"labels:list/1/int","fixture_out_type":"dict","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","retrieve_with":{"tool":"get_code","code_sha256":"57889d72f516d105"},"code_page":"/code/buildlabelindex","census":null,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from valeoai/moca, and GitHub could not classify the licence of that repository (NOASSERTION)","mcp_get_code":{"code_sha256":"57889d72f516d105"}},{"code_sha256":"9910e2fc297f8665","code_sha256_prefix":"9910e2fc297f8665","entry":"identity","repo":"Sha-Lab/CASTLE","repo_kind":"official","path":"model/dataloader/mini_imagenet.py","file_url":"https://github.com/Sha-Lab/CASTLE/blob/HEAD/model/dataloader/mini_imagenet.py","link_basis":"harvester_set","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"signature":"x:Tensor/2/float","fixture_out_type":"Tensor","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"9910e2fc297f8665"},"code_page":"/code/identity","census":{"url":"/census/identity","implementations":11,"papers":39,"distinct_outputs":3,"n_buckets":2,"bucket_key":[[2,"float","float32"]],"bucket_index":1,"bucket_label":"arg 1: rank 2, kind float, dtype float32"},"census_bucket_fragment":"bucket-1","licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from dholzmueller/universal_double_descent, and GitHub detected no licence in that repository when it was checked","mcp_get_code":{"code_sha256":"9910e2fc297f8665"}},{"code_sha256":"1b36707a4929e1b6","code_sha256_prefix":"1b36707a4929e1b6","entry":"one_hot","repo":"Sha-Lab/CASTLE","repo_kind":"official","path":"model/utils.py","file_url":"https://github.com/Sha-Lab/CASTLE/blob/HEAD/model/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"indices:Tensor/2/int, depth:int/0/int","fixture_out_type":"Tensor","level_recorded_at":"2026-09-25T11:37:59.709563+00:00","code_page":"/code/one-hot","census":{"url":"/census/one-hot","implementations":18,"papers":25,"distinct_outputs":10,"n_buckets":6,"bucket_key":null,"bucket_index":null,"bucket_label":null},"census_bucket_fragment":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"1b36707a4929e1b6"}},{"code_sha256":"684d8ecbca8220ab","code_sha256_prefix":"684d8ecbca8220ab","entry":"count_acc","repo":"Sha-Lab/CASTLE","repo_kind":"official","path":"model/utils.py","file_url":"https://github.com/Sha-Lab/CASTLE/blob/HEAD/model/utils.py","link_basis":"plan_row","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/count-acc","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"684d8ecbca8220ab"}},{"code_sha256":"4654644a3b8f1e46","code_sha256_prefix":"4654644a3b8f1e46","entry":"count_acc2","repo":"Sha-Lab/CASTLE","repo_kind":"official","path":"model/utils.py","file_url":"https://github.com/Sha-Lab/CASTLE/blob/HEAD/model/utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"4654644a3b8f1e46"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"cd0d6d772df75b7fdf61fd799e0be9523c031b8e2f0153a32122d0e14aa6363b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}