{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7W54XMZRVJXJHADLGKM2HNTIWI","short_pith_number":"pith:7W54XMZR","schema_version":"1.0","canonical_sha256":"fdbbcbb331aa6e93806b3299a3b668b22d6bc2a3d0828befc75f072a02edc0c7","source":{"kind":"arxiv","id":"2409.15844","version":2},"attestation_state":"computed","paper":{"title":"Adaptive Learn-then-Test: Statistically Valid and Efficient Hyperparameter Selection","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","cs.IT","cs.LG","math.IT","stat.ME"],"primary_cat":"stat.ML","authors_text":"Matteo Zecchin, Osvaldo Simeone, Sangwoo Park","submitted_at":"2024-09-24T08:14:26Z","abstract_excerpt":"We introduce adaptive learn-then-test (aLTT), an efficient hyperparameter selection procedure that provides finite-sample statistical guarantees on the population risk of AI models. Unlike the existing learn-then-test (LTT) technique, which relies on conventional p-value-based multiple hypothesis testing (MHT), aLTT implements sequential data-dependent MHT with early termination by leveraging e-processes. As a result, aLTT can reduce the number of testing rounds, making it particularly well-suited for scenarios in which testing is costly or presents safety risks. Apart from maintaining statist"},"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":"2409.15844","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"stat.ML","submitted_at":"2024-09-24T08:14:26Z","cross_cats_sorted":["cs.AI","cs.IT","cs.LG","math.IT","stat.ME"],"title_canon_sha256":"c7149d9412e2f72eda64a8ddc88f3b9762d9b9f3aa2b104fde8f42b322439789","abstract_canon_sha256":"531f7d753f91b0b368858801a0bb44e12a400025025202566172c601d84cbe23"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:07:44.559992Z","signature_b64":"hYXNBdtKW05XRQmXfUOfpuZhV0pb9TpXgbqKHFxwXGDQM9p8REkboVD7/gHXxwlLa9CpegR5fm836dM2Fcx9CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdbbcbb331aa6e93806b3299a3b668b22d6bc2a3d0828befc75f072a02edc0c7","last_reissued_at":"2026-07-05T10:07:44.559497Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:07:44.559497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Learn-then-Test: Statistically Valid and Efficient Hyperparameter Selection","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","cs.IT","cs.LG","math.IT","stat.ME"],"primary_cat":"stat.ML","authors_text":"Matteo Zecchin, Osvaldo Simeone, Sangwoo Park","submitted_at":"2024-09-24T08:14:26Z","abstract_excerpt":"We introduce adaptive learn-then-test (aLTT), an efficient hyperparameter selection procedure that provides finite-sample statistical guarantees on the population risk of AI models. Unlike the existing learn-then-test (LTT) technique, which relies on conventional p-value-based multiple hypothesis testing (MHT), aLTT implements sequential data-dependent MHT with early termination by leveraging e-processes. As a result, aLTT can reduce the number of testing rounds, making it particularly well-suited for scenarios in which testing is costly or presents safety risks. Apart from maintaining statist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.15844","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/2409.15844/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":"2409.15844","created_at":"2026-07-05T10:07:44.559553+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.15844v2","created_at":"2026-07-05T10:07:44.559553+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.15844","created_at":"2026-07-05T10:07:44.559553+00:00"},{"alias_kind":"pith_short_12","alias_value":"7W54XMZRVJXJ","created_at":"2026-07-05T10:07:44.559553+00:00"},{"alias_kind":"pith_short_16","alias_value":"7W54XMZRVJXJHADL","created_at":"2026-07-05T10:07:44.559553+00:00"},{"alias_kind":"pith_short_8","alias_value":"7W54XMZR","created_at":"2026-07-05T10:07:44.559553+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.05551","citing_title":"Conformal Risk-Averse Decision Making with Action Conditional Guarantee","ref_index":40,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06479","citing_title":"Risk-Controlled Post-Processing of Decision Policies","ref_index":50,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7W54XMZRVJXJHADLGKM2HNTIWI","json":"https://pith.science/pith/7W54XMZRVJXJHADLGKM2HNTIWI.json","graph_json":"https://pith.science/api/pith-number/7W54XMZRVJXJHADLGKM2HNTIWI/graph.json","events_json":"https://pith.science/api/pith-number/7W54XMZRVJXJHADLGKM2HNTIWI/events.json","paper":"https://pith.science/paper/7W54XMZR"},"agent_actions":{"view_html":"https://pith.science/pith/7W54XMZRVJXJHADLGKM2HNTIWI","download_json":"https://pith.science/pith/7W54XMZRVJXJHADLGKM2HNTIWI.json","view_paper":"https://pith.science/paper/7W54XMZR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.15844&json=true","fetch_graph":"https://pith.science/api/pith-number/7W54XMZRVJXJHADLGKM2HNTIWI/graph.json","fetch_events":"https://pith.science/api/pith-number/7W54XMZRVJXJHADLGKM2HNTIWI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7W54XMZRVJXJHADLGKM2HNTIWI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7W54XMZRVJXJHADLGKM2HNTIWI/action/storage_attestation","attest_author":"https://pith.science/pith/7W54XMZRVJXJHADLGKM2HNTIWI/action/author_attestation","sign_citation":"https://pith.science/pith/7W54XMZRVJXJHADLGKM2HNTIWI/action/citation_signature","submit_replication":"https://pith.science/pith/7W54XMZRVJXJHADLGKM2HNTIWI/action/replication_record"}},"created_at":"2026-07-05T10:07:44.559553+00:00","updated_at":"2026-07-05T10:07:44.559553+00:00"}