{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:AKUVRH3RUB3CIHRLCDUODJDTIG","short_pith_number":"pith:AKUVRH3R","schema_version":"1.0","canonical_sha256":"02a9589f71a076241e2b10e8e1a4734181dde601b5f1d8aa6a70d7fcc67c86c8","source":{"kind":"arxiv","id":"2110.07867","version":3},"attestation_state":"computed","paper":{"title":"Exploring Universal Intrinsic Task Subspace via Prompt Tuning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Jie Zhou, Jing Yi, Juanzi Li, Lei Hou, Maosong Sun, Ning Ding, Peng Li, Weize Chen, Xiaozhi Wang, Yankai Lin, Yujia Qin, Yusheng Su, Zhiyuan Liu","submitted_at":"2021-10-15T05:43:59Z","abstract_excerpt":"Why can pre-trained language models (PLMs) learn universal representations and effectively adapt to broad NLP tasks differing a lot superficially? In this work, we empirically find evidence indicating that the adaptations of PLMs to various few-shot tasks can be reparameterized as optimizing only a few free parameters in a unified low-dimensional intrinsic task subspace, which may help us understand why PLMs could easily adapt to various NLP tasks with small-scale data. To find such a subspace and examine its universality, we propose an analysis pipeline called intrinsic prompt tuning (IPT). S"},"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":"2110.07867","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2021-10-15T05:43:59Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"f550c684bd70314b0a7f885d6e77a8a69c0375cbb90c4eeaee9386c5991f75c5","abstract_canon_sha256":"1ac8214ae465ff0b22b7a2bb434a222ae8dadea264406c3708a317e62973315b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:19:11.603993Z","signature_b64":"5g4DOzANDwXMbLFiPhXWsNZPN6H17UU4MxPvLJL8BRiU/phR4FeJIOf2hxszhRucFqfnPCZ4CmMRuF4nBietAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02a9589f71a076241e2b10e8e1a4734181dde601b5f1d8aa6a70d7fcc67c86c8","last_reissued_at":"2026-07-05T05:19:11.603501Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:19:11.603501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploring Universal Intrinsic Task Subspace via Prompt Tuning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Jie Zhou, Jing Yi, Juanzi Li, Lei Hou, Maosong Sun, Ning Ding, Peng Li, Weize Chen, Xiaozhi Wang, Yankai Lin, Yujia Qin, Yusheng Su, Zhiyuan Liu","submitted_at":"2021-10-15T05:43:59Z","abstract_excerpt":"Why can pre-trained language models (PLMs) learn universal representations and effectively adapt to broad NLP tasks differing a lot superficially? In this work, we empirically find evidence indicating that the adaptations of PLMs to various few-shot tasks can be reparameterized as optimizing only a few free parameters in a unified low-dimensional intrinsic task subspace, which may help us understand why PLMs could easily adapt to various NLP tasks with small-scale data. To find such a subspace and examine its universality, we propose an analysis pipeline called intrinsic prompt tuning (IPT). S"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.07867","kind":"arxiv","version":3},"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/2110.07867/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":"2110.07867","created_at":"2026-07-05T05:19:11.603570+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.07867v3","created_at":"2026-07-05T05:19:11.603570+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.07867","created_at":"2026-07-05T05:19:11.603570+00:00"},{"alias_kind":"pith_short_12","alias_value":"AKUVRH3RUB3C","created_at":"2026-07-05T05:19:11.603570+00:00"},{"alias_kind":"pith_short_16","alias_value":"AKUVRH3RUB3CIHRL","created_at":"2026-07-05T05:19:11.603570+00:00"},{"alias_kind":"pith_short_8","alias_value":"AKUVRH3R","created_at":"2026-07-05T05:19:11.603570+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2502.04501","citing_title":"Ultra-Low-Dimensional Prompt Tuning via Random Projection","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2403.14608","citing_title":"Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Survey","ref_index":56,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AKUVRH3RUB3CIHRLCDUODJDTIG","json":"https://pith.science/pith/AKUVRH3RUB3CIHRLCDUODJDTIG.json","graph_json":"https://pith.science/api/pith-number/AKUVRH3RUB3CIHRLCDUODJDTIG/graph.json","events_json":"https://pith.science/api/pith-number/AKUVRH3RUB3CIHRLCDUODJDTIG/events.json","paper":"https://pith.science/paper/AKUVRH3R"},"agent_actions":{"view_html":"https://pith.science/pith/AKUVRH3RUB3CIHRLCDUODJDTIG","download_json":"https://pith.science/pith/AKUVRH3RUB3CIHRLCDUODJDTIG.json","view_paper":"https://pith.science/paper/AKUVRH3R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.07867&json=true","fetch_graph":"https://pith.science/api/pith-number/AKUVRH3RUB3CIHRLCDUODJDTIG/graph.json","fetch_events":"https://pith.science/api/pith-number/AKUVRH3RUB3CIHRLCDUODJDTIG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AKUVRH3RUB3CIHRLCDUODJDTIG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AKUVRH3RUB3CIHRLCDUODJDTIG/action/storage_attestation","attest_author":"https://pith.science/pith/AKUVRH3RUB3CIHRLCDUODJDTIG/action/author_attestation","sign_citation":"https://pith.science/pith/AKUVRH3RUB3CIHRLCDUODJDTIG/action/citation_signature","submit_replication":"https://pith.science/pith/AKUVRH3RUB3CIHRLCDUODJDTIG/action/replication_record"}},"created_at":"2026-07-05T05:19:11.603570+00:00","updated_at":"2026-07-05T05:19:11.603570+00:00"}