{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SEGAVLO32Z4Z7FZKQ5X7MMDWXW","short_pith_number":"pith:SEGAVLO3","schema_version":"1.0","canonical_sha256":"910c0aaddbd6799f972a876ff63076bd802835f497e9868410c09c304094a32b","source":{"kind":"arxiv","id":"1502.02344","version":2},"attestation_state":"computed","paper":{"title":"Regularization Path of Cross-Validation Error Lower Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Atsushi Shibagaki, Ichiro Takeuchi, Masayuki Karasuyama, Yoshiki Suzuki","submitted_at":"2015-02-09T03:35:38Z","abstract_excerpt":"Careful tuning of a regularization parameter is indispensable in many machine learning tasks because it has a significant impact on generalization performances. Nevertheless, current practice of regularization parameter tuning is more of an art than a science, e.g., it is hard to tell how many grid-points would be needed in cross-validation (CV) for obtaining a solution with sufficiently small CV error. In this paper we propose a novel framework for computing a lower bound of the CV errors as a function of the regularization parameter, which we call regularization path of CV error lower bounds"},"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":"1502.02344","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-02-09T03:35:38Z","cross_cats_sorted":[],"title_canon_sha256":"5a0467b4169001c9d9984cc15043a2b562547cd70ca995122d163ca7672afd1c","abstract_canon_sha256":"9c4b0b4009bf4fbbd549b57bcc8d0bcc37b1e87a3da70bcb80b146b720a443d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:41:47.690409Z","signature_b64":"nMqiDjyW2FpvtZhFwk6HGFzCojC7ZCYOGCw6f5cFjXm2zuDKa0qLLkkt6fSSiqazrgQ5AhddTyVBd0g8KXDcCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"910c0aaddbd6799f972a876ff63076bd802835f497e9868410c09c304094a32b","last_reissued_at":"2026-05-18T01:41:47.689999Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:41:47.689999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regularization Path of Cross-Validation Error Lower Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Atsushi Shibagaki, Ichiro Takeuchi, Masayuki Karasuyama, Yoshiki Suzuki","submitted_at":"2015-02-09T03:35:38Z","abstract_excerpt":"Careful tuning of a regularization parameter is indispensable in many machine learning tasks because it has a significant impact on generalization performances. Nevertheless, current practice of regularization parameter tuning is more of an art than a science, e.g., it is hard to tell how many grid-points would be needed in cross-validation (CV) for obtaining a solution with sufficiently small CV error. In this paper we propose a novel framework for computing a lower bound of the CV errors as a function of the regularization parameter, which we call regularization path of CV error lower bounds"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02344","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":""},"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":"1502.02344","created_at":"2026-05-18T01:41:47.690060+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.02344v2","created_at":"2026-05-18T01:41:47.690060+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02344","created_at":"2026-05-18T01:41:47.690060+00:00"},{"alias_kind":"pith_short_12","alias_value":"SEGAVLO32Z4Z","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"SEGAVLO32Z4Z7FZK","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"SEGAVLO3","created_at":"2026-05-18T12:29:39.896362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SEGAVLO32Z4Z7FZKQ5X7MMDWXW","json":"https://pith.science/pith/SEGAVLO32Z4Z7FZKQ5X7MMDWXW.json","graph_json":"https://pith.science/api/pith-number/SEGAVLO32Z4Z7FZKQ5X7MMDWXW/graph.json","events_json":"https://pith.science/api/pith-number/SEGAVLO32Z4Z7FZKQ5X7MMDWXW/events.json","paper":"https://pith.science/paper/SEGAVLO3"},"agent_actions":{"view_html":"https://pith.science/pith/SEGAVLO32Z4Z7FZKQ5X7MMDWXW","download_json":"https://pith.science/pith/SEGAVLO32Z4Z7FZKQ5X7MMDWXW.json","view_paper":"https://pith.science/paper/SEGAVLO3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.02344&json=true","fetch_graph":"https://pith.science/api/pith-number/SEGAVLO32Z4Z7FZKQ5X7MMDWXW/graph.json","fetch_events":"https://pith.science/api/pith-number/SEGAVLO32Z4Z7FZKQ5X7MMDWXW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SEGAVLO32Z4Z7FZKQ5X7MMDWXW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SEGAVLO32Z4Z7FZKQ5X7MMDWXW/action/storage_attestation","attest_author":"https://pith.science/pith/SEGAVLO32Z4Z7FZKQ5X7MMDWXW/action/author_attestation","sign_citation":"https://pith.science/pith/SEGAVLO32Z4Z7FZKQ5X7MMDWXW/action/citation_signature","submit_replication":"https://pith.science/pith/SEGAVLO32Z4Z7FZKQ5X7MMDWXW/action/replication_record"}},"created_at":"2026-05-18T01:41:47.690060+00:00","updated_at":"2026-05-18T01:41:47.690060+00:00"}