{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6F6QXOWAW2PT5MKRT3RKU7SXTT","short_pith_number":"pith:6F6QXOWA","schema_version":"1.0","canonical_sha256":"f17d0bbac0b69f3eb1519ee2aa7e579cee46a8a3ec717b630909da17f54fa0f5","source":{"kind":"arxiv","id":"2403.14950","version":1},"attestation_state":"computed","paper":{"title":"KnowLA: Enhancing Parameter-efficient Finetuning with Knowledgeable Adaptation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Jing Zhao, Wei Hu, Xindi Luo, Zequn Sun, Zhe Zhao","submitted_at":"2024-03-22T04:48:41Z","abstract_excerpt":"Parameter-efficient finetuning (PEFT) is a key technique for adapting large language models (LLMs) to downstream tasks. In this paper, we study leveraging knowledge graph embeddings to improve the effectiveness of PEFT. We propose a knowledgeable adaptation method called KnowLA. It inserts an adaptation layer into an LLM to integrate the embeddings of entities appearing in the input text. The adaptation layer is trained in combination with LoRA on instruction data. Experiments on six benchmarks with two popular LLMs and three knowledge graphs demonstrate the effectiveness and robustness of Kno"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2403.14950","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-03-22T04:48:41Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b0effbf02729f178516136ded12f3987fce2f65d752863924ae62d0125655059","abstract_canon_sha256":"e546e415925c74ededd38b0471254f39ec0311dc6f20a783b45b9e84a07fa0bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:59:28.182542Z","signature_b64":"dBt+nf2sSfo2DCu7ugGrgQMaeapmByg0GRRvDi3lMX5mXNqNgdEkZEhHF9PhCpXKcf4xW0+8lDlFY96Dfyd2DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f17d0bbac0b69f3eb1519ee2aa7e579cee46a8a3ec717b630909da17f54fa0f5","last_reissued_at":"2026-07-05T07:59:28.182046Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:59:28.182046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"KnowLA: Enhancing Parameter-efficient Finetuning with Knowledgeable Adaptation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Jing Zhao, Wei Hu, Xindi Luo, Zequn Sun, Zhe Zhao","submitted_at":"2024-03-22T04:48:41Z","abstract_excerpt":"Parameter-efficient finetuning (PEFT) is a key technique for adapting large language models (LLMs) to downstream tasks. In this paper, we study leveraging knowledge graph embeddings to improve the effectiveness of PEFT. We propose a knowledgeable adaptation method called KnowLA. It inserts an adaptation layer into an LLM to integrate the embeddings of entities appearing in the input text. The adaptation layer is trained in combination with LoRA on instruction data. Experiments on six benchmarks with two popular LLMs and three knowledge graphs demonstrate the effectiveness and robustness of Kno"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.14950","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.14950/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2403.14950","created_at":"2026-07-05T07:59:28.182101+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.14950v1","created_at":"2026-07-05T07:59:28.182101+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.14950","created_at":"2026-07-05T07:59:28.182101+00:00"},{"alias_kind":"pith_short_12","alias_value":"6F6QXOWAW2PT","created_at":"2026-07-05T07:59:28.182101+00:00"},{"alias_kind":"pith_short_16","alias_value":"6F6QXOWAW2PT5MKR","created_at":"2026-07-05T07:59:28.182101+00:00"},{"alias_kind":"pith_short_8","alias_value":"6F6QXOWA","created_at":"2026-07-05T07:59:28.182101+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.20170","citing_title":"KoRe: Compact Knowledge Representations for Large Language Models","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2604.13432","citing_title":"MaMe & MaRe: Matrix-Based Token Merging and Restoration for Efficient Visual Perception and Synthesis","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6F6QXOWAW2PT5MKRT3RKU7SXTT","json":"https://pith.science/pith/6F6QXOWAW2PT5MKRT3RKU7SXTT.json","graph_json":"https://pith.science/api/pith-number/6F6QXOWAW2PT5MKRT3RKU7SXTT/graph.json","events_json":"https://pith.science/api/pith-number/6F6QXOWAW2PT5MKRT3RKU7SXTT/events.json","paper":"https://pith.science/paper/6F6QXOWA"},"agent_actions":{"view_html":"https://pith.science/pith/6F6QXOWAW2PT5MKRT3RKU7SXTT","download_json":"https://pith.science/pith/6F6QXOWAW2PT5MKRT3RKU7SXTT.json","view_paper":"https://pith.science/paper/6F6QXOWA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.14950&json=true","fetch_graph":"https://pith.science/api/pith-number/6F6QXOWAW2PT5MKRT3RKU7SXTT/graph.json","fetch_events":"https://pith.science/api/pith-number/6F6QXOWAW2PT5MKRT3RKU7SXTT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6F6QXOWAW2PT5MKRT3RKU7SXTT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6F6QXOWAW2PT5MKRT3RKU7SXTT/action/storage_attestation","attest_author":"https://pith.science/pith/6F6QXOWAW2PT5MKRT3RKU7SXTT/action/author_attestation","sign_citation":"https://pith.science/pith/6F6QXOWAW2PT5MKRT3RKU7SXTT/action/citation_signature","submit_replication":"https://pith.science/pith/6F6QXOWAW2PT5MKRT3RKU7SXTT/action/replication_record"}},"created_at":"2026-07-05T07:59:28.182101+00:00","updated_at":"2026-07-05T07:59:28.182101+00:00"}