{"as_of":"2026-08-17T09:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fd3fe55382f70955a4399a7d20211c743ecea5f6774c3ccd03f3525806a144c2","coverage":[{"denominator":106,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T17:52:28.909710Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2507.20400/citation-record","integrity":"/paper/2507.20400/integrity","json":"/paper/2507.20400/citation-record.json","paper":"/paper/2507.20400"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:28.529276Z","title":"Sharp-maml: Sharpness-aware model-agnostic meta learning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.529276Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:dbaa512cab1cd25717f420450c48fb655861efa8bc69d0f3f6a323bd2a973e68","observation_id":"ebb87b5d-965c-4aa2-bba5-e353607b17a3","resolution":{"observed_at":"2026-08-15T17:52:28.529276Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:28.533980Z","title":"Muppet: Massive multi-task representations with pre-finetuning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.533980Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:8c8c72abb81c6a38ccd41c12632994ea15b0d3a1a482b82f745263ec9b92ccd3","observation_id":"75f0557c-cc88-466d-b431-fad3c3640d83","resolution":{"observed_at":"2026-08-15T17:52:28.533980Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:28.538272Z","title":"Non-convex bilevel games with critical point selection maps","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.538272Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:cbfacc9a47166708978b6bae02e2dbd8ef331531059b90713ba516a88c9feed8","observation_id":"e92bb38e-1494-4600-ab81-b82d88f7951b","resolution":{"observed_at":"2026-08-15T17:52:28.538272Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:28.542384Z","title":"Provable representation learning for imitation learning via bi-level optimization","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.542384Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:d8aa89d449e4a4f4ac2e459edd8def10a37282e0552351bb90ca897bdd16aeef","observation_id":"e69b358e-7584-4c2d-852a-12456224b1c2","resolution":{"observed_at":"2026-08-15T17:52:28.542384Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:28.546319Z","title":"On the quality of first-order approximation of functions with h ¨older continuous gradient","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.546319Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:c7648445389e7e9336a73dd076e91ab2a7e669b7ea165c5d8c18b55fd22101c9","observation_id":"ee64b03e-dcaa-488a-abe2-30a63d4b498a","resolution":{"observed_at":"2026-08-15T17:52:28.546319Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:28.550257Z","title":"Pythia: A suite for analyzing large language models across training and scaling","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.550257Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:1f47c6cb7bd1ea405b2e708f669cf420753565c601b8eecaed1f4a0bb81c164b","observation_id":"8ae2764d-e964-4692-a4ae-2cdda3dcf52a","resolution":{"observed_at":"2026-08-15T17:52:28.550257Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:28.554541Z","title":"Automatic differentiation of nonsmooth iterative algorithms","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.554541Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:db203da3e20a5347a7a26eff8875268b77cc434cde4e552338d577e0928078d6","observation_id":"ed882deb-e83d-4419-9e86-b09e9b1c2619","resolution":{"observed_at":"2026-08-15T17:52:28.554541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:28.558261Z","title":"Coresets via bilevel optimization for continual learning and streaming","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.558261Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:b50762a2948a8414b2c7d62ec5253e8139384ead8ef7742e9c1436daec6bb0ec","observation_id":"2b773adb-6399-4d27-aca6-5258bb0b683d","resolution":{"observed_at":"2026-08-15T17:52:28.558261Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:28.562199Z","title":"Convex Optimization: Algorithms and Complexity","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.562199Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:2e3a845882d2e264c9e2f08a9c01aee41c1e41df22ae56deafa57b83d0fba5d1","observation_id":"e79509a7-e946-4f64-8ea1-dee69c5b3b16","resolution":{"observed_at":"2026-08-15T17:52:28.562199Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.00712","last_updated":"2026-04-28T06:26:34Z","snapshot_observed_at":"2026-07-06T14:36:45.845182Z","submitted_at":"2023-01-02T15:09:12Z","title":"On Finding Small Hyper-Gradients in Bilevel Optimization: Hardness Results and Improved Analysis","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.00712","snapshot_observed_at":"2026-08-15T17:52:28.566184Z","title":"On bilevel optimization without lower-level strong convexity","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.566184Z"},"links":{"cited_paper":"/paper/2301.00712","citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:fd1392a5251f0fa3f2e34afd1a231bf4eec2ebe0cabd45564bbea02ea4f63b79","observation_id":"bc4bbba5-075a-498c-acef-c10603e517c9","resolution":{"observed_at":"2026-08-15T17:52:28.566184Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:28.570651Z","title":"On finding small hyper-gradients in bilevel optimization: Hardness results and improved analysis","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.570651Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:55bc11e31cfe18dc05d5fed8e23cd5566fd0637931e5327d0a0ec612d6fe809c","observation_id":"71b10931-4417-40b8-a364-a7ae519818f0","resolution":{"observed_at":"2026-08-15T17:52:28.570651Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:28.574234Z","title":"Learning with limited samples – meta-learning and applications to communication systems","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.574234Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:75c5314f3243a57321467b3b1e20c060543fef2537ef269fc830ccf022668faa","observation_id":"f3f83947-18a9-46f2-b6b2-c75b6e219254","resolution":{"observed_at":"2026-08-15T17:52:28.574234Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.02854","last_updated":"2025-03-26T16:41:07Z","snapshot_observed_at":"2026-08-16T12:46:34.156144Z","submitted_at":"2025-03-26T16:41:07Z","title":"Efficient First-Order Optimization on the Pareto Set for Multi-Objective Learning under Preference Guidance","version":1},"cited_work":{"arxiv_id":"2504.02854","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.02854","snapshot_observed_at":"2026-08-15T17:52:29.291623Z","title":"Efficient First-Order Optimization on the Pareto Set for Multi-Objective Learning under Preference Guidance","venue":"math.OC","work_id":"7211df9c-b747-42f4-b1d7-dc25af81268c","year":2025},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.577933Z"},"links":{"cited_paper":"/paper/2504.02854","citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:6ccd615b28e7a6945840ad8c117a371e013493ac8b3d34447b0194f89fc60e1e","observation_id":"6621f9f3-f3af-48d0-99b9-8a8b69d6b600","resolution":{"observed_at":"2026-08-15T17:52:29.296283Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:28.582183Z","title":"A single-timescale method for stochastic bilevel optimization","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.582183Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:4921aeccae507d4d92eaa0c6348913f14f9aebdbea803ab643d04a052f90c154","observation_id":"2829f99b-e6bf-4633-bbe1-0d724a736b7d","resolution":{"observed_at":"2026-08-15T17:52:28.582183Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:28.586248Z","title":"Closing the gap: Tighter analysis of alternating stochastic gradient methods for bilevel problems","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.586248Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:5ad74cd7df748b271fea583a657e93b653d47854c8d4a22d1c794057ec669234","observation_id":"43f67915-312e-4471-be0a-8d27639dd449","resolution":{"observed_at":"2026-08-15T17:52:28.586248Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.16615","last_updated":"2022-06-03T06:17:49Z","snapshot_observed_at":"2026-08-16T17:10:28.048403Z","submitted_at":"2022-03-30T18:53:04Z","title":"A Fast and Convergent Proximal Algorithm for Regularized Nonconvex and Nonsmooth Bi-level Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.16615","snapshot_observed_at":"2026-08-15T17:52:28.589968Z","title":"A fast and convergent proximal algorithm for regularized nonconvex and nonsmooth bi-level optimization","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.589968Z"},"links":{"cited_paper":"/paper/2203.16615","citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:f5b8a8200675adbd68a3198ea8b7c8dbac20af23eb5dba544fdc5dc162d7365c","observation_id":"b4569818-7732-4293-8fd7-b3e425d9550e","resolution":{"observed_at":"2026-08-15T17:52:28.589968Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:28.594094Z","title":"Directly fine-tuning diffusion models on differentiable rewards","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.594094Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:f07b608ca9da15667d58c6dd2ed914d99787a6bba0a7ecdd48396a54d21d9548","observation_id":"825822e1-1934-440a-86e0-39d7f3fc52eb","resolution":{"observed_at":"2026-08-15T17:52:28.594094Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:28.597871Z","title":"Optimization and nonsmooth analysis","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.597871Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:5889b14c188e24a3dc2c226aa3cc577c94caeb8cf649ffbf2f7021a1d95c600d","observation_id":"f2700b58-aa8c-4630-a292-fd0703ea1cf8","resolution":{"observed_at":"2026-08-15T17:52:28.597871Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:28.601840Z","title":"A framework for bilevel optimization that enables stochastic and global variance reduction algorithms","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.601840Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:af82c99a2035291a7b7a2bbe7d57997b1f4743555715b562039745d843d1e0fd","observation_id":"d6738d7e-a634-43fa-b901-b9137adb3fe7","resolution":{"observed_at":"2026-08-15T17:52:28.601840Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:28.605425Z","title":"Automatically constructing a corpus of sentential paraphrases","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.605425Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:643b698cb05a1b3a04d98d4b955acacce69c660f2b4f2f1d8c1e2fa8d348ab37","observation_id":"48cc3961-b0d8-45b9-8d65-3da355a8edab","resolution":{"observed_at":"2026-08-15T17:52:28.605425Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.02101","last_updated":"2025-05-04T13:13:29Z","snapshot_observed_at":"2026-08-16T00:59:09.880062Z","submitted_at":"2025-05-04T13:13:29Z","title":"Efficient Curvature-Aware Hypergradient Approximation for Bilevel Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.02101","snapshot_observed_at":"2026-08-15T17:52:28.609950Z","title":"Efficient curvature-aware hypergradient approxi- mation for bilevel optimization","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.609950Z"},"links":{"cited_paper":"/paper/2505.02101","citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:6c28f25df9163e8058132a285597b63d4069907e29790cb00296048aa580012f","observation_id":"4a77fb6b-dbeb-4885-af67-f3f1d2a4abe2","resolution":{"observed_at":"2026-08-15T17:52:28.609950Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.06666","last_updated":"2025-03-01T12:59:49Z","snapshot_observed_at":"2026-08-16T13:19:40.907971Z","submitted_at":"2024-09-10T17:34:34Z","title":"LLaMA-Omni: Seamless Speech Interaction with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.06666","snapshot_observed_at":"2026-08-15T17:52:28.613808Z","title":"Llama-omni: Seamless speech interaction with large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.613808Z"},"links":{"cited_paper":"/paper/2409.06666","citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:1ee01f90b8f726294687775f0d704811bb5116cbb3da1c59a26d673fed1563dc","observation_id":"e9d9c51a-45a3-417b-88a7-66d03301e2a5","resolution":{"observed_at":"2026-08-15T17:52:28.613808Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:28.618415Z","title":"qnbo: quasi-newton meets bilevel optimization","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.618415Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:7af9b571f450b4d24377d71b7ba106367e9cb58a046f05960f1578f9cb4a11a3","observation_id":"c4321031-13f8-4361-b961-9acc62f02de9","resolution":{"observed_at":"2026-08-15T17:52:28.618415Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:28.622089Z","title":"Mitigating forgetting in llm supervised fine-tuning and preference learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.622089Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:f0e2604645b58f8dbe6411920f120e6da5f7e1f88235eca78562a808c6b8cf19","observation_id":"82b0d0f9-0d71-4133-8abb-7113f14dbbab","resolution":{"observed_at":"2026-08-15T17:52:28.622089Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:28.625949Z","title":"Sharpness-aware minimization for efficiently improving generalization","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.625949Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:8012a30d776e7cbbe664dd88b5549556977ba68e294c42a31efe173ce37d3276","observation_id":"54f9e667-0692-42b4-acf1-6cbf961fda03","resolution":{"observed_at":"2026-08-15T17:52:28.625949Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:28.629711Z","title":"Forward and reverse gradient- based hyperparameter optimization","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.629711Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:9cb69fdb47eacd0344d022f67903069aedd81643ddd49e1bf8289e63b2754e35","observation_id":"1f59c1e0-5099-4ab7-906d-4a45daaa44f4","resolution":{"observed_at":"2026-08-15T17:52:28.629711Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:28.633809Z","title":"Bilevel programming for hyperparameter optimization and meta-learning","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.633809Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:545244a083d70b3109ebef86aea0de89f4afbf1e26584d9df05852836d577ac8","observation_id":"9e47b8d9-9f07-41dc-b824-510883632c1c","resolution":{"observed_at":"2026-08-15T17:52:28.633809Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1802.02246","last_updated":"2018-02-06T22:10:14Z","snapshot_observed_at":"2026-08-16T15:51:37.195604Z","submitted_at":"2018-02-06T22:10:14Z","title":"Approximation Methods for Bilevel Programming","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.02246","snapshot_observed_at":"2026-08-15T17:52:28.637714Z","title":"Approximation methods for bilevel programming","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.637714Z"},"links":{"cited_paper":"/paper/1802.02246","citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:bafe3575a883647b71f8a4518f057fddc7074a17a3f2fb0a800de2d99bf081c7","observation_id":"9e4ec9c7-49d4-4b26-891f-0a8ee1a36333","resolution":{"observed_at":"2026-08-15T17:52:28.637714Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:28.641777Z","title":"An investigation into neural net optimization via hessian eigenvalue density","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.641777Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:fd62efecc688632198a2e5636841f1e7c21d2d9f941bd7226c5053e81a55b735","observation_id":"dc3efe82-9573-4ca9-91e1-da0f576dfc34","resolution":{"observed_at":"2026-08-15T17:52:28.641777Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-08-13T17:20:44.002518Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-15T17:52:28.645472Z","title":"The llama 3 herd of models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.645472Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:69b4bfe3f0af68b7128ba9ff7c8e382348268da5f4ee3d33b95923edfb9df077","observation_id":"4738343f-0e33-45b0-9a65-bcab1c653ffc","resolution":{"observed_at":"2026-08-15T17:52:28.645472Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:28.649375Z","title":"On the iteration complexity of hypergradient computation","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.649375Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:01886be0610d3f1265f2ee9b48dfc552ea05749cf0ad4456eb132cf151990835","observation_id":"5c9fbcaa-0a36-49bd-9db6-187c93401a5d","resolution":{"observed_at":"2026-08-15T17:52:28.649375Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:28.653415Z","title":"Bilevel coreset selection in continual learning: A new formulation and algorithm","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.653415Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:26b7540800ef4b015731153767974f3b02d7da90f0544d35a78b6a7c7b0ada7f","observation_id":"ee028c55-3e27-47a7-824f-edb676d0eafb","resolution":{"observed_at":"2026-08-15T17:52:28.653415Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:28.657158Z","title":"A two-timescale stochastic algorithm framework for bilevel optimization: Complexity analysis and application to actor-critic","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.657158Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:7834a2951f9c0339972f20f56ab962297156b7b5f1c32d3a9af0790e385a6405","observation_id":"dfc98c07-2717-4e6a-a5c4-9d6762bd5434","resolution":{"observed_at":"2026-08-15T17:52:28.657158Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:28.660799Z","title":"Lora: Low-rank adaptation of large language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.660799Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:42ccc9ecb898449f3223ba643ad2bf12d95f88f607b95afe99d80f819800d95a","observation_id":"42a0bb6a-60d1-4915-8853-a1d856623c7e","resolution":{"observed_at":"2026-08-15T17:52:28.660799Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:30.018809Z","title":"Contextual stochastic bilevel optimiza- tion","venue":null,"work_id":"e11eb647-8f52-42a7-bd86-9f9d650fc396","year":2023},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.664834Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:d7dcfdf16307b1166c9ed7e1be1aa3e522ed518fcbae1828f3cc1a4bccdd8638","observation_id":"c1333bf7-3af3-43e2-a0b3-e5ac12d61ff9","resolution":{"observed_at":"2026-08-15T17:52:30.022989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.14224","last_updated":"2022-06-01T00:57:57Z","snapshot_observed_at":"2026-08-16T16:57:04.899616Z","submitted_at":"2022-05-27T20:28:52Z","title":"Will Bilevel Optimizers Benefit from Loops","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.14224","snapshot_observed_at":"2026-08-15T17:52:28.668655Z","title":"Will bilevel optimizers benefit from loops","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.668655Z"},"links":{"cited_paper":"/paper/2205.14224","citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:b388fb4d573cab1ee008ca191384fa4da53332de228a8fdb79966565a19dca61","observation_id":"1eb3f069-6326-4cda-9d84-eac7d948337e","resolution":{"observed_at":"2026-08-15T17:52:28.668655Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:28.672740Z","title":"Bilevel optimization: Convergence analysis and enhanced design","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.672740Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:44876e9b2dab2a77a22ae57efcee21a0d32ea4108bd7f05ab8f8b7da4b766f7b","observation_id":"ace00f49-e855-4937-93e6-53e1162e3c65","resolution":{"observed_at":"2026-08-15T17:52:28.672740Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.998587Z","title":"Provably faster algorithms for bilevel optimization and applications to meta-learning","venue":null,"work_id":"1ebb50e4-d834-46a1-93ac-d1e6c48b778e","year":2021},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.676421Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:cf18ff7ff8c81f6becc3d8c5c028fa0798303a90d075d2b2fff9756ccab5980b","observation_id":"3c16bdc6-8418-452e-bec2-74e584d17be2","resolution":{"observed_at":"2026-08-15T17:52:30.002615Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.986261Z","title":"A primal-dual-assisted penalty approach to bilevel optimization with coupled constraints","venue":null,"work_id":"db875b3d-9d9f-4c8a-bb17-d5f1fdcfe1e6","year":2024},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.680218Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:3a50389b01c355e33651eadcd0b12fdceb03f34532550fd4d5b3817f4091f862","observation_id":"e4d77700-4ed6-47d1-9728-8bb1b4b0ad3e","resolution":{"observed_at":"2026-08-15T17:52:29.990305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.974018Z","title":"Linear convergence of gradient and proximal-gradient methods under the polyak-łojasiewicz condition","venue":null,"work_id":"a35a8e19-2f86-49fb-97c3-52725bb4931f","year":2016},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.684112Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:20cdadc35e702e45269ac1f4aefaeb4a73f25542c3d62c79425c93950317601e","observation_id":"1fbee800-6d11-4fcb-8e7a-9d343d2559db","resolution":{"observed_at":"2026-08-15T17:52:29.978112Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.960508Z","title":"A near-optimal algorithm for stochastic bilevel optimization via double-momentum","venue":null,"work_id":"7659c447-aea1-4435-b207-3c570040819a","year":2021},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.687944Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:6eacef5b59d67e316225a3f899b41298e6eeef0e52087177b0f010ff33512a37","observation_id":"399964c2-c574-4c4e-8df9-4e10d04e73ba","resolution":{"observed_at":"2026-08-15T17:52:29.965818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-08-14T18:51:16.666127Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-15T17:52:28.691631Z","title":"Adam: A method for stochastic optimization","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.691631Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:ba3d10e9fad5bbd417d9998aac9e3f8253d3efb10a3f18ccb482017e950f8e9c","observation_id":"e3d31898-c4a0-42c0-90ec-6d6645b0fd29","resolution":{"observed_at":"2026-08-15T17:52:28.691631Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.947432Z","title":"A fully first-order method for stochastic bilevel optimization","venue":null,"work_id":"18fa190c-88cd-48c9-9124-2315dba94178","year":2023},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.695580Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:0b4ded4f24b571a964ff037b3f02e3c10afca0fd6cb99fe6848bd0128e42d4aa","observation_id":"28773f4e-c2fc-4afa-8260-b466ebc19695","resolution":{"observed_at":"2026-08-15T17:52:29.952433Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.932794Z","title":"On penalty methods for nonconvex bilevel optimization and first-order stochastic approximation","venue":null,"work_id":"5ed8171c-6e9a-4509-9c6a-52c2c4239eb4","year":2024},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.699451Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:a56ab9fe6d8723c9e294cf8b3235ad3420a0f47d7f09659ee8674a0c96e282e8","observation_id":"cb618cd8-739c-424b-a726-ebc9d1179b81","resolution":{"observed_at":"2026-08-15T17:52:29.936916Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.919463Z","title":"Convergence of adam under relaxed assumptions","venue":null,"work_id":"6c9f19e3-ed11-41a1-a396-9a25e11aa16d","year":2023},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.703186Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:b5aa6e2d947553264109928295300bb372e51b3ffbb1d4bbb30ecd62637e1eeb","observation_id":"2ea61c56-b631-4971-a433-8582720cc4aa","resolution":{"observed_at":"2026-08-15T17:52:29.923808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.907192Z","title":"A fully single loop algorithm for bilevel optimization without hessian inverse","venue":null,"work_id":"1812d4a4-8e40-43b4-94b0-54ef689037ae","year":2022},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.706925Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:f5e959ca4a2149e6bfd65aec5786b07af3fda394bea9ea1d3164830b4ed67f6c","observation_id":"16bea4a2-ad8b-4600-bcd3-c5f06621e748","resolution":{"observed_at":"2026-08-15T17:52:29.911144Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1806.09055","last_updated":"2019-04-23T06:29:32Z","snapshot_observed_at":"2026-08-15T06:40:14.261008Z","submitted_at":"2018-06-24T00:06:13Z","title":"DARTS: Differentiable Architecture Search","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.09055","snapshot_observed_at":"2026-08-15T17:52:28.710545Z","title":"Darts: Differentiable architecture search","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.710545Z"},"links":{"cited_paper":"/paper/1806.09055","citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:877b43bfd3330c1c9a774ca33f01f472e896bbff97450af55d05df89f6253f0e","observation_id":"ec944b82-d58d-48c7-8fbd-4791bc887f81","resolution":{"observed_at":"2026-08-15T17:52:28.710545Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.894790Z","title":"Investigating bilevel optimization for learning and vision from a unified perspective: A survey and beyond","venue":null,"work_id":"48c65548-285a-435b-93af-a1da19c213c7","year":2021},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.714524Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:8c5c72122312b7103fbebfb8f07422fa2ed558174a78ee428cb9a93160d858c5","observation_id":"74f8583a-115f-4e87-8523-c4ce5461b81e","resolution":{"observed_at":"2026-08-15T17:52:29.898979Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.882274Z","title":"A value-function-based interior- point method for non-convex bi-level optimization","venue":null,"work_id":"70c69e6e-545b-4cb0-9958-331f20a132a0","year":2021},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.718417Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:6301d8ab0b26cebd5ec8e774076b37ab27cb82e24d86bbbca19f166e16998fb0","observation_id":"5470e811-58d5-4304-a609-71f4973f13c2","resolution":{"observed_at":"2026-08-15T17:52:29.886492Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:28.722113Z","title":"Value-function-based sequential minimization for bi-level optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.722113Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:411e6dc7acd1f5b38daf19cfa3350cb4bb633a3a08c1f13ceb4d7a35511f8355","observation_id":"72b1415d-b816-43e0-83aa-a37e22f75ed9","resolution":{"observed_at":"2026-08-15T17:52:28.722113Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.861633Z","title":"Averaged method of multipliers for bi-level optimization without lower-level strong convexity","venue":null,"work_id":"e836cbca-7203-45db-beeb-cf72e26043ce","year":2023},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.726156Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:2cfa99943388540a5767947f53a080c720537d4b5b4f604615dba78d2f937e55","observation_id":"3692eb12-57e7-4d24-9071-1062cfd749ab","resolution":{"observed_at":"2026-08-15T17:52:29.866197Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09353","last_updated":"2024-07-09T05:59:16Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-02-14T17:59:34Z","title":"DoRA: Weight-Decomposed Low-Rank Adaptation","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09353","snapshot_observed_at":"2026-08-15T17:52:28.729813Z","title":"Dora: Weight-decomposed low-rank adaptation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.729813Z"},"links":{"cited_paper":"/paper/2402.09353","citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:22db7d2e73bc97e50e7c3fc434305b28bd8dae5657f1b3cce821a4edcbb057ad","observation_id":"536b6372-1e35-4f12-a124-c2e70154fb33","resolution":{"observed_at":"2026-08-15T17:52:28.729813Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.849728Z","title":"On the optimization landscape of low rank adaptation methods for large language models","venue":null,"work_id":"9533a545-a4e2-43aa-94ad-cf81ffbe26d1","year":2025},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.733817Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:47c27890e9598b88ca2531f17665af8594149a48fce310bb6bdedec7628e1f62","observation_id":"51d27496-e558-40d1-90ad-0d020a91485f","resolution":{"observed_at":"2026-08-15T17:52:29.853845Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.837639Z","title":"The flan collection: Designing data and methods for effective instruction tuning","venue":null,"work_id":"a4d5429f-2a9e-41dc-990b-e582e720795b","year":2023},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.737588Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:ce866aa673e052438787a8de19e57d905143d0f2c4229d8f4ffa099f8e92e3d6","observation_id":"7319ff4b-4dcb-4744-8d1b-d4f2130bc65b","resolution":{"observed_at":"2026-08-15T17:52:29.841748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.824058Z","title":"Boundary matters: A bi-level active finetuning method","venue":null,"work_id":"d9855fb3-a378-4816-8cf5-c69c0cc1f046","year":2024},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.741400Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:56c7b641a4b80b6ccc2b30e95d9c3ab5b9010613911a5f1e76902124b8ff8a5c","observation_id":"1140ec96-9232-4db5-888e-c1562a6b18b8","resolution":{"observed_at":"2026-08-15T17:52:29.828580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:28.745259Z","title":"Learning word vectors for sentiment analysis","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.745259Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:fd4dd1722b8e555f8baa766bf47ad437827243c0f9b00fc7fbda4c65f966e774","observation_id":"b664e952-1327-491b-b3b2-873cd4b76334","resolution":{"observed_at":"2026-08-15T17:52:28.745259Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.803606Z","title":"Gradient-based hyperparameter optimization through reversible learning","venue":null,"work_id":"dccec26a-fadf-4651-888c-382676099981","year":2015},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.748811Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:43e2c2c0f78d581cbeac9e5383bae93cf60dd53a150d34a7706174143629b70e","observation_id":"db410bee-c55c-4349-ab41-a5eb62556824","resolution":{"observed_at":"2026-08-15T17:52:29.808105Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.790647Z","title":"Implicit diffusion: Efficient optimization through stochastic sampling","venue":null,"work_id":"d16ca485-96c5-4389-af81-bc5aaf390cbd","year":2025},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.752577Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:7d2fa57a7bf2c550abf95355efbc717163a9b687f5c0544bc99d2e0db5c04133","observation_id":"3f743605-acd2-4e03-97e3-0d015ed34f87","resolution":{"observed_at":"2026-08-15T17:52:29.795896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:28.756506Z","title":"Introductory lectures on convex optimization: A basic course , volume 87","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.756506Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:3d6476679a2c45e258cbb6a0f6455c637cf6343b88b01edfe616d6564e219f4a","observation_id":"6ad26576-b6bb-4b50-89c3-f7324ca4bb7b","resolution":{"observed_at":"2026-08-15T17:52:28.756506Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.02999","last_updated":"2018-10-22T16:11:14Z","snapshot_observed_at":"2026-08-14T19:38:16.450214Z","submitted_at":"2018-03-08T08:29:38Z","title":"On First-Order Meta-Learning Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.02999","snapshot_observed_at":"2026-08-15T17:52:28.760448Z","title":"On first-order meta-learning algorithms","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.760448Z"},"links":{"cited_paper":"/paper/1803.02999","citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:a36a44c8b1856c2ab128f9a3b8a7d38b8567e2bd00f37013b0530b6b3f9172d1","observation_id":"25015a85-caab-4b69-9a5d-8119c52c8769","resolution":{"observed_at":"2026-08-15T17:52:28.760448Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.19976","last_updated":"2025-05-25T05:03:51Z","snapshot_observed_at":"2026-08-16T13:38:42.609308Z","submitted_at":"2024-06-28T15:03:08Z","title":"ScaleBiO: Scalable Bilevel Optimization for LLM Data Reweighting","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.19976","snapshot_observed_at":"2026-08-15T17:52:28.764439Z","title":"Scalebio: Scalable bilevel optimization for llm data reweighting","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.764439Z"},"links":{"cited_paper":"/paper/2406.19976","citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:c0022fd7141d9e269449227b900d6f36e998af57783de654ca417ba978d8eab5","observation_id":"7e740a8f-4685-4d1a-ba2f-4bc2c5cd0bfb","resolution":{"observed_at":"2026-08-15T17:52:28.764439Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:28.768242Z","title":"Bleu: a method for automatic evaluation of machine translation","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.768242Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:9ebaef7e8cad02cd76630772b2041729dab3f1c26fc9c7c0252d26fe4af552fb","observation_id":"ef28aaf7-980c-4eb0-a81f-ab2f412d07fa","resolution":{"observed_at":"2026-08-15T17:52:28.768242Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.764218Z","title":"Functional bilevel optimization for machine learning","venue":null,"work_id":"ef5f9197-cf4d-4afb-8697-bd46e1fbf209","year":2024},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.771892Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:98fdf1f0a6db9f7f2aa2de4838d6cd278871d1ac1259f933e90125c5b1f89c93","observation_id":"59a66b0f-064f-4f7d-a4a4-cc06959b6218","resolution":{"observed_at":"2026-08-15T17:52:29.768215Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.09758","last_updated":"2025-08-03T15:52:04Z","snapshot_observed_at":"2026-08-16T13:09:57.113092Z","submitted_at":"2024-10-13T07:28:26Z","title":"BiDoRA: Bi-level Optimization-Based Weight-Decomposed Low-Rank Adaptation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.09758","snapshot_observed_at":"2026-08-15T17:52:28.775621Z","title":"Bidora: Bi-level optimization-based weight-decomposed low-rank adaptation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.775621Z"},"links":{"cited_paper":"/paper/2410.09758","citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:dca7a5c164ffd35a88ee429d97ddda992bcb8980fdda8511af07e945949afc38","observation_id":"796dcf21-0f41-4896-a67f-f1846cfef063","resolution":{"observed_at":"2026-08-15T17:52:28.775621Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:28.779870Z","title":"Direct preference optimization: Your language model is secretly a reward model","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.779870Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:01490a6183c8761476bb0776be52675b9e7cfeb89a9f6edc51178e253393d58a","observation_id":"671594fe-9ae8-4ba4-9013-7c86489b7652","resolution":{"observed_at":"2026-08-15T17:52:28.779870Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.744287Z","title":"Shine: Sharing the inverse estimate from the forward pass for bi-level optimization and implicit models","venue":null,"work_id":"9746bca1-a4a6-445d-bd4d-01c9f07c0cb2","year":2022},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.783505Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:8b4102365659ce97e636095efdd16fdb3dc61139080ebc7f22fe5bb58b68f7c2","observation_id":"b542d359-1cb6-4758-829b-b20f12c58176","resolution":{"observed_at":"2026-08-15T17:52:29.748264Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.730980Z","title":"How to prepare your task head for finetuning","venue":null,"work_id":"9bdcc639-b539-4269-be80-d1c38bbb5dd3","year":2023},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.787427Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:e2f620b296f1633ad07306ea250ab4fc0a4db68ae39d4fbd66503f604113dff8","observation_id":"965036d2-d12b-4a32-88f5-9202665dbbab","resolution":{"observed_at":"2026-08-15T17:52:29.735295Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.718752Z","title":"Cohort profile: The national longitudinal survey of youth 1979 (nlsy79)","venue":null,"work_id":"d375e6cf-6bc8-4ec7-9ffc-96a4ee5eaced","year":1979},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.790996Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:d9257493b9d12d2ca876cfca2d10803bb4614969b27bd6b8e43cfece806d08f6","observation_id":"f925efb0-d032-4712-a66e-7040f5386bcc","resolution":{"observed_at":"2026-08-15T17:52:29.722820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:28.794658Z","title":"Equilibrium propagation: Bridging the gap between energy-based models and backpropagation","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.794658Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:170a0b49ec5afc630556f412b6a8c7f5ea7b4c989c68ea3a74de08b7db9c3065","observation_id":"98c9337d-d6a8-4cb3-a3bd-efa0e3e61c4a","resolution":{"observed_at":"2026-08-15T17:52:28.794658Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:28.798654Z","title":"Truncated back-propagation for bilevel optimization","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.798654Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:4cfc6df147b6860453cfa217e66bbcbb9a42c169be601142d4cba3d9a4b8c3b3","observation_id":"f8085eb3-124a-48bd-afd4-994d1e831ed9","resolution":{"observed_at":"2026-08-15T17:52:28.798654Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.690621Z","title":"Seal: Safety-enhanced aligned llm fine-tuning via bilevel data selection","venue":null,"work_id":"bddaa049-1fae-439f-bd41-f413ca2aefc9","year":2025},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.802154Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:daa8bf78cce5398527cde8da2e8809411bab68f4a017ac8b363c6ad16a80ecd3","observation_id":"9c90b9ec-0b19-4c94-b357-076dce367ab9","resolution":{"observed_at":"2026-08-15T17:52:29.695483Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.678587Z","title":"A single-timescale analysis for stochastic approximation with multiple coupled sequences","venue":null,"work_id":"d4263ad6-f487-4003-964d-48beb225920a","year":2022},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.805705Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:f5a3a2e70a92d5f6f4a5a93490f3e111ca28f76e400962a6bd82ced25437839b","observation_id":"a45baf68-d780-44ea-bdd0-a9d9380327e8","resolution":{"observed_at":"2026-08-15T17:52:29.682762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.666300Z","title":"On penalty-based bilevel gradient descent method","venue":null,"work_id":"7cd7ae48-a89f-4916-aa7e-3012b7a38c88","year":2023},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.809357Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:0ae9ee861e1233c7c751b13aaa21056b7f9d4c034eeaca0bd7a3d138ca95331c","observation_id":"08ba9bbd-36fa-4ce8-a121-f4f8943ed179","resolution":{"observed_at":"2026-08-15T17:52:29.670360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.653633Z","title":"Principled penalty-based methods for bilevel reinforcement learning and RLHF","venue":null,"work_id":"2975be59-1c37-4fe8-8932-f3f80e31d331","year":2024},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.812807Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:087a6915cd0ccea6cc76d81581a50eaa6a3324037f2f115cfcc1ac73da49c652","observation_id":"73d2c357-2be7-41e0-8157-43ad83b8fa3a","resolution":{"observed_at":"2026-08-15T17:52:29.657974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.641202Z","title":"Fair representation learning through implicit path alignment","venue":null,"work_id":"910957a0-c9b3-4778-99c2-bc7e95483fc4","year":2022},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.816653Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:2f4c7616c001ea1054187223d365ab5991173949f4398e0af0704c28310d4a8f","observation_id":"4a733dd8-15cf-4ec1-82ed-7151400b4505","resolution":{"observed_at":"2026-08-15T17:52:29.645853Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.01123","last_updated":"2022-06-08T16:36:24Z","snapshot_observed_at":"2026-08-16T17:17:43.836741Z","submitted_at":"2022-03-01T18:20:01Z","title":"A Primal-Dual Approach to Bilevel Optimization with Multiple Inner Minima","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.01123","snapshot_observed_at":"2026-08-15T17:52:28.820249Z","title":"A constrained optimization approach to bilevel optimization with multiple inner minima","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.820249Z"},"links":{"cited_paper":"/paper/2203.01123","citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:2e631b66720ebe1746ab2e7afbf4af48eb38f886c623a500c4980f483deb1101","observation_id":"d386b0c8-0455-4074-b9e6-95dcbb7cdbf4","resolution":{"observed_at":"2026-08-15T17:52:28.820249Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.629506Z","title":"On the convergence theory for hessian-free bilevel algorithms","venue":null,"work_id":"adb41909-97d4-43ea-ad4b-d26abcbf2332","year":2022},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.823926Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:2cf2810bd7a9230b38fe0fba7b05040df7a0bd384f9b27884899748b6909b894","observation_id":"b51e6f16-24c1-43f5-a055-73ce59c7f98e","resolution":{"observed_at":"2026-08-15T17:52:29.633631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.617312Z","title":"Retrospectives: Who invented instrumental variable regression? Journal of Economic Perspectives, 17(3):177–194, 2003","venue":null,"work_id":"8df141d4-c6c4-4341-a856-55fdc83d8c21","year":2003},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.827621Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:882ee302083e691e6158392e20c253a99e0ee8097ad9ea2c5e05a2cd8c9cf8eb","observation_id":"2239c13e-c631-45b7-bf16-b797ac35be93","resolution":{"observed_at":"2026-08-15T17:52:29.621509Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.605127Z","title":"Bi-level optimization of charging scheduling of a battery swap station based on deep reinforcement learning","venue":null,"work_id":"03624eb0-30f1-4fae-8788-1bdd05c300da","year":2023},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.831346Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:2382672f3b36288aae32e664174d6c9261c23fdba2f71590896969c0416902cf","observation_id":"a1e230c3-57bd-43d1-9580-627b68233060","resolution":{"observed_at":"2026-08-15T17:52:29.609580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.592581Z","title":"Contextual bilevel reinforcement learning for incentive alignment","venue":null,"work_id":"a3e898f6-6bcd-446e-8700-c7a8c962e3cc","year":2024},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.835115Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:e7800fdbab4a9232754d9e2acdf57a343c12a827214b53fed0fbedc91657c44d","observation_id":"699b106e-0be7-4f52-ba2e-06b3baf59bc4","resolution":{"observed_at":"2026-08-15T17:52:29.596797Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.580282Z","title":"On implicit bias in overparameterized bilevel optimization","venue":null,"work_id":"4fcb0d0f-20d2-4549-9528-9407b1b41000","year":2022},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.838867Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:7f608aa3364205a3d86486ce12611afb8a3ba1e405c5d45593c1b7f7f3d524ff","observation_id":"7a4b1e22-b368-44f5-81d0-984ba471df4d","resolution":{"observed_at":"2026-08-15T17:52:29.584560Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:28.842355Z","title":"Fully first-order methods for decentralized bilevel optimization","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.842355Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:759b785fb3f918a856c04a528913ab5cd882e6665cfcf2dc4134e2ed8c431b7e","observation_id":"92fb7154-040d-4b33-9e57-2ec3895cfa70","resolution":{"observed_at":"2026-08-15T17:52:28.842355Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.568434Z","title":"Convergence of alternating gradient descent for matrix factorization","venue":null,"work_id":"f5beb9f8-baf6-4feb-901d-7316a74a2973","year":2023},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.846596Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:ccf7d3d183bc1e541132f9e1616981b9bcf2ccb8830f89e53d86ed1060e2bece","observation_id":"0b149213-0dd0-4b03-aa4e-b1706fecbbc1","resolution":{"observed_at":"2026-08-15T17:52:29.572401Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.556375Z","title":"Perturbation theory for pseudo-inverses","venue":null,"work_id":"4f4af249-d564-482d-a1b7-abd43d7c282f","year":1973},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.850270Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:7bfa2b3053507f63dcc80b8af346838efca06fcefdb8401b3a40997a8cfa656b","observation_id":"f0bf5c2d-6982-439d-8c48-368d074afffe","resolution":{"observed_at":"2026-08-15T17:52:29.560403Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.544335Z","title":"Unlocking global optimality in bilevel optimization: A pilot study","venue":null,"work_id":"a1a05625-0d74-4f99-9b0e-1a789cd45ecc","year":2025},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.854165Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:803332d4bbd587f20bef0fe247b8ca9a4860026e6701a756d5899ab16ee6a31b","observation_id":"494d2d5a-6019-46d4-8842-43040ec67242","resolution":{"observed_at":"2026-08-15T17:52:29.548444Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.531909Z","title":"A generalized alternating method for bilevel optimization under the polyak-łojasiewicz condition","venue":null,"work_id":"06454cd6-a62c-4956-b437-4a6846736d20","year":2023},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.857854Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:230a0a8960076728696181a3634c992da5ec041806599794580c39e73023abfa","observation_id":"6a42db22-56dd-4c64-8e6a-ec4e6cd263bc","resolution":{"observed_at":"2026-08-15T17:52:29.536209Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.519410Z","title":"Alternating implicit projected sgd and its effi- cient variants for equality-constrained bilevel optimization","venue":null,"work_id":"1834363a-02cc-4c79-838d-c618820a8336","year":2023},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.861414Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:2ad5162a3bdbad7a569fad2a8421380da817929bf881ed6134d07635edcdc286","observation_id":"a9e9df62-7fcc-4732-bda6-a2e1d733bc00","resolution":{"observed_at":"2026-08-15T17:52:29.523692Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.08808","last_updated":"2025-08-05T16:27:52Z","snapshot_observed_at":"2026-08-16T15:50:06.882936Z","submitted_at":"2025-02-12T21:44:06Z","title":"A First-order Generative Bilevel Optimization Framework for Diffusion Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.08808","snapshot_observed_at":"2026-08-15T17:52:28.865110Z","title":"A first- order generative bilevel optimization framework for diffusion models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.865110Z"},"links":{"cited_paper":"/paper/2502.08808","citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:4b90a4b83b618e625cd47a8390389950181fea25b9f4b7aae157ff13330787f2","observation_id":"6333e627-3171-459c-ac63-b0e6cc903bbd","resolution":{"observed_at":"2026-08-15T17:52:28.865110Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.507793Z","title":"All you need is beyond a good init: Exploring better solution for training extremely deep convolutional neural networks with orthonormality and modulation","venue":null,"work_id":"0d9ebd4a-a50a-4897-a46d-e4a79f65a299","year":2017},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.868987Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:7908ecfd4d90e525e00f5b68cd63e756cc73001ac334f1236bcbaebd7acdf3d0","observation_id":"aba5bfa2-6f35-4d79-bb3d-d01e481698a6","resolution":{"observed_at":"2026-08-15T17:52:29.511688Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.495510Z","title":"Deep proxy causal learning and its application to confounded bandit policy evaluation","venue":null,"work_id":"5da15078-c92f-4eff-881d-3e20337d1979","year":2021},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.872570Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:79809b78034659215d42b10741cdcc39bc4dd2d8459c7db0d17f099e3c8477c9","observation_id":"9178c3c5-bbbb-456b-9dfa-4011759993ee","resolution":{"observed_at":"2026-08-15T17:52:29.499839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.483664Z","title":"Pruning parameterization with bi-level optimization for efficient semantic segmentation on the edge","venue":null,"work_id":"6106428f-0de9-404a-9e7a-7fa96cee9363","year":2023},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.876463Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:03f07805b89e58849eca47b9d5bb22bcd952e69721330c4881ccacd9e6b6ee61","observation_id":"da95e30c-757d-4f10-ad38-25763d325532","resolution":{"observed_at":"2026-08-15T17:52:29.487846Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.04692","last_updated":"2021-12-15T20:10:53Z","snapshot_observed_at":"2026-08-16T18:18:35.928871Z","submitted_at":"2021-06-08T21:05:30Z","title":"Provably Faster Algorithms for Bilevel Optimization","version":2},"cited_work":{"arxiv_id":"2106.04692","doi":null,"metadata_source":"pith","pith_arxiv_id":"2106.04692","snapshot_observed_at":"2026-08-15T17:52:28.978291Z","title":"Provably Faster Algorithms for Bilevel Optimization","venue":"cs.LG","work_id":"dffc4102-ce68-420b-a2f8-43c308da1d19","year":2021},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.880199Z"},"links":{"cited_paper":"/paper/2106.04692","citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:5f28ba837def30b8269567f740ec7d9ff7f727c89b0dcd41182bdd352f770794","observation_id":"2286fcca-a6bb-4bc4-8c53-f0e5af551228","resolution":{"observed_at":"2026-08-15T17:52:28.984284Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.471797Z","title":"First-order federated bilevel learning","venue":null,"work_id":"23f176a0-ea3d-44c1-83c2-56e0841a8318","year":2025},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.883936Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:51e3f1b758f0e6a807dd9bce5d2cd18275023bd5766f765a95c9d7f38df0b8aa","observation_id":"82498de2-e6d5-4989-9d19-9ebc6d75bf9e","resolution":{"observed_at":"2026-08-15T17:52:29.475909Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.16164","last_updated":"2024-01-29T13:50:56Z","snapshot_observed_at":"2026-08-16T14:23:39.021432Z","submitted_at":"2024-01-29T13:50:56Z","title":"Constrained Bi-Level Optimization: Proximal Lagrangian Value function Approach and Hessian-free Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.16164","snapshot_observed_at":"2026-08-15T17:52:28.887538Z","title":"Constrained bi-level optimization: Proximal lagrangian value function approach and hessian-free algorithm","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.887538Z"},"links":{"cited_paper":"/paper/2401.16164","citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:a32f8d8851d8a47d820f564485bd178edf7111343deb9a33c1cc98f5773deb8a","observation_id":"7b1312c2-f0cf-4141-9fc8-7bf3187c29ff","resolution":{"observed_at":"2026-08-15T17:52:28.887538Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.459980Z","title":"Compressible dynamics in deep overparameterized low-rank learning & adaptation","venue":null,"work_id":"bc975b77-84a0-4259-9a70-468bcb580ed4","year":2024},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.891550Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:129fb8d7376677878393522b01099ff1f2e7690ec55b41f68f0adf01442f870b","observation_id":"b3bd4324-d976-4dff-a08b-e8aa70570f02","resolution":{"observed_at":"2026-08-15T17:52:29.463924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.448587Z","title":null,"venue":null,"work_id":"31524136-d128-4e0c-99c5-c4d196ea87cb","year":2000},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.895102Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:20caa322731f39f2637e322892c106ab75b22d51113f4cac17610b5dd79f8676","observation_id":"c3240c84-a6fd-4550-a8fd-831e7fdd4bf7","resolution":{"observed_at":"2026-08-15T17:52:29.452326Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.436601Z","title":"Difference of convex algorithms for bilevel programs with applications in hyperparameter selection","venue":null,"work_id":"0ce28070-6ca2-4d57-a6da-317bd2a7a6b0","year":2023},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.898819Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:43d779b089a2fdacf7374c0ea3d459af6dc88955a26bb384de0e042f020e37cd","observation_id":"9a2b50aa-701a-4318-9d0d-1528c70c61e9","resolution":{"observed_at":"2026-08-15T17:52:29.440653Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.424591Z","title":"Exact penalization and necessary optimality conditions for generalized bilevel programming problems","venue":null,"work_id":"dd3d288c-f28b-4335-b2bd-fc8f4903d0e9","year":1997},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.902336Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:16f0c776bab24e72796569be858fd414b5a8938e897bb0d2e97e9d0293e9a894","observation_id":"3fba7640-75b0-4d62-81a3-aaa39186dfb8","resolution":{"observed_at":"2026-08-15T17:52:29.428629Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.412430Z","title":"Bome! bilevel optimization made easy: A simple first-order approach","venue":null,"work_id":"a85b9450-c23f-4203-86c5-97e97ef81358","year":2022},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.906168Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:fedde6e50d0cfb9ff456a41d452148f5955cf6977cbf2855da4f7e32e2f623b4","observation_id":"6324f2ae-b565-4349-a0f6-a71ea4dc4599","resolution":{"observed_at":"2026-08-15T17:52:29.416559Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:52:29.399020Z","title":"Bi- level actor-critic for multi-agent coordination","venue":null,"work_id":"73f05fce-d305-44d1-87a3-f0126dd1a823","year":2020},"citing_paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions","version":1},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-15T17:52:28.909710Z"},"links":{"citing_paper":"/paper/2507.20400"},"observation_digest":"sha256:cfc743c5499e52bb02007d5b34bcd2cd82c9ac0b9a5c9638bde457af494bc0a3","observation_id":"14849370-b3a1-4bbd-a9a1-a54fe4ca811d","resolution":{"observed_at":"2026-08-15T17:52:29.403931Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.20400","last_updated":"2025-07-27T19:49:15Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T15:50:54.649295Z","submitted_at":"2025-07-27T19:49:15Z","title":"Beyond Value Functions: Single-Loop Bilevel Optimization under Flatness Conditions"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":53,"verified_exact":2,"verified_fuzzy":45},"total_outbound_references":106},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 100 of 106 outbound references and 0 inbound Pith citation observations for arXiv:2507.20400."}