{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CDMM55UYPY4STG4EIIVOHC3YYU","short_pith_number":"pith:CDMM55UY","canonical_record":{"source":{"id":"1810.05471","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-10-12T12:16:52Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"720cb74f11fd578383ffbaa04e4b3666ebfdcf291ef167376270f7c2a6dd8d6a","abstract_canon_sha256":"b1629d4bc17d7aa620d80fe1fff68a6814b98049299c1cee07022c5ff858c018"},"schema_version":"1.0"},"canonical_sha256":"10d8cef6987e39299b84422ae38b78c52fe48b69706e8832a58db21766b2ef3e","source":{"kind":"arxiv","id":"1810.05471","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05471","created_at":"2026-05-17T23:45:04Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05471v3","created_at":"2026-05-17T23:45:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05471","created_at":"2026-05-17T23:45:04Z"},{"alias_kind":"pith_short_12","alias_value":"CDMM55UYPY4S","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CDMM55UYPY4STG4E","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CDMM55UY","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CDMM55UYPY4STG4EIIVOHC3YYU","target":"record","payload":{"canonical_record":{"source":{"id":"1810.05471","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-10-12T12:16:52Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"720cb74f11fd578383ffbaa04e4b3666ebfdcf291ef167376270f7c2a6dd8d6a","abstract_canon_sha256":"b1629d4bc17d7aa620d80fe1fff68a6814b98049299c1cee07022c5ff858c018"},"schema_version":"1.0"},"canonical_sha256":"10d8cef6987e39299b84422ae38b78c52fe48b69706e8832a58db21766b2ef3e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:04.367443Z","signature_b64":"mOXqq0UxQwVJ/CFcZlwUfZ31YU52bL3gucYcVD+FL5EepLs1XlaIxirR/vz47fD414Ks2Jtu6jX8WYom/8zYCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10d8cef6987e39299b84422ae38b78c52fe48b69706e8832a58db21766b2ef3e","last_reissued_at":"2026-05-17T23:45:04.366771Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:04.366771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.05471","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:45:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+rOIwiBcu9bYIUxgulQp4ctQj9Nl7vhxp4jz3GVSCg1Dore3o0ZUeXNDmdzhxc6hKCIh5s43xtXQsXjq0FWJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T09:47:36.777525Z"},"content_sha256":"03094e94a0e62bef3376b582fe76eb29a5700b9db2c742f1be11e42a110dfafd","schema_version":"1.0","event_id":"sha256:03094e94a0e62bef3376b582fe76eb29a5700b9db2c742f1be11e42a110dfafd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CDMM55UYPY4STG4EIIVOHC3YYU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Safe Grid Search with Optimal Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Eugene Ndiaye, Ichiro Takeuchi, Joseph Salmon, Olivier Fercoq, Tam Le","submitted_at":"2018-10-12T12:16:52Z","abstract_excerpt":"Popular machine learning estimators involve regularization parameters that can be challenging to tune, and standard strategies rely on grid search for this task. In this paper, we revisit the techniques of approximating the regularization path up to predefined tolerance $\\epsilon$ in a unified framework and show that its complexity is $O(1/\\sqrt[d]{\\epsilon})$ for uniformly convex loss of order $d \\geq 2$ and $O(1/\\sqrt{\\epsilon})$ for Generalized Self-Concordant functions. This framework encompasses least-squares but also logistic regression, a case that as far as we know was not handled as p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05471","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:45:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u4aQeRtnFvo+cqBy41MNXIC8bfePvaTEAA2NbINt2rWO/VZh+JHytLQm9LW4qPI2rqKqhJkUjVfi5VULHaTJCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T09:47:36.777871Z"},"content_sha256":"fc4b85c9145b7f158668f9d28e8295848c4716672ed98a83b9fa189ab90a7cd9","schema_version":"1.0","event_id":"sha256:fc4b85c9145b7f158668f9d28e8295848c4716672ed98a83b9fa189ab90a7cd9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CDMM55UYPY4STG4EIIVOHC3YYU/bundle.json","state_url":"https://pith.science/pith/CDMM55UYPY4STG4EIIVOHC3YYU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CDMM55UYPY4STG4EIIVOHC3YYU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-02T09:47:36Z","links":{"resolver":"https://pith.science/pith/CDMM55UYPY4STG4EIIVOHC3YYU","bundle":"https://pith.science/pith/CDMM55UYPY4STG4EIIVOHC3YYU/bundle.json","state":"https://pith.science/pith/CDMM55UYPY4STG4EIIVOHC3YYU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CDMM55UYPY4STG4EIIVOHC3YYU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CDMM55UYPY4STG4EIIVOHC3YYU","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":"b1629d4bc17d7aa620d80fe1fff68a6814b98049299c1cee07022c5ff858c018","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-10-12T12:16:52Z","title_canon_sha256":"720cb74f11fd578383ffbaa04e4b3666ebfdcf291ef167376270f7c2a6dd8d6a"},"schema_version":"1.0","source":{"id":"1810.05471","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05471","created_at":"2026-05-17T23:45:04Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05471v3","created_at":"2026-05-17T23:45:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05471","created_at":"2026-05-17T23:45:04Z"},{"alias_kind":"pith_short_12","alias_value":"CDMM55UYPY4S","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CDMM55UYPY4STG4E","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CDMM55UY","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:fc4b85c9145b7f158668f9d28e8295848c4716672ed98a83b9fa189ab90a7cd9","target":"graph","created_at":"2026-05-17T23:45:04Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Popular machine learning estimators involve regularization parameters that can be challenging to tune, and standard strategies rely on grid search for this task. In this paper, we revisit the techniques of approximating the regularization path up to predefined tolerance $\\epsilon$ in a unified framework and show that its complexity is $O(1/\\sqrt[d]{\\epsilon})$ for uniformly convex loss of order $d \\geq 2$ and $O(1/\\sqrt{\\epsilon})$ for Generalized Self-Concordant functions. This framework encompasses least-squares but also logistic regression, a case that as far as we know was not handled as p","authors_text":"Eugene Ndiaye, Ichiro Takeuchi, Joseph Salmon, Olivier Fercoq, Tam Le","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-10-12T12:16:52Z","title":"Safe Grid Search with Optimal Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05471","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:03094e94a0e62bef3376b582fe76eb29a5700b9db2c742f1be11e42a110dfafd","target":"record","created_at":"2026-05-17T23:45:04Z","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":"b1629d4bc17d7aa620d80fe1fff68a6814b98049299c1cee07022c5ff858c018","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-10-12T12:16:52Z","title_canon_sha256":"720cb74f11fd578383ffbaa04e4b3666ebfdcf291ef167376270f7c2a6dd8d6a"},"schema_version":"1.0","source":{"id":"1810.05471","kind":"arxiv","version":3}},"canonical_sha256":"10d8cef6987e39299b84422ae38b78c52fe48b69706e8832a58db21766b2ef3e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"10d8cef6987e39299b84422ae38b78c52fe48b69706e8832a58db21766b2ef3e","first_computed_at":"2026-05-17T23:45:04.366771Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:04.366771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mOXqq0UxQwVJ/CFcZlwUfZ31YU52bL3gucYcVD+FL5EepLs1XlaIxirR/vz47fD414Ks2Jtu6jX8WYom/8zYCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:04.367443Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.05471","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03094e94a0e62bef3376b582fe76eb29a5700b9db2c742f1be11e42a110dfafd","sha256:fc4b85c9145b7f158668f9d28e8295848c4716672ed98a83b9fa189ab90a7cd9"],"state_sha256":"7295882d0193e63c71d95b2b2e85d19c6cce92cb9fa25dbc7f98f23ecf4fd855"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VquMcC+0m2H2otFrtBwrpHMumZAGFltH+NnVbCLinfCMtWkRzTzmwIM8YyoTZYJGgNBWHwYZUA0NX3uDC9qHBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T09:47:36.779816Z","bundle_sha256":"5b09236de8be1b05a41f64b6b073c0df7d6163a5c13d09628b20ff9e29b5d419"}}