{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SV4K5XD3ZNDEH2YF4VHPU4FWFH","short_pith_number":"pith:SV4K5XD3","schema_version":"1.0","canonical_sha256":"9578aedc7bcb4643eb05e54efa70b629d853e3b6b1877180d1f4ded9aafb821f","source":{"kind":"arxiv","id":"2404.14607","version":1},"attestation_state":"computed","paper":{"title":"Q-Tuning: Queue-based Prompt Tuning for Lifelong Few-shot Language Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Bryan Wang, Chaosheng Dong, Jia Liu, Jinmiao Fu, Shaoyuan Xu, Yanhui Guo","submitted_at":"2024-04-22T22:04:16Z","abstract_excerpt":"This paper introduces \\textbf{Q-tuning}, a novel approach for continual prompt tuning that enables the lifelong learning of a pre-trained language model. When learning a new task, Q-tuning trains a task-specific prompt by adding it to a prompt queue consisting of the prompts from older tasks. To better transfer the knowledge of old tasks, we design an adaptive knowledge aggregation technique that reweighs previous prompts in the queue with a learnable low-rank matrix. Once the prompt queue reaches its maximum capacity, we leverage a PCA-based eviction rule to reduce the queue's size, allowing "},"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":"2404.14607","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-04-22T22:04:16Z","cross_cats_sorted":[],"title_canon_sha256":"4a738cdc604e26004804efc70c72b8cf06fd320dd029a72bda2c332c39e73730","abstract_canon_sha256":"79512f5df59d856f1d7dbc08eaac1d4746acab41b3200466300c48aaf1e82ae4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:11:07.549873Z","signature_b64":"hwEE8aFJfYb2hmSn0vtxcK7awseppAF1r93LwQ4i8SXa4ggCiIWsNsSJjpI3giN3dKZziY45W/w0ZNZZUke4Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9578aedc7bcb4643eb05e54efa70b629d853e3b6b1877180d1f4ded9aafb821f","last_reissued_at":"2026-07-05T08:11:07.549517Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:11:07.549517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Q-Tuning: Queue-based Prompt Tuning for Lifelong Few-shot Language Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Bryan Wang, Chaosheng Dong, Jia Liu, Jinmiao Fu, Shaoyuan Xu, Yanhui Guo","submitted_at":"2024-04-22T22:04:16Z","abstract_excerpt":"This paper introduces \\textbf{Q-tuning}, a novel approach for continual prompt tuning that enables the lifelong learning of a pre-trained language model. When learning a new task, Q-tuning trains a task-specific prompt by adding it to a prompt queue consisting of the prompts from older tasks. To better transfer the knowledge of old tasks, we design an adaptive knowledge aggregation technique that reweighs previous prompts in the queue with a learnable low-rank matrix. Once the prompt queue reaches its maximum capacity, we leverage a PCA-based eviction rule to reduce the queue's size, allowing "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.14607","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/2404.14607/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":"2404.14607","created_at":"2026-07-05T08:11:07.549580+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.14607v1","created_at":"2026-07-05T08:11:07.549580+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.14607","created_at":"2026-07-05T08:11:07.549580+00:00"},{"alias_kind":"pith_short_12","alias_value":"SV4K5XD3ZNDE","created_at":"2026-07-05T08:11:07.549580+00:00"},{"alias_kind":"pith_short_16","alias_value":"SV4K5XD3ZNDEH2YF","created_at":"2026-07-05T08:11:07.549580+00:00"},{"alias_kind":"pith_short_8","alias_value":"SV4K5XD3","created_at":"2026-07-05T08:11:07.549580+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.14725","citing_title":"GRID: Scaling Task-Agnostic Inference in Continual Prompt Tuning","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SV4K5XD3ZNDEH2YF4VHPU4FWFH","json":"https://pith.science/pith/SV4K5XD3ZNDEH2YF4VHPU4FWFH.json","graph_json":"https://pith.science/api/pith-number/SV4K5XD3ZNDEH2YF4VHPU4FWFH/graph.json","events_json":"https://pith.science/api/pith-number/SV4K5XD3ZNDEH2YF4VHPU4FWFH/events.json","paper":"https://pith.science/paper/SV4K5XD3"},"agent_actions":{"view_html":"https://pith.science/pith/SV4K5XD3ZNDEH2YF4VHPU4FWFH","download_json":"https://pith.science/pith/SV4K5XD3ZNDEH2YF4VHPU4FWFH.json","view_paper":"https://pith.science/paper/SV4K5XD3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.14607&json=true","fetch_graph":"https://pith.science/api/pith-number/SV4K5XD3ZNDEH2YF4VHPU4FWFH/graph.json","fetch_events":"https://pith.science/api/pith-number/SV4K5XD3ZNDEH2YF4VHPU4FWFH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SV4K5XD3ZNDEH2YF4VHPU4FWFH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SV4K5XD3ZNDEH2YF4VHPU4FWFH/action/storage_attestation","attest_author":"https://pith.science/pith/SV4K5XD3ZNDEH2YF4VHPU4FWFH/action/author_attestation","sign_citation":"https://pith.science/pith/SV4K5XD3ZNDEH2YF4VHPU4FWFH/action/citation_signature","submit_replication":"https://pith.science/pith/SV4K5XD3ZNDEH2YF4VHPU4FWFH/action/replication_record"}},"created_at":"2026-07-05T08:11:07.549580+00:00","updated_at":"2026-07-05T08:11:07.549580+00:00"}