{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:YHWBOTTRPYJJFLVYH4EB23MHLG","short_pith_number":"pith:YHWBOTTR","schema_version":"1.0","canonical_sha256":"c1ec174e717e1292aeb83f081d6d87599a292a1cba81947df2d7f35f1d6c592e","source":{"kind":"arxiv","id":"2105.14328","version":4},"attestation_state":"computed","paper":{"title":"Transfer Learning under High-dimensional Generalized Linear Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Yang Feng, Ye Tian","submitted_at":"2021-05-29T15:39:43Z","abstract_excerpt":"In this work, we study the transfer learning problem under high-dimensional generalized linear models (GLMs), which aim to improve the fit on target data by borrowing information from useful source data. Given which sources to transfer, we propose a transfer learning algorithm on GLM, and derive its $\\ell_1/\\ell_2$-estimation error bounds as well as a bound for a prediction error measure. The theoretical analysis shows that when the target and source are sufficiently close to each other, these bounds could be improved over those of the classical penalized estimator using only target data under"},"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":"2105.14328","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2021-05-29T15:39:43Z","cross_cats_sorted":["cs.LG","stat.ME"],"title_canon_sha256":"1d52ee78872b645afddb020bf8f641b08541c9cd2ad08423182517def926306a","abstract_canon_sha256":"50740c2551fabfe92cb147f04fdd71276b9a83f4f960d377a913b1b1441690ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:15:09.155093Z","signature_b64":"Otfy92z7WnEJkSAYgq4thUR91ZcUH/+FtQduAAELKXNNd75MPiTkF61reRhSnbnte+lYuos/WD0sHWTOi6deAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1ec174e717e1292aeb83f081d6d87599a292a1cba81947df2d7f35f1d6c592e","last_reissued_at":"2026-07-05T04:15:09.154635Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:15:09.154635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Transfer Learning under High-dimensional Generalized Linear Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Yang Feng, Ye Tian","submitted_at":"2021-05-29T15:39:43Z","abstract_excerpt":"In this work, we study the transfer learning problem under high-dimensional generalized linear models (GLMs), which aim to improve the fit on target data by borrowing information from useful source data. Given which sources to transfer, we propose a transfer learning algorithm on GLM, and derive its $\\ell_1/\\ell_2$-estimation error bounds as well as a bound for a prediction error measure. The theoretical analysis shows that when the target and source are sufficiently close to each other, these bounds could be improved over those of the classical penalized estimator using only target data under"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.14328","kind":"arxiv","version":4},"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/2105.14328/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":"2105.14328","created_at":"2026-07-05T04:15:09.154685+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.14328v4","created_at":"2026-07-05T04:15:09.154685+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.14328","created_at":"2026-07-05T04:15:09.154685+00:00"},{"alias_kind":"pith_short_12","alias_value":"YHWBOTTRPYJJ","created_at":"2026-07-05T04:15:09.154685+00:00"},{"alias_kind":"pith_short_16","alias_value":"YHWBOTTRPYJJFLVY","created_at":"2026-07-05T04:15:09.154685+00:00"},{"alias_kind":"pith_short_8","alias_value":"YHWBOTTR","created_at":"2026-07-05T04:15:09.154685+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.30615","citing_title":"Tuning-Free Efficient Estimation for Multi-Source Data via Covariance-Aware Shrinkage","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YHWBOTTRPYJJFLVYH4EB23MHLG","json":"https://pith.science/pith/YHWBOTTRPYJJFLVYH4EB23MHLG.json","graph_json":"https://pith.science/api/pith-number/YHWBOTTRPYJJFLVYH4EB23MHLG/graph.json","events_json":"https://pith.science/api/pith-number/YHWBOTTRPYJJFLVYH4EB23MHLG/events.json","paper":"https://pith.science/paper/YHWBOTTR"},"agent_actions":{"view_html":"https://pith.science/pith/YHWBOTTRPYJJFLVYH4EB23MHLG","download_json":"https://pith.science/pith/YHWBOTTRPYJJFLVYH4EB23MHLG.json","view_paper":"https://pith.science/paper/YHWBOTTR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.14328&json=true","fetch_graph":"https://pith.science/api/pith-number/YHWBOTTRPYJJFLVYH4EB23MHLG/graph.json","fetch_events":"https://pith.science/api/pith-number/YHWBOTTRPYJJFLVYH4EB23MHLG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YHWBOTTRPYJJFLVYH4EB23MHLG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YHWBOTTRPYJJFLVYH4EB23MHLG/action/storage_attestation","attest_author":"https://pith.science/pith/YHWBOTTRPYJJFLVYH4EB23MHLG/action/author_attestation","sign_citation":"https://pith.science/pith/YHWBOTTRPYJJFLVYH4EB23MHLG/action/citation_signature","submit_replication":"https://pith.science/pith/YHWBOTTRPYJJFLVYH4EB23MHLG/action/replication_record"}},"created_at":"2026-07-05T04:15:09.154685+00:00","updated_at":"2026-07-05T04:15:09.154685+00:00"}