{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:73R7WYHF5RSPTIXFTV3KTC6RL4","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":"4a9514251d2977db9cfcde55acff7c8850ad2af5838341c1ddccabc375f8f337","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2023-02-17T09:04:18Z","title_canon_sha256":"ab4e76b33e3375631cfa840ed7f0c32da48b0a721af2ac94e975c198ce89ea58"},"schema_version":"1.0","source":{"id":"2302.08766","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.08766","created_at":"2026-07-05T09:42:18Z"},{"alias_kind":"arxiv_version","alias_value":"2302.08766v5","created_at":"2026-07-05T09:42:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.08766","created_at":"2026-07-05T09:42:18Z"},{"alias_kind":"pith_short_12","alias_value":"73R7WYHF5RSP","created_at":"2026-07-05T09:42:18Z"},{"alias_kind":"pith_short_16","alias_value":"73R7WYHF5RSPTIXF","created_at":"2026-07-05T09:42:18Z"},{"alias_kind":"pith_short_8","alias_value":"73R7WYHF","created_at":"2026-07-05T09:42:18Z"}],"graph_snapshots":[{"event_id":"sha256:af6b96fd41f968ea2060bd13412a83094c432a0d340c172dbec38d11b0f6cf11","target":"graph","created_at":"2026-07-05T09:42:18Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2302.08766/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Bilevel optimization problems, which are problems where two optimization problems are nested, have more and more applications in machine learning. In many practical cases, the upper and the lower objectives correspond to empirical risk minimization problems and therefore have a sum structure. In this context, we propose a bilevel extension of the celebrated SARAH algorithm. We demonstrate that the algorithm requires $\\mathcal{O}((n+m)^{\\frac12}\\varepsilon^{-1})$ oracle calls to achieve $\\varepsilon$-stationarity with $n+m$ the total number of samples, which improves over all previous bilevel a","authors_text":"Mathieu Dagr\\'eou, Pierre Ablin, Samuel Vaiter, Thomas Moreau","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2023-02-17T09:04:18Z","title":"A Lower Bound and a Near-Optimal Algorithm for Bilevel Empirical Risk Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.08766","kind":"arxiv","version":5},"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:9457bfd32935f0a0bc61f3e3866b885195d6d33f9233e12b551f98f8b73c9524","target":"record","created_at":"2026-07-05T09:42:18Z","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":"4a9514251d2977db9cfcde55acff7c8850ad2af5838341c1ddccabc375f8f337","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2023-02-17T09:04:18Z","title_canon_sha256":"ab4e76b33e3375631cfa840ed7f0c32da48b0a721af2ac94e975c198ce89ea58"},"schema_version":"1.0","source":{"id":"2302.08766","kind":"arxiv","version":5}},"canonical_sha256":"fee3fb60e5ec64f9a2e59d76a98bd15f0adf7a6ed0ac7408355cdeb3905a0407","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fee3fb60e5ec64f9a2e59d76a98bd15f0adf7a6ed0ac7408355cdeb3905a0407","first_computed_at":"2026-07-05T09:42:18.352252Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:42:18.352252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iWDpvyeByQCXJO/MPtUZs+MxkdvRdVaU0yzqmRX9wZytbnl4awuUhpCPj2vt0l3yH0GAY+NDpa752da0D11hCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:42:18.352694Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.08766","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9457bfd32935f0a0bc61f3e3866b885195d6d33f9233e12b551f98f8b73c9524","sha256:af6b96fd41f968ea2060bd13412a83094c432a0d340c172dbec38d11b0f6cf11"],"state_sha256":"4b54f8566fc765c248a48b5873ca8911cae4485d8d5f35ad3fe8f6c853330af3"}