{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FOFPVLJUK57QMEAW5AJGKFNBCV","short_pith_number":"pith:FOFPVLJU","schema_version":"1.0","canonical_sha256":"2b8afaad34577f061016e8126515a1156c3612c44a165c818e9bd922968a097b","source":{"kind":"arxiv","id":"1810.10703","version":2},"attestation_state":"computed","paper":{"title":"K for the Price of 1: Parameter-efficient Multi-task and Transfer Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrew Howard, Andrey Zhmoginov, Mark Sandler, Pramod Kaushik Mudrakarta","submitted_at":"2018-10-25T03:12:37Z","abstract_excerpt":"We introduce a novel method that enables parameter-efficient transfer and multi-task learning with deep neural networks. The basic approach is to learn a model patch - a small set of parameters - that will specialize to each task, instead of fine-tuning the last layer or the entire network. For instance, we show that learning a set of scales and biases is sufficient to convert a pretrained network to perform well on qualitatively different problems (e.g. converting a Single Shot MultiBox Detection (SSD) model into a 1000-class image classification model while reusing 98% of parameters of the 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":"1810.10703","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-25T03:12:37Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"ea49919c4eaca1d2291d634fd75026f91db57d6a3ee5d1d1f1a7fbeee97d5036","abstract_canon_sha256":"7e87820b1987da77720405a7e0a93bd8ea235b54315f176235fe012d4f869f9b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:51.777128Z","signature_b64":"XL3BGJMcydTCL9avpOW4+Vy+fFj19BdzUiwrXFQz6MX4H4874nHIVFGbbf674kUNPRII+PxWTAUxoECusCepAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b8afaad34577f061016e8126515a1156c3612c44a165c818e9bd922968a097b","last_reissued_at":"2026-05-17T23:52:51.776457Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:51.776457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"K for the Price of 1: Parameter-efficient Multi-task and Transfer Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrew Howard, Andrey Zhmoginov, Mark Sandler, Pramod Kaushik Mudrakarta","submitted_at":"2018-10-25T03:12:37Z","abstract_excerpt":"We introduce a novel method that enables parameter-efficient transfer and multi-task learning with deep neural networks. The basic approach is to learn a model patch - a small set of parameters - that will specialize to each task, instead of fine-tuning the last layer or the entire network. For instance, we show that learning a set of scales and biases is sufficient to convert a pretrained network to perform well on qualitatively different problems (e.g. converting a Single Shot MultiBox Detection (SSD) model into a 1000-class image classification model while reusing 98% of parameters of the S"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10703","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1810.10703","created_at":"2026-05-17T23:52:51.776590+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.10703v2","created_at":"2026-05-17T23:52:51.776590+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10703","created_at":"2026-05-17T23:52:51.776590+00:00"},{"alias_kind":"pith_short_12","alias_value":"FOFPVLJUK57Q","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"FOFPVLJUK57QMEAW","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"FOFPVLJU","created_at":"2026-05-18T12:32:25.280505+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FOFPVLJUK57QMEAW5AJGKFNBCV","json":"https://pith.science/pith/FOFPVLJUK57QMEAW5AJGKFNBCV.json","graph_json":"https://pith.science/api/pith-number/FOFPVLJUK57QMEAW5AJGKFNBCV/graph.json","events_json":"https://pith.science/api/pith-number/FOFPVLJUK57QMEAW5AJGKFNBCV/events.json","paper":"https://pith.science/paper/FOFPVLJU"},"agent_actions":{"view_html":"https://pith.science/pith/FOFPVLJUK57QMEAW5AJGKFNBCV","download_json":"https://pith.science/pith/FOFPVLJUK57QMEAW5AJGKFNBCV.json","view_paper":"https://pith.science/paper/FOFPVLJU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.10703&json=true","fetch_graph":"https://pith.science/api/pith-number/FOFPVLJUK57QMEAW5AJGKFNBCV/graph.json","fetch_events":"https://pith.science/api/pith-number/FOFPVLJUK57QMEAW5AJGKFNBCV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FOFPVLJUK57QMEAW5AJGKFNBCV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FOFPVLJUK57QMEAW5AJGKFNBCV/action/storage_attestation","attest_author":"https://pith.science/pith/FOFPVLJUK57QMEAW5AJGKFNBCV/action/author_attestation","sign_citation":"https://pith.science/pith/FOFPVLJUK57QMEAW5AJGKFNBCV/action/citation_signature","submit_replication":"https://pith.science/pith/FOFPVLJUK57QMEAW5AJGKFNBCV/action/replication_record"}},"created_at":"2026-05-17T23:52:51.776590+00:00","updated_at":"2026-05-17T23:52:51.776590+00:00"}