{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:NFHBXRYDJSDS7HI6TQ657ACNW2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fe12b2e1c1c3b9a156e35bf17aca288d3e02ba92fc440f3bcb1527cfb847b2d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2025-11-11T18:41:50Z","title_canon_sha256":"8a0951fa770dc0af01c2719ab7058f9875a302ff4810a687de865a4215297884"},"schema_version":"1.0","source":{"id":"2511.08559","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.08559","created_at":"2026-05-17T23:39:17Z"},{"alias_kind":"arxiv_version","alias_value":"2511.08559v2","created_at":"2026-05-17T23:39:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.08559","created_at":"2026-05-17T23:39:17Z"},{"alias_kind":"pith_short_12","alias_value":"NFHBXRYDJSDS","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"NFHBXRYDJSDS7HI6","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"NFHBXRYD","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:2125acc37e6be0ef13e6ab55a3f57d7cc01606ba01c5e19c4e67e876c5fb83b7","target":"graph","created_at":"2026-05-17T23:39:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We propose a Reluctant Transfer Learning (RTL) framework that enables efficient model adaptation by selectively transferring essential model components (e.g., regression coefficients) from source to target data, without requiring access to individual-level source data... and provides a regret bound for the difference in value of the optimal ITR and that of the estimated ITR."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The principle of reluctant modeling will only incorporate adjustments when they improve performance on the target dataset, which assumes that performance gains can be reliably detected without overfitting or post-hoc selection bias in the multi-armed treatment setting."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A reluctant transfer learning method for penalized regressions adapts individualized treatment rules to shifted treatment-covariate relationships by selectively transferring coefficients and provides a regret bound."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Reluctant transfer learning updates individualized treatment rules under effect shifts by selective component transfer."}],"snapshot_sha256":"07fbe8351275e5ef9cfdd3aee8d73c4c3082bf4c128a3886cab82c0560c18920"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"edc88023b49acbb3a56a0460be0b63b9be4d503027cabd4c9c95e7e44f85c9eb"},"paper":{"abstract_excerpt":"Estimating individualized treatment rules (ITRs) is fundamental to precision medicine, where the goal is to tailor treatment decisions to individual patient characteristics. While numerous methods have been developed for ITR estimation, there is limited research on model updating that accounts for shifted treatment-covariate relationships in the ITR setting. In practice, models trained on source data must be updated for new (target) datasets that exhibit shifts in treatment effects. To address this challenge, we propose a Reluctant Transfer Learning (RTL) framework that enables efficient model","authors_text":"Eun Jeong Oh, Min Qian","cross_cats":[],"headline":"Reluctant transfer learning updates individualized treatment rules under effect shifts by selective component transfer.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2025-11-11T18:41:50Z","title":"Reluctant Transfer Learning in Penalized Regressions for Individualized Treatment Rules under Effect Heterogeneity"},"references":{"count":4,"internal_anchors":0,"resolved_work":4,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Chu, J., Lu, W., & Yang, S. (2023). Targeted optimal treatment regime learning using summary statistics. Biometrika,110(4), 913–931. Dahabreh, I. J., Petito, L. C., Robertson, S. E., Hern´ an, M. A., ","work_id":"df9497de-6420-4c7c-83c7-36ddb25b9d51","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Mo, W., Qi, Z., & Liu, Y. (2021). Learning optimal distributionally robust individualized treatment rules. Journal of the American Statistical Association,116(534), 659–674. Murphy, S. A. (2003). Opti","work_id":"eef07ed2-edb5-4da4-bb77-54ba836c21df","year":2021},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Robertson, S. E., Steingrimsson, J. A., & Dahabreh, I. J. (2023). Regression-based estimation of heteroge- neous treatment effects when extending inferences from a randomized trial to a target populat","work_id":"66c8f418-7814-40ec-96ce-474ee0f7f9c4","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Zou, H. (2006). The adaptive lasso and its oracle properties.Journal of the American statistical association, 101(476), 1418–1429. 13 Zou, H., & Zhang, H. H. (2009). On the adaptive elastic-net with a","work_id":"058d7558-655a-41bc-a3a9-991de0355264","year":2006}],"snapshot_sha256":"31416bdc244ce61ccd0a26ac8ec5326e4168220a18c4d557b8596d5ab33633f1"},"source":{"id":"2511.08559","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-17T23:11:07.420729Z","id":"5afb6a87-6a83-47b3-927a-98b2eb0806f7","model_set":{"reader":"grok-4.3"},"one_line_summary":"A reluctant transfer learning method for penalized regressions adapts individualized treatment rules to shifted treatment-covariate relationships by selectively transferring coefficients and provides a regret bound.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Reluctant transfer learning updates individualized treatment rules under effect shifts by selective component transfer.","strongest_claim":"We propose a Reluctant Transfer Learning (RTL) framework that enables efficient model adaptation by selectively transferring essential model components (e.g., regression coefficients) from source to target data, without requiring access to individual-level source data... and provides a regret bound for the difference in value of the optimal ITR and that of the estimated ITR.","weakest_assumption":"The principle of reluctant modeling will only incorporate adjustments when they improve performance on the target dataset, which assumes that performance gains can be reliably detected without overfitting or post-hoc selection bias in the multi-armed treatment setting."}},"verdict_id":"5afb6a87-6a83-47b3-927a-98b2eb0806f7"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:20c39ca54950a8ab763f4d8e1bd34d22f81c89828ef7ee454c748fe6bf5a55a7","target":"record","created_at":"2026-05-17T23:39:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fe12b2e1c1c3b9a156e35bf17aca288d3e02ba92fc440f3bcb1527cfb847b2d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2025-11-11T18:41:50Z","title_canon_sha256":"8a0951fa770dc0af01c2719ab7058f9875a302ff4810a687de865a4215297884"},"schema_version":"1.0","source":{"id":"2511.08559","kind":"arxiv","version":2}},"canonical_sha256":"694e1bc7034c872f9d1e9c3ddf804db6b0073725a08c7ea75632ea0230136727","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"694e1bc7034c872f9d1e9c3ddf804db6b0073725a08c7ea75632ea0230136727","first_computed_at":"2026-05-17T23:39:17.139636Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:17.139636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YjwJKdyCXzCPm4p+r8vEE6mqAPDpWH3UAmFJt2RZBfv7xHxSWycCcqcpgUSAA8kP60mxnOPwJcd92tdGY5IAAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:17.140203Z","signed_message":"canonical_sha256_bytes"},"source_id":"2511.08559","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:20c39ca54950a8ab763f4d8e1bd34d22f81c89828ef7ee454c748fe6bf5a55a7","sha256:2125acc37e6be0ef13e6ab55a3f57d7cc01606ba01c5e19c4e67e876c5fb83b7"],"state_sha256":"30c856821db4ad0ce79f8eb808e1597b2f25efa547bccb0b4899ce64771c910d"}