{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WF3ZELMYMPI4PVYHZUQPEQUNQD","short_pith_number":"pith:WF3ZELMY","schema_version":"1.0","canonical_sha256":"b177922d9863d1c7d707cd20f2428d80eadbe6ca3c32b7f277caec1e5135c32d","source":{"kind":"arxiv","id":"2506.21460","version":2},"attestation_state":"computed","paper":{"title":"Wild refitting for black box prediction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Martin J. Wainwright","submitted_at":"2025-06-26T16:41:55Z","abstract_excerpt":"We describe and analyze a computionally efficient refitting procedure for computing high-probability upper bounds on the instance-wise mean-squared prediction error of penalized nonparametric estimates based on least-squares minimization. Requiring only a single dataset and black box access to the prediction method, it consists of three steps: computing suitable residuals, symmetrizing and scaling them with a pre-factor $\\rho$, and using them to define and solve a modified prediction problem recentered at the current estimate. We refer to it as wild refitting, since it uses Rademacher residual"},"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":"2506.21460","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-06-26T16:41:55Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"476273c6b689433b5ae1878805fd4ae0f949f1690cc6c5b7ee8401f940bcc240","abstract_canon_sha256":"146bcdd2101c7bccc9fff9d6e5cf034fc09ba54d1bd8058aeec6ecf7068f5ef7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:34:09.954474Z","signature_b64":"OVxNIjti/hG5OJiy3fzhL7uZyIRzdtEQjzBmvUpKZ323TZ3r5yUH3R+PiraMrLLexXDZ6+R7AcrKD6RqF6JOBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b177922d9863d1c7d707cd20f2428d80eadbe6ca3c32b7f277caec1e5135c32d","last_reissued_at":"2026-07-05T11:34:09.954044Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:34:09.954044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Wild refitting for black box prediction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Martin J. Wainwright","submitted_at":"2025-06-26T16:41:55Z","abstract_excerpt":"We describe and analyze a computionally efficient refitting procedure for computing high-probability upper bounds on the instance-wise mean-squared prediction error of penalized nonparametric estimates based on least-squares minimization. Requiring only a single dataset and black box access to the prediction method, it consists of three steps: computing suitable residuals, symmetrizing and scaling them with a pre-factor $\\rho$, and using them to define and solve a modified prediction problem recentered at the current estimate. We refer to it as wild refitting, since it uses Rademacher residual"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.21460","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.21460/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":"2506.21460","created_at":"2026-07-05T11:34:09.954099+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.21460v2","created_at":"2026-07-05T11:34:09.954099+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.21460","created_at":"2026-07-05T11:34:09.954099+00:00"},{"alias_kind":"pith_short_12","alias_value":"WF3ZELMYMPI4","created_at":"2026-07-05T11:34:09.954099+00:00"},{"alias_kind":"pith_short_16","alias_value":"WF3ZELMYMPI4PVYH","created_at":"2026-07-05T11:34:09.954099+00:00"},{"alias_kind":"pith_short_8","alias_value":"WF3ZELMY","created_at":"2026-07-05T11:34:09.954099+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.00393","citing_title":"Model-Based Reinforcement Learning with Double Oracle Efficiency in Policy Optimization and Offline Estimation","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WF3ZELMYMPI4PVYHZUQPEQUNQD","json":"https://pith.science/pith/WF3ZELMYMPI4PVYHZUQPEQUNQD.json","graph_json":"https://pith.science/api/pith-number/WF3ZELMYMPI4PVYHZUQPEQUNQD/graph.json","events_json":"https://pith.science/api/pith-number/WF3ZELMYMPI4PVYHZUQPEQUNQD/events.json","paper":"https://pith.science/paper/WF3ZELMY"},"agent_actions":{"view_html":"https://pith.science/pith/WF3ZELMYMPI4PVYHZUQPEQUNQD","download_json":"https://pith.science/pith/WF3ZELMYMPI4PVYHZUQPEQUNQD.json","view_paper":"https://pith.science/paper/WF3ZELMY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.21460&json=true","fetch_graph":"https://pith.science/api/pith-number/WF3ZELMYMPI4PVYHZUQPEQUNQD/graph.json","fetch_events":"https://pith.science/api/pith-number/WF3ZELMYMPI4PVYHZUQPEQUNQD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WF3ZELMYMPI4PVYHZUQPEQUNQD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WF3ZELMYMPI4PVYHZUQPEQUNQD/action/storage_attestation","attest_author":"https://pith.science/pith/WF3ZELMYMPI4PVYHZUQPEQUNQD/action/author_attestation","sign_citation":"https://pith.science/pith/WF3ZELMYMPI4PVYHZUQPEQUNQD/action/citation_signature","submit_replication":"https://pith.science/pith/WF3ZELMYMPI4PVYHZUQPEQUNQD/action/replication_record"}},"created_at":"2026-07-05T11:34:09.954099+00:00","updated_at":"2026-07-05T11:34:09.954099+00:00"}