{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:YQARC22ON5OU2E2EXF6BH7AXN4","short_pith_number":"pith:YQARC22O","schema_version":"1.0","canonical_sha256":"c401116b4e6f5d4d1344b97c13fc176f2d3d8acf4db7b80fc54ddea7759fb6d8","source":{"kind":"arxiv","id":"2201.13409","version":4},"attestation_state":"computed","paper":{"title":"A framework for bilevel optimization that enables stochastic and global variance reduction algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Mathieu Dagr\\'eou, Pierre Ablin, Samuel Vaiter, Thomas Moreau","submitted_at":"2022-01-31T18:17:25Z","abstract_excerpt":"Bilevel optimization, the problem of minimizing a value function which involves the arg-minimum of another function, appears in many areas of machine learning. In a large scale empirical risk minimization setting where the number of samples is huge, it is crucial to develop stochastic methods, which only use a few samples at a time to progress. However, computing the gradient of the value function involves solving a linear system, which makes it difficult to derive unbiased stochastic estimates. To overcome this problem we introduce a novel framework, in which the solution of the inner problem"},"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":"2201.13409","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2022-01-31T18:17:25Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"7ced9cc070a93a289432ed4dfbf40b1537d1910cf913e848146fabeccc63fb4d","abstract_canon_sha256":"af6748e858da6885d47db2539b925cd00e1f58dacd4095aab6aeb6f4ce733c8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:42:17.092993Z","signature_b64":"os3mto9SfhqsYlnIOISYFemOMLkQe7uQWiZELCHFYiQ0sYL0TVVwHo7L6+C450Bqm/Q1B7EP1AhWxhGmKIYHAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c401116b4e6f5d4d1344b97c13fc176f2d3d8acf4db7b80fc54ddea7759fb6d8","last_reissued_at":"2026-07-05T09:42:17.092241Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:42:17.092241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A framework for bilevel optimization that enables stochastic and global variance reduction algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Mathieu Dagr\\'eou, Pierre Ablin, Samuel Vaiter, Thomas Moreau","submitted_at":"2022-01-31T18:17:25Z","abstract_excerpt":"Bilevel optimization, the problem of minimizing a value function which involves the arg-minimum of another function, appears in many areas of machine learning. In a large scale empirical risk minimization setting where the number of samples is huge, it is crucial to develop stochastic methods, which only use a few samples at a time to progress. However, computing the gradient of the value function involves solving a linear system, which makes it difficult to derive unbiased stochastic estimates. To overcome this problem we introduce a novel framework, in which the solution of the inner problem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.13409","kind":"arxiv","version":4},"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/2201.13409/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":"2201.13409","created_at":"2026-07-05T09:42:17.092362+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.13409v4","created_at":"2026-07-05T09:42:17.092362+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.13409","created_at":"2026-07-05T09:42:17.092362+00:00"},{"alias_kind":"pith_short_12","alias_value":"YQARC22ON5OU","created_at":"2026-07-05T09:42:17.092362+00:00"},{"alias_kind":"pith_short_16","alias_value":"YQARC22ON5OU2E2E","created_at":"2026-07-05T09:42:17.092362+00:00"},{"alias_kind":"pith_short_8","alias_value":"YQARC22O","created_at":"2026-07-05T09:42:17.092362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.19143","citing_title":"Single-loop approaches to nonsmooth bilevel optimisation","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2511.01126","citing_title":"Stochastic Regret Guarantees for Online Zeroth- and First-Order Bilevel Optimization","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YQARC22ON5OU2E2EXF6BH7AXN4","json":"https://pith.science/pith/YQARC22ON5OU2E2EXF6BH7AXN4.json","graph_json":"https://pith.science/api/pith-number/YQARC22ON5OU2E2EXF6BH7AXN4/graph.json","events_json":"https://pith.science/api/pith-number/YQARC22ON5OU2E2EXF6BH7AXN4/events.json","paper":"https://pith.science/paper/YQARC22O"},"agent_actions":{"view_html":"https://pith.science/pith/YQARC22ON5OU2E2EXF6BH7AXN4","download_json":"https://pith.science/pith/YQARC22ON5OU2E2EXF6BH7AXN4.json","view_paper":"https://pith.science/paper/YQARC22O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.13409&json=true","fetch_graph":"https://pith.science/api/pith-number/YQARC22ON5OU2E2EXF6BH7AXN4/graph.json","fetch_events":"https://pith.science/api/pith-number/YQARC22ON5OU2E2EXF6BH7AXN4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YQARC22ON5OU2E2EXF6BH7AXN4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YQARC22ON5OU2E2EXF6BH7AXN4/action/storage_attestation","attest_author":"https://pith.science/pith/YQARC22ON5OU2E2EXF6BH7AXN4/action/author_attestation","sign_citation":"https://pith.science/pith/YQARC22ON5OU2E2EXF6BH7AXN4/action/citation_signature","submit_replication":"https://pith.science/pith/YQARC22ON5OU2E2EXF6BH7AXN4/action/replication_record"}},"created_at":"2026-07-05T09:42:17.092362+00:00","updated_at":"2026-07-05T09:42:17.092362+00:00"}