{"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/graphadapter-tuning-vision-language-models-1","title":"GraphAdapter: Tuning Vision-Language Models With Dual Knowledge Graph","arxiv_id":"2309.13625","date":"2023-09-24","proceeding":"NeurIPS 2023 11","authors":["Xin Li","Dongze Lian","Zhihe Lu","Jiawang Bai","Zhibo Chen","Xinchao Wang"],"abstract":"Adapter-style efficient transfer learning (ETL) has shown excellent performance in the tuning of vision-language models (VLMs) under the low-data regime, where only a few additional parameters are introduced to excavate the task-specific knowledge based on the general and powerful representation of VLMs. However, most adapter-style works face two limitations: (i) modeling task-specific knowledge with a single modality only; and (ii) overlooking the exploitation of the inter-class relationships in downstream tasks, thereby leading to sub-optimal solutions. To mitigate that, we propose an effective adapter-style tuning strategy, dubbed GraphAdapter, which performs the textual adapter by explicitly modeling the dual-modality structure knowledge (i.e., the correlation of different semantics/classes in textual and visual modalities) with a dual knowledge graph. In particular, the dual knowledge graph is established with two sub-graphs, i.e., a textual knowledge sub-graph, and a visual knowledge sub-graph, where the nodes and edges represent the semantics/classes and their correlations in two modalities, respectively. This enables the textual feature of each prompt to leverage the task-specific structure knowledge from both textual and visual modalities, yielding a more effective classifier for downstream tasks. Extensive experimental results on 11 benchmark datasets reveal that our GraphAdapter significantly outperforms previous adapter-based methods. The code will be released at https://github.com/lixinustc/GraphAdapter","url_abs":"https://arxiv.org/abs/2309.13625v1","url_pdf":"https://arxiv.org/pdf/2309.13625v1.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":"graphadapter-tuning-vision-language-models-1","repo_url":"https://github.com/lixinustc/graphadapter","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"transfer-learning","task_name":"Transfer Learning"}],"methods":[{"method_slug":"adapter","method_name":"Adapter"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2309.13625","atlas_url":"https://app.syntology.ai/?focus=2309.13625","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.13625"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2309.13625"},"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":"2309.13625"},"call":"get_harvested_code_for_paper(arxiv_id=\"2309.13625\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2309.13625"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2309.13625\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2309.13625"},"call":"get_concepts_for_paper(arxiv_id=\"2309.13625\")"}],"by_repo":[{"repo":"lixinustc/graphadapter","kind":"official","samples":8,"ran":6,"instrument":3,"unverified":2},{"repo":"zjunet/GraphAdapter","kind":"community","samples":1,"ran":0,"instrument":0,"unverified":1}],"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/2309.13625.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/2309.13625.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/lixinustc/graphadapter","reach":{"status":"ok"}}],"summary":{"ran_draft_wrong":3,"ran":2,"ran_honours":1,"unverified":3},"n_samples":9,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":3,"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":8,"ran":6,"n_ran_checked":3,"n_instrument":3,"repositories":1},"community":{"samples":1,"ran":0,"n_ran_checked":0,"n_instrument":0,"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":9,"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":0,"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":6,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-24","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","samples":[{"code_sha256":"98f385d847636a3e","code_sha256_prefix":"98f385d847636a3e","entry":"basic_clean","repo":"lixinustc/graphadapter","repo_kind":"official","path":"clip/simple_tokenizer.py","file_url":"https://github.com/lixinustc/graphadapter/blob/HEAD/clip/simple_tokenizer.py","link_basis":"harvester_set","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"signature":"text:str/0/str","fixture_out_type":"str","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"98f385d847636a3e"},"code_page":"/code/basic-clean","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lixinustc/graphadapter when it was checked","mcp_get_code":{"code_sha256":"98f385d847636a3e"}},{"code_sha256":"cb9f8a1583e97c3a","code_sha256_prefix":"cb9f8a1583e97c3a","entry":"cal_similarity","repo":"lixinustc/graphadapter","repo_kind":"official","path":"baseclip_graph_v1.py","file_url":"https://github.com/lixinustc/graphadapter/blob/HEAD/baseclip_graph_v1.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"x:Tensor/2/float, p:int/0/int, dim:int/0/int","fixture_out_type":"Tensor","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","retrieve_with":{"tool":"get_code","code_sha256":"cb9f8a1583e97c3a"},"code_page":"/code/cal-similarity","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lixinustc/graphadapter when it was checked","mcp_get_code":{"code_sha256":"cb9f8a1583e97c3a"}},{"code_sha256":"ba26afd892405335","code_sha256_prefix":"ba26afd892405335","entry":"compute_ci95","repo":"lixinustc/graphadapter","repo_kind":"official","path":"parse_test_res.py","file_url":"https://github.com/lixinustc/graphadapter/blob/HEAD/parse_test_res.py","link_basis":"harvester_set","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"res:ndarray/1/float","fixture_out_type":"float64","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","retrieve_with":{"tool":"get_code","code_sha256":"ba26afd892405335"},"code_page":"/code/compute-ci95","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lixinustc/graphadapter when it was checked","mcp_get_code":{"code_sha256":"ba26afd892405335"}},{"code_sha256":"d919ae32e5e4e616","code_sha256_prefix":"d919ae32e5e4e616","entry":"get_pairs","repo":"lixinustc/graphadapter","repo_kind":"official","path":"clip/simple_tokenizer.py","file_url":"https://github.com/lixinustc/graphadapter/blob/HEAD/clip/simple_tokenizer.py","link_basis":"harvester_set","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"word:tuple/1/str","fixture_out_type":"set","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/get-pairs","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lixinustc/graphadapter when it was checked","mcp_get_code":{"code_sha256":"d919ae32e5e4e616"}},{"code_sha256":"dce6eed668ade35c","code_sha256_prefix":"dce6eed668ade35c","entry":"graph_norm_ours","repo":"lixinustc/graphadapter","repo_kind":"official","path":"baseclip_graph_v1.py","file_url":"https://github.com/lixinustc/graphadapter/blob/HEAD/baseclip_graph_v1.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"A:Tensor/2/float, batch:bool/0/bool, self_loop:bool/0/bool, symmetric:bool/0/bool","fixture_out_type":"Tensor","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lixinustc/graphadapter when it was checked","mcp_get_code":{"code_sha256":"dce6eed668ade35c"}},{"code_sha256":"9542161e9640b858","code_sha256_prefix":"9542161e9640b858","entry":"whitespace_clean","repo":"lixinustc/graphadapter","repo_kind":"official","path":"clip/simple_tokenizer.py","file_url":"https://github.com/lixinustc/graphadapter/blob/HEAD/clip/simple_tokenizer.py","link_basis":"harvester_set","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"signature":"text:str/0/str","fixture_out_type":"str","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"9542161e9640b858"},"code_page":"/code/whitespace-clean","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lixinustc/graphadapter when it was checked","mcp_get_code":{"code_sha256":"9542161e9640b858"}},{"code_sha256":"c47aa9e5b049a11d","code_sha256_prefix":"c47aa9e5b049a11d","entry":"build_model","repo":"lixinustc/graphadapter","repo_kind":"official","path":"clip/model.py","file_url":"https://github.com/lixinustc/graphadapter/blob/HEAD/clip/model.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/build-model","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lixinustc/graphadapter when it was checked","mcp_get_code":{"code_sha256":"c47aa9e5b049a11d"}},{"code_sha256":"fbf8c0143d9c48e3","code_sha256_prefix":"fbf8c0143d9c48e3","entry":"load","repo":"lixinustc/graphadapter","repo_kind":"official","path":"clip/clip.py","file_url":"https://github.com/lixinustc/graphadapter/blob/HEAD/clip/clip.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/load","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lixinustc/graphadapter when it was checked","mcp_get_code":{"code_sha256":"fbf8c0143d9c48e3"}},{"code_sha256":"a1f521ad356a89db","code_sha256_prefix":"a1f521ad356a89db","entry":"pretrain_collate_fn","repo":"zjunet/GraphAdapter","repo_kind":"community","path":"preprocess.py","file_url":"https://github.com/zjunet/GraphAdapter/blob/HEAD/preprocess.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":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zjunet/GraphAdapter when it was checked","mcp_get_code":{"code_sha256":"a1f521ad356a89db"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"5f12b8bc00682589b5870fd998d6845033a2a13dd7bb681c13be32c23c46a9f8","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}