{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:STTKRJFKCPFDMTNQUBDWWB5JMW","short_pith_number":"pith:STTKRJFK","schema_version":"1.0","canonical_sha256":"94e6a8a4aa13ca364db0a0476b07a965ac483a148f2897542b2e01803380be20","source":{"kind":"arxiv","id":"2110.07602","version":3},"attestation_state":"computed","paper":{"title":"P-Tuning v2: Prompt Tuning Can Be Comparable to Fine-tuning Universally Across Scales and Tasks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jie Tang, Kaixuan Ji, Weng Lam Tam, Xiao Liu, Yicheng Fu, Zhengxiao Du, Zhilin Yang","submitted_at":"2021-10-14T17:58:47Z","abstract_excerpt":"Prompt tuning, which only tunes continuous prompts with a frozen language model, substantially reduces per-task storage and memory usage at training. However, in the context of NLU, prior work reveals that prompt tuning does not perform well for normal-sized pretrained models. We also find that existing methods of prompt tuning cannot handle hard sequence labeling tasks, indicating a lack of universality. We present a novel empirical finding that properly optimized prompt tuning can be universally effective across a wide range of model scales and NLU tasks. It matches the performance of finetu"},"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.07602","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2021-10-14T17:58:47Z","cross_cats_sorted":[],"title_canon_sha256":"ddf6220f6db0f1de108057eee1200584331672595ff1fbc90b30a5eb42c231ca","abstract_canon_sha256":"868799754cba056d27067fed06835d349584f70695398149b8174b66fff4f462"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:06:45.986082Z","signature_b64":"PbJ0Njn8q4dtFteewgxzNfflkCGkWHe2RJpE2nrT35OcVyEjX2m216+JFDHDng0Mg6qgbfI5hH9HBF/2Mzd4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94e6a8a4aa13ca364db0a0476b07a965ac483a148f2897542b2e01803380be20","last_reissued_at":"2026-07-05T04:06:45.985579Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:06:45.985579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"P-Tuning v2: Prompt Tuning Can Be Comparable to Fine-tuning Universally Across Scales and Tasks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jie Tang, Kaixuan Ji, Weng Lam Tam, Xiao Liu, Yicheng Fu, Zhengxiao Du, Zhilin Yang","submitted_at":"2021-10-14T17:58:47Z","abstract_excerpt":"Prompt tuning, which only tunes continuous prompts with a frozen language model, substantially reduces per-task storage and memory usage at training. However, in the context of NLU, prior work reveals that prompt tuning does not perform well for normal-sized pretrained models. We also find that existing methods of prompt tuning cannot handle hard sequence labeling tasks, indicating a lack of universality. We present a novel empirical finding that properly optimized prompt tuning can be universally effective across a wide range of model scales and NLU tasks. It matches the performance of finetu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.07602","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.07602/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.07602","created_at":"2026-07-05T04:06:45.985658+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.07602v3","created_at":"2026-07-05T04:06:45.985658+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.07602","created_at":"2026-07-05T04:06:45.985658+00:00"},{"alias_kind":"pith_short_12","alias_value":"STTKRJFKCPFD","created_at":"2026-07-05T04:06:45.985658+00:00"},{"alias_kind":"pith_short_16","alias_value":"STTKRJFKCPFDMTNQ","created_at":"2026-07-05T04:06:45.985658+00:00"},{"alias_kind":"pith_short_8","alias_value":"STTKRJFK","created_at":"2026-07-05T04:06:45.985658+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":19,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20333","citing_title":"SoftSkill: Behavioral Compression for Contextual Adaptation","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2606.10610","citing_title":"Small Data, Big Noise: Adversarial Training for Robust Parameter-Efficient Fine-Tuning","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2606.09125","citing_title":"Unveiling Privacy Risks in Multi-modal Large Language Models: Task-specific Vulnerabilities and Mitigation Challenges","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2606.09401","citing_title":"Benchmarking Empirical Privacy Protection for Adaptations of Large Language Models","ref_index":187,"is_internal_anchor":false},{"citing_arxiv_id":"2606.30937","citing_title":"No Adaptation Without Observation: Observability-Constrained Test-Time Prompt Tuning for LiDAR Semantic Segmentation","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2606.00132","citing_title":"Foundation-Preserving Adaptation via Generalized Rayleigh-Quotient Optimization","ref_index":47,"is_internal_anchor":false},{"citing_arxiv_id":"2606.02624","citing_title":"TadA-Bench: A Million-Variant Benchmark for Future-Round Discovery Toward Agentic Protein Engineering","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2606.00776","citing_title":"Latent Diffusion Pretraining for Crystal Property Prediction","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2506.13674","citing_title":"PrefixMemory-Tuning: Modernizing Prefix-Tuning by Decoupling the Prefix from Attention","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2309.08532","citing_title":"EvoPrompt: Connecting LLMs with Evolutionary Algorithms Yields Powerful Prompt Optimizers","ref_index":117,"is_internal_anchor":false},{"citing_arxiv_id":"2305.14233","citing_title":"Enhancing Chat Language Models by Scaling High-quality Instructional Conversations","ref_index":166,"is_internal_anchor":false},{"citing_arxiv_id":"2605.14055","citing_title":"PEML: Parameter-efficient Multi-Task Learning with Optimized Continuous Prompts","ref_index":84,"is_internal_anchor":false},{"citing_arxiv_id":"2303.16199","citing_title":"LLaMA-Adapter: Efficient Fine-tuning of Language Models with Zero-init Attention","ref_index":54,"is_internal_anchor":false},{"citing_arxiv_id":"2403.14608","citing_title":"Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Survey","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19015","citing_title":"FedProxy: Federated Fine-Tuning of LLMs via Proxy SLMs and Heterogeneity-Aware Fusion","ref_index":46,"is_internal_anchor":false},{"citing_arxiv_id":"2604.12610","citing_title":"Transforming External Knowledge into Triplets for Enhanced Retrieval in RAG of LLMs","ref_index":47,"is_internal_anchor":false},{"citing_arxiv_id":"2604.09532","citing_title":"Seeing is Believing: Robust Vision-Guided Cross-Modal Prompt Learning under Label Noise","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2604.09034","citing_title":"The nextAI Solution to the NeurIPS 2023 LLM Efficiency Challenge","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18124","citing_title":"TLoRA: Task-aware Low Rank Adaptation of Large Language Models","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/STTKRJFKCPFDMTNQUBDWWB5JMW","json":"https://pith.science/pith/STTKRJFKCPFDMTNQUBDWWB5JMW.json","graph_json":"https://pith.science/api/pith-number/STTKRJFKCPFDMTNQUBDWWB5JMW/graph.json","events_json":"https://pith.science/api/pith-number/STTKRJFKCPFDMTNQUBDWWB5JMW/events.json","paper":"https://pith.science/paper/STTKRJFK"},"agent_actions":{"view_html":"https://pith.science/pith/STTKRJFKCPFDMTNQUBDWWB5JMW","download_json":"https://pith.science/pith/STTKRJFKCPFDMTNQUBDWWB5JMW.json","view_paper":"https://pith.science/paper/STTKRJFK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.07602&json=true","fetch_graph":"https://pith.science/api/pith-number/STTKRJFKCPFDMTNQUBDWWB5JMW/graph.json","fetch_events":"https://pith.science/api/pith-number/STTKRJFKCPFDMTNQUBDWWB5JMW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/STTKRJFKCPFDMTNQUBDWWB5JMW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/STTKRJFKCPFDMTNQUBDWWB5JMW/action/storage_attestation","attest_author":"https://pith.science/pith/STTKRJFKCPFDMTNQUBDWWB5JMW/action/author_attestation","sign_citation":"https://pith.science/pith/STTKRJFKCPFDMTNQUBDWWB5JMW/action/citation_signature","submit_replication":"https://pith.science/pith/STTKRJFKCPFDMTNQUBDWWB5JMW/action/replication_record"}},"created_at":"2026-07-05T04:06:45.985658+00:00","updated_at":"2026-07-05T04:06:45.985658+00:00"}