{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:JSDZ3CQMY2Z7OJQFK6Q5K33APD","short_pith_number":"pith:JSDZ3CQM","schema_version":"1.0","canonical_sha256":"4c879d8a0cc6b3f7260557a1d56f6078fd7c2fed56d615a3fd8edc4bc5baaf7e","source":{"kind":"arxiv","id":"2403.13565","version":3},"attestation_state":"computed","paper":{"title":"AdaTrans: Feature-wise and Sample-wise Adaptive Transfer Learning for High-dimensional Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.ME","stat.TH"],"primary_cat":"stat.ML","authors_text":"Jingyuan Liu, Runze Li, Ying Sun, Zelin He","submitted_at":"2024-03-20T12:58:46Z","abstract_excerpt":"We consider the transfer learning problem in the high dimensional linear regression setting, where the feature dimension is larger than the sample size. To learn transferable information, which may vary across features or the source samples, we propose an adaptive transfer learning method that can detect and aggregate the feature-wise (F-AdaTrans) or sample-wise (S-AdaTrans) transferable structures. We achieve this by employing a fused-penalty, coupled with weights that can adapt according to the transferable structure. To choose the weight, we propose a theoretically informed, data-driven pro"},"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":"2403.13565","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-03-20T12:58:46Z","cross_cats_sorted":["cs.LG","math.ST","stat.ME","stat.TH"],"title_canon_sha256":"21f1efb90bc044339b55f8a55e51d65bb97a9fc6a69b63887744b6546b2cd68d","abstract_canon_sha256":"6a5639cd5ce388919261a24639e918de29594c90760a9317ff7cd9c3f159e124"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:39:53.768337Z","signature_b64":"Og+mgu1oAeeqQu3AqK+17kE8BQ36mtsnr0HH8Nskb0uovT5TxlYxEOqVE1yPdgsy6uG0sfWnH8QEDynjZ99MDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c879d8a0cc6b3f7260557a1d56f6078fd7c2fed56d615a3fd8edc4bc5baaf7e","last_reissued_at":"2026-07-05T09:39:53.767866Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:39:53.767866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"AdaTrans: Feature-wise and Sample-wise Adaptive Transfer Learning for High-dimensional Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.ME","stat.TH"],"primary_cat":"stat.ML","authors_text":"Jingyuan Liu, Runze Li, Ying Sun, Zelin He","submitted_at":"2024-03-20T12:58:46Z","abstract_excerpt":"We consider the transfer learning problem in the high dimensional linear regression setting, where the feature dimension is larger than the sample size. To learn transferable information, which may vary across features or the source samples, we propose an adaptive transfer learning method that can detect and aggregate the feature-wise (F-AdaTrans) or sample-wise (S-AdaTrans) transferable structures. We achieve this by employing a fused-penalty, coupled with weights that can adapt according to the transferable structure. To choose the weight, we propose a theoretically informed, data-driven pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.13565","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/2403.13565/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":"2403.13565","created_at":"2026-07-05T09:39:53.767922+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.13565v3","created_at":"2026-07-05T09:39:53.767922+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.13565","created_at":"2026-07-05T09:39:53.767922+00:00"},{"alias_kind":"pith_short_12","alias_value":"JSDZ3CQMY2Z7","created_at":"2026-07-05T09:39:53.767922+00:00"},{"alias_kind":"pith_short_16","alias_value":"JSDZ3CQMY2Z7OJQF","created_at":"2026-07-05T09:39:53.767922+00:00"},{"alias_kind":"pith_short_8","alias_value":"JSDZ3CQM","created_at":"2026-07-05T09:39:53.767922+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.11622","citing_title":"Deconfounding via Profiled Transfer Learning","ref_index":1320,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JSDZ3CQMY2Z7OJQFK6Q5K33APD","json":"https://pith.science/pith/JSDZ3CQMY2Z7OJQFK6Q5K33APD.json","graph_json":"https://pith.science/api/pith-number/JSDZ3CQMY2Z7OJQFK6Q5K33APD/graph.json","events_json":"https://pith.science/api/pith-number/JSDZ3CQMY2Z7OJQFK6Q5K33APD/events.json","paper":"https://pith.science/paper/JSDZ3CQM"},"agent_actions":{"view_html":"https://pith.science/pith/JSDZ3CQMY2Z7OJQFK6Q5K33APD","download_json":"https://pith.science/pith/JSDZ3CQMY2Z7OJQFK6Q5K33APD.json","view_paper":"https://pith.science/paper/JSDZ3CQM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.13565&json=true","fetch_graph":"https://pith.science/api/pith-number/JSDZ3CQMY2Z7OJQFK6Q5K33APD/graph.json","fetch_events":"https://pith.science/api/pith-number/JSDZ3CQMY2Z7OJQFK6Q5K33APD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JSDZ3CQMY2Z7OJQFK6Q5K33APD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JSDZ3CQMY2Z7OJQFK6Q5K33APD/action/storage_attestation","attest_author":"https://pith.science/pith/JSDZ3CQMY2Z7OJQFK6Q5K33APD/action/author_attestation","sign_citation":"https://pith.science/pith/JSDZ3CQMY2Z7OJQFK6Q5K33APD/action/citation_signature","submit_replication":"https://pith.science/pith/JSDZ3CQMY2Z7OJQFK6Q5K33APD/action/replication_record"}},"created_at":"2026-07-05T09:39:53.767922+00:00","updated_at":"2026-07-05T09:39:53.767922+00:00"}