{"as_of":"2026-08-16T05:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cd93b4970874b4a83ac91e496cb34c2ef8a286e6bc5f3d51070534d9a606754e","coverage":[{"denominator":71,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":71,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T23:47:10.868099Z","state":"measured"},{"denominator":71,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":71,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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/2412.20017/citation-record","integrity":"/paper/2412.20017/integrity","json":"/paper/2412.20017/citation-record.json","paper":"/paper/2412.20017"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:47:11.748011Z","title":"and White, D","venue":null,"work_id":"c010f841-9fd1-4515-8bb2-7cdebece6af7","year":1990},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.604893Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:3254f5f8cbbbacd1010e6454bb6f3ef9d3f6426802961121d9a48987ac2fb34d","observation_id":"39d8cd82-90b7-4c20-804a-1ededd55fb9a","resolution":{"observed_at":"2026-08-10T23:47:11.751907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2111.14580","last_updated":"2022-07-11T14:05:08Z","snapshot_observed_at":"2026-08-14T10:35:18.069849Z","submitted_at":"2021-11-29T15:10:09Z","title":"Amortized Implicit Differentiation for Stochastic Bilevel Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.14580","snapshot_observed_at":"2026-08-10T23:47:10.609623Z","title":"and Mairal, J","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.609623Z"},"links":{"cited_paper":"/paper/2111.14580","citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:012f9974688b36972270eab0a3e45a9d3251a1679ad0536f8f792b51c8f9c88b","observation_id":"436936c3-dbbf-4b13-ae6a-a3c46a8288e4","resolution":{"observed_at":"2026-08-10T23:47:10.609623Z","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-10T23:47:11.737830Z","title":"C., Foster, D","venue":null,"work_id":"649abeaf-2fe2-42ac-8888-82833c683711","year":2023},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.614338Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:d7dd19b04f44c37a7d035911f02699c89de744d8609e77890637d9baa96c54ef","observation_id":"68978532-0a35-4134-b5e0-b5a93b34759d","resolution":{"observed_at":"2026-08-10T23:47:11.741377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1805.08136","last_updated":"2019-07-24T14:43:31Z","snapshot_observed_at":"2026-08-14T19:12:55.572755Z","submitted_at":"2018-05-21T15:44:51Z","title":"Meta-learning with differentiable closed-form solvers","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.08136","snapshot_observed_at":"2026-08-10T23:47:10.618475Z","title":"F., Torr, P","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.618475Z"},"links":{"cited_paper":"/paper/1805.08136","citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:9fb33d9219a65a9411f5de7310452d99fd4aa9ad695e87b496f828a1a1906719","observation_id":"99429103-806c-42ce-a553-16833bf7d35c","resolution":{"observed_at":"2026-08-10T23:47:10.618475Z","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-10T23:47:11.727398Z","title":"Non-stationary stochastic optimization","venue":null,"work_id":"93303ef7-ddfd-4edc-80f2-61bc135d3ec9","year":2015},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.623843Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:d41f1dd54630accbca5357622b5a893adfe24d88b357f6f07f3b01a1c421639c","observation_id":"251e67ec-736d-448f-b16c-8a0e2a6c7077","resolution":{"observed_at":"2026-08-10T23:47:11.731149Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T23:47:11.716748Z","title":"Domain adaptation with structural correspondence learning","venue":null,"work_id":"749eeab3-8316-439d-8185-47c8ba44f964","year":2006},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.627746Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:7441361c9b08b01a28a62b62faf40adf765cf4d67fbca224c20a55a4f1b14b1c","observation_id":"15138857-aa4f-4ca7-94bb-9b50a344defb","resolution":{"observed_at":"2026-08-10T23:47:11.720503Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T23:47:11.705734Z","title":"Coresets via bilevel optimization for continual learning and streaming","venue":null,"work_id":"999d60f3-a099-4048-bb02-84f0faa5ef31","year":2020},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.631829Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:062ac6603999d06741f9f0aa4a57d02b81b27099fbb8cf93961f998c2f355e3b","observation_id":"c43e435d-fd0b-40b1-b4dd-205049e69561","resolution":{"observed_at":"2026-08-10T23:47:11.709849Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1508.05326","last_updated":"2015-08-21T16:17:01Z","snapshot_observed_at":"2026-08-15T14:12:50.248453Z","submitted_at":"2015-08-21T16:17:01Z","title":"A large annotated corpus for learning natural language inference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1508.05326","snapshot_observed_at":"2026-08-10T23:47:10.635322Z","title":"R., Angeli, G., Potts, C., and Manning, C","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.635322Z"},"links":{"cited_paper":"/paper/1508.05326","citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:7b808325feffc71bd40f8874767942a5a8b5b58596001afbed5bc63290607948","observation_id":"e2ba3360-57d2-4995-aa95-1ba801bc3f11","resolution":{"observed_at":"2026-08-10T23:47:10.635322Z","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-10T23:47:11.694777Z","title":"and McGill, J","venue":null,"work_id":"993d1c1d-7d09-4a5a-83b1-5326f8ba86cb","year":1973},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.639199Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:194efd314f35e3b333d3a9b6471601cdd1196389aafef60536774f0863f2dcc3","observation_id":"27bd82ab-9fdc-416f-8870-046f73b3d70f","resolution":{"observed_at":"2026-08-10T23:47:11.698449Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-10T23:47:10.643019Z","title":"On bilevel optimization without lower-level strong convexity","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.643019Z"},"links":{"cited_paper":"/paper/2301.00712","citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:ca67e73c553d303f91a4ffaac68649ef5e0f98d9a58a82d64d817db5eecd4d98","observation_id":"86fb0529-f62d-4007-bcdb-4a98aa911ef9","resolution":{"observed_at":"2026-08-10T23:47:10.643019Z","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-10T23:47:11.683154Z","title":"Closing the gap: Tighter analysis of alternating stochastic gradient methods for bilevel problems","venue":null,"work_id":"6f642036-5929-41d0-b95c-ca13e8a6e1a7","year":2021},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.647104Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:7757ffa6fef7f0a774c12f8c63d847f80a222c80206027f048778d05c9c95a33","observation_id":"0be45962-48b6-4d26-8213-006b2bc0c95c","resolution":{"observed_at":"2026-08-10T23:47:11.687325Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T23:47:11.672043Z","title":"A single-timescale method for stochastic bilevel optimization","venue":null,"work_id":"a08ee52c-edfe-4584-bd1b-bf519c259c8e","year":2022},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.650602Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:935f9c3f7ac3149266e979207bbe6527e454f52691960280f61a45f8887a43b9","observation_id":"500be401-7655-4067-9f61-6b7c759b56a6","resolution":{"observed_at":"2026-08-10T23:47:11.675851Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.12067","last_updated":"2023-06-21T07:32:29Z","snapshot_observed_at":"2026-08-13T11:12:50.583486Z","submitted_at":"2023-06-21T07:32:29Z","title":"Optimal Algorithms for Stochastic Bilevel Optimization under Relaxed Smoothness Conditions","version":1},"cited_work":{"arxiv_id":"2306.12067","doi":null,"metadata_source":"pith","pith_arxiv_id":"2306.12067","snapshot_observed_at":"2026-08-10T23:47:11.168922Z","title":"Optimal Algorithms for Stochastic Bilevel Optimization under Relaxed Smoothness Conditions","venue":"math.OC","work_id":"7dc2f504-533a-4e3d-b11e-943807b666b0","year":2023},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.654282Z"},"links":{"cited_paper":"/paper/2306.12067","citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:af9594088cd6ada55cfa344bac72806ab6ddf622aca2f039542c304416fda3c1","observation_id":"f98a63af-f471-4d09-930a-0248167a420a","resolution":{"observed_at":"2026-08-10T23:47:11.173235Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.02854","last_updated":"2023-06-24T08:44:27Z","snapshot_observed_at":"2026-08-15T21:58:32.544886Z","submitted_at":"2023-03-06T03:15:44Z","title":"Generalized-Smooth Nonconvex Optimization is As Efficient As Smooth Nonconvex Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.02854","snapshot_observed_at":"2026-08-10T23:47:10.658116Z","title":"Generalized-smooth nonconvex optimization is as efficient as smooth nonconvex optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.658116Z"},"links":{"cited_paper":"/paper/2303.02854","citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:c803bc3daa76dbe7f5228e87827d9ad846afe75938a2c5ea98c3de66da9286f2","observation_id":"33714a61-6f59-4ac6-b333-f5bcf0109e93","resolution":{"observed_at":"2026-08-10T23:47:10.658116Z","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-10T23:47:11.661223Z","title":"Robustness to unbounded smoothness of generalized signsgd","venue":null,"work_id":"7c542c72-57e7-483c-a748-67916b40f9b9","year":2022},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.662083Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:1030e17d98d44daf8d1aa47a62596642a838cc143868425e933d6ed9628d61c1","observation_id":"840a0d4e-4b55-4a13-a13f-c21398744a08","resolution":{"observed_at":"2026-08-10T23:47:11.665111Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T23:47:11.650219Z","title":"Episode: Episodic gradient clipping with periodic resampled corrections for federated learning with heterogeneous data","venue":null,"work_id":"88c52e7c-2c98-488c-bc73-45efc7678dbd","year":2023},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.665751Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:5f9181894feeb80202a1fa458b4e23a8bd30d92e7cbc15ac65a1d1e41096beb4","observation_id":"623a7011-9a92-4821-8d0a-f519f2e62aee","resolution":{"observed_at":"2026-08-10T23:47:11.654083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T23:47:11.639152Z","title":"Federated learning with client subsampling, data heterogeneity, and unbounded smoothness: A new algorithm and lower bounds","venue":null,"work_id":"b5e68dd2-ed33-4cd2-b9a9-a4f89a8b4d91","year":2023},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.669440Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:6e8db4058c34759d263103290eff289fb22ee74aa5f0bbc397dfbf9dfd80297f","observation_id":"65a24195-91f5-459d-a5be-8247669a0d08","resolution":{"observed_at":"2026-08-10T23:47:11.643219Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T23:47:11.628103Z","title":"Stochastic optimization under distributional drift","venue":null,"work_id":"e0ea731a-7d82-47c1-a60b-08af2ff233f9","year":2023},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.672979Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:5cde92bb4c124d7c3a850fb4468b7b8d6054bbb9c0c1b4eeeaea0e810df461b4","observation_id":"e0067d73-d2cf-4bb8-8fe1-eb2bfa297848","resolution":{"observed_at":"2026-08-10T23:47:11.632123Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T23:47:11.616200Z","title":"A framework for bilevel optimization that enables stochastic and global variance reduction algorithms","venue":null,"work_id":"831bb482-c36e-47e0-be4b-e0494dd0d959","year":2022},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.676761Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:3b6f3ad633477328e47449255867119437890ce62f8c273ef3a5f8cf04dea97c","observation_id":"91bb31f1-4c02-4ffc-8119-a2bb69d4d023","resolution":{"observed_at":"2026-08-10T23:47:11.620334Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.08766","last_updated":"2024-11-30T09:52:37Z","snapshot_observed_at":"2026-08-14T08:22:36.782538Z","submitted_at":"2023-02-17T09:04:18Z","title":"A Lower Bound and a Near-Optimal Algorithm for Bilevel Empirical Risk Minimization","version":5},"cited_work":{"arxiv_id":"2302.08766","doi":null,"metadata_source":"pith","pith_arxiv_id":"2302.08766","snapshot_observed_at":"2026-08-10T23:47:11.143393Z","title":"A Lower Bound and a Near-Optimal Algorithm for Bilevel Empirical Risk Minimization","venue":"stat.ML","work_id":"85788525-b903-4c60-8e0f-c6155e223df2","year":2023},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.680373Z"},"links":{"cited_paper":"/paper/2302.08766","citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:0368c972988d732b0bb0340943a32dec4671cb380578a7633069b9326cedd68a","observation_id":"cee952f2-cf10-407a-b634-9a96ab5c7a40","resolution":{"observed_at":"2026-08-10T23:47:11.147440Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T23:47:11.604727Z","title":"Saga: A fast incremental gradient method with support for non-strongly convex composite objectives","venue":null,"work_id":"a4d943ef-a376-4172-b07f-c9e3f3552e92","year":2014},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.684215Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:1482fe3bf55aa0990ab78d93359fdfb5483b566619404c964dac702e0449e6e7","observation_id":"af3fb08d-5f53-4b11-8bb7-8dfcb98d4040","resolution":{"observed_at":"2026-08-10T23:47:11.608805Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T23:47:11.593822Z","title":"A dynamic stochastic approximation method","venue":null,"work_id":"a6bf13bb-c461-496c-b5bd-b6d08641677d","year":1965},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.687759Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:c100648f6c49ef4ca436f524c37a321d700b6e10f9644e6929850a1fdc669b26","observation_id":"2c2e3918-a287-40ba-b40d-7dad7b366064","resolution":{"observed_at":"2026-08-10T23:47:11.597669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T23:47:11.582438Z","title":null,"venue":null,"work_id":"b02ebdca-4d6d-4069-b86a-37b0d10643db","year":1990},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.691236Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:301d07cfd0464bb700542b3e7cbfbc4925b8c736c5fc9d09c37dc38888a06e3e","observation_id":"4a99b8ee-d663-4c25-865f-d96d96b3f535","resolution":{"observed_at":"2026-08-10T23:47:11.586184Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.06570","last_updated":"2023-02-13T18:13:36Z","snapshot_observed_at":"2026-08-14T09:25:05.721029Z","submitted_at":"2023-02-13T18:13:36Z","title":"Beyond Uniform Smoothness: A Stopped Analysis of Adaptive SGD","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.06570","snapshot_observed_at":"2026-08-10T23:47:10.694646Z","title":"Beyond uniform smoothness: A stopped analysis of adaptive sgd","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.694646Z"},"links":{"cited_paper":"/paper/2302.06570","citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:9e08439161f37d1225e99bc4f4f54c5c941a5d3b0c11af131e15b654892dd727","observation_id":"dd97dcf3-2545-4766-ae59-77077db04a07","resolution":{"observed_at":"2026-08-10T23:47:10.694646Z","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-10T23:47:11.571402Z","title":"and Hutter, F","venue":null,"work_id":"b091756c-a8f5-4f40-b7ea-074fe9221a13","year":2019},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.698195Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:dc70ef9180394571d2cee0eeb73865ec5e11c935bb1ab52cd2ab06f4bd1e55b8","observation_id":"0c02f03d-e851-4c6a-ab4e-b10c46076e3f","resolution":{"observed_at":"2026-08-10T23:47:11.575128Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T23:47:10.701670Z","title":"Model-agnostic meta-learning for fast adaptation of deep networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.701670Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:542a412b2e901894bfd810577746d83970f831b7a1548db03caf6b9eb9953c20","observation_id":"6eb96521-33e6-4215-88ab-b3cd293b79db","resolution":{"observed_at":"2026-08-10T23:47:10.701670Z","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-10T23:47:11.553436Z","title":"Bilevel programming for hyperparameter optimization and meta-learning","venue":null,"work_id":"5a6cdc12-7160-4d64-9b32-515a8bd590a8","year":2018},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.705225Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:2c5749c053528bae743b4161f0f273b04eb98996333354a62a122a9b7fd593ce","observation_id":"1c22645b-59eb-432c-a514-486129ecb764","resolution":{"observed_at":"2026-08-10T23:47:11.557321Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T23:47:11.542200Z","title":"and Lan, G","venue":null,"work_id":"c2384b04-469f-44ff-a08d-5a45685bbc12","year":2013},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.708586Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:dd817bd70bd765eb52f3563729962b8ec662b904c975a9141e9c433e60d4823c","observation_id":"b2e84e75-97b3-4bdd-a50c-84c152684afb","resolution":{"observed_at":"2026-08-10T23:47:11.546071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T23:47:11.529728Z","title":"and Lan, G","venue":null,"work_id":"027a05a7-7f2a-4ce0-baad-feeb39d0638c","year":2013},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.712046Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:7e5f9564cc94ebcb91b4c5376d9d80f31eca5a697288b21c49e719ab5ec4a7ae","observation_id":"11c8c00c-7eb2-4121-b4d9-772945342bf7","resolution":{"observed_at":"2026-08-10T23:47:11.534018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1802.02246","last_updated":"2018-02-06T22:10:14Z","snapshot_observed_at":"2026-08-14T19:48:10.374742Z","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-10T23:47:10.715432Z","title":"and Wang, M","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.715432Z"},"links":{"cited_paper":"/paper/1802.02246","citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:2d87f06aa99ab49280c5781231d3b19cb1055a52f124db3407de4b63bbeeb9c8","observation_id":"c99efe61-e43d-400e-8c80-cc5bd32c0234","resolution":{"observed_at":"2026-08-10T23:47:10.715432Z","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-10T23:47:11.517598Z","title":"Twitter sentiment classification using distant supervision","venue":null,"work_id":"e825c099-63af-4efe-a9cb-6301dc63f58c","year":2009},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.719073Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:ab234b303bc344b34fdbb1064f253d5aec89f5c1e710ebae77974b2c28aa422c","observation_id":"b00342f3-95e4-4fd5-a19d-5e1c461ccc17","resolution":{"observed_at":"2026-08-10T23:47:11.521750Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.03397","last_updated":"2023-11-16T11:13:55Z","snapshot_observed_at":"2026-08-13T16:45:22.260914Z","submitted_at":"2022-02-07T18:35:46Z","title":"Bilevel Optimization with a Lower-level Contraction: Optimal Sample Complexity without Warm-start","version":4},"cited_work":{"arxiv_id":"2202.03397","doi":null,"metadata_source":"pith","pith_arxiv_id":"2202.03397","snapshot_observed_at":"2026-08-10T23:47:11.107247Z","title":"Bilevel Optimization with a Lower-level Contraction: Optimal Sample Complexity without Warm-start","venue":"stat.ML","work_id":"22ed248b-05d5-42cc-b73c-e1bdee06cfa7","year":2022},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.722450Z"},"links":{"cited_paper":"/paper/2202.03397","citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:b871969906fe1ef1245e86f12b2f99e649cdb22d499ccf5592034f473805d0c6","observation_id":"bbbc0fe6-14a1-4ad5-9ba2-285e7ddd109f","resolution":{"observed_at":"2026-08-10T23:47:11.111691Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T23:47:11.506201Z","title":"and Ljung, L","venue":null,"work_id":"f040becf-5d10-491d-a48f-44fe8997fc7d","year":1995},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.726033Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:797f45167d0a0e778fcbe649805f6a4d461cca0542ece04277a6186dc89026c7","observation_id":"f89694f6-0f90-4311-a756-5fdce53067c0","resolution":{"observed_at":"2026-08-10T23:47:11.510063Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.02266","last_updated":"2021-06-14T06:45:58Z","snapshot_observed_at":"2026-08-10T14:32:48.451596Z","submitted_at":"2021-05-05T18:28:42Z","title":"Randomized Stochastic Variance-Reduced Methods for Multi-Task Stochastic Bilevel Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.02266","snapshot_observed_at":"2026-08-10T23:47:10.729295Z","title":"Randomized stochastic variance-reduced methods for multi-task stochastic bilevel optimization","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.729295Z"},"links":{"cited_paper":"/paper/2105.02266","citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:dbdd90cff3ca168a1f369859c709c2c60a05a5d703625b1372f31e00d58929f6","observation_id":"0f0a2cea-09b5-4ed4-9d06-f072013a3e65","resolution":{"observed_at":"2026-08-10T23:47:10.729295Z","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-10T23:47:11.494980Z","title":"Bilevel coreset selection in continual learning: A new formulation and algorithm","venue":null,"work_id":"cfa685c5-f5eb-4ec8-a0a5-fc5253d8d09c","year":2023},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.733230Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:00fa901d62d580a8c3f455a1126d04be7d824b02ef3abd7027c888318a804cda","observation_id":"ad7d101c-c63f-4f03-a431-301ba520e786","resolution":{"observed_at":"2026-08-10T23:47:11.498855Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T23:47:11.483497Z","title":"Bilevel optimization under unbounded smoothness: A new algorithm and convergence analysis","venue":null,"work_id":"ea3eab01-5cca-47f6-947d-57807c7546f6","year":2024},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.736609Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:ac67cfc81f9bf9e411b35e368afbfc5893124e818247f91f4d9894504938e6cd","observation_id":"6d343acb-b33b-4021-804b-074b3f4d06e6","resolution":{"observed_at":"2026-08-10T23:47:11.487707Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T23:47:11.471419Z","title":"and Kale, S","venue":null,"work_id":"4a75067c-6f16-47d9-8741-c9c7f431f64b","year":2014},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.740148Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:c59df225f82978e3346022346a3cedb14b68c1bc3c7efdca9a827d0abbbdc9e1","observation_id":"c5405507-0147-4f22-a222-bef7872ef094","resolution":{"observed_at":"2026-08-10T23:47:11.475789Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1507.02030","last_updated":"2015-10-28T07:00:56Z","snapshot_observed_at":"2026-08-14T22:41:20.610434Z","submitted_at":"2015-07-08T05:47:42Z","title":"Beyond Convexity: Stochastic Quasi-Convex Optimization","version":3},"cited_work":{"arxiv_id":"1507.02030","doi":null,"metadata_source":"pith","pith_arxiv_id":"1507.02030","snapshot_observed_at":"2026-08-10T23:47:11.080952Z","title":"Beyond Convexity: Stochastic Quasi-Convex Optimization","venue":"cs.LG","work_id":"ce0180fa-b408-4770-b439-73e9d0909abe","year":2015},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.743637Z"},"links":{"cited_paper":"/paper/1507.02030","citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:76f4674d1eb5777d4ed53cc67865660195cdb917216d12a00ff1ef9d0a63b584","observation_id":"fb39af5f-5629-4dc9-8783-7ca681a2f954","resolution":{"observed_at":"2026-08-10T23:47:11.085220Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T23:47:10.747456Z","title":"and Schmidhuber, J","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.747456Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:1bc6ed5b58bede970b1c85dca8f811880004d677cd6bd15a47e86a363d4ba961","observation_id":"29510cdc-d164-4c1f-95d3-5d69673049c4","resolution":{"observed_at":"2026-08-10T23:47:10.747456Z","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-10T23:47:10.751034Z","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":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.751034Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:47d0b0a86834551addef0ae8c53fa80897b3f22f1bc6659e10c740d30cdb31d9","observation_id":"430b69df-3d27-4fa9-9b62-7b419d616748","resolution":{"observed_at":"2026-08-10T23:47:10.751034Z","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-10T23:47:10.754416Z","title":"Bilevel optimization: Convergence analysis and enhanced design","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.754416Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:2616e42f23a024833ed6ce30afca6df6820dbf9411828599b30430dfb906e6d0","observation_id":"9b062c98-31ac-404b-b4a2-01dcdfd32350","resolution":{"observed_at":"2026-08-10T23:47:10.754416Z","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-10T23:47:11.441598Z","title":"Non-convex distributionally robust optimization: Non-asymptotic analysis","venue":null,"work_id":"bd90a912-9b0a-4888-9ae5-700ba51f1b81","year":2021},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.757942Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:644c9e4e0b6cb8dedf3332a2005e400223ca2632180c41eade4968d64492518a","observation_id":"ce325441-ab0d-4eb5-93c3-2b6abc00bfdf","resolution":{"observed_at":"2026-08-10T23:47:11.445424Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T23:47:11.430569Z","title":"A near-optimal algorithm for stochastic bilevel optimization via double-momentum","venue":null,"work_id":"4a9b220e-e7fe-4c15-9a48-a4c7b9a8d75c","year":2021},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.761710Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:927ef71ad0ce8c71572962aeb08f05f0fc888c36e18403ec8992c9c548f050cd","observation_id":"3dc3eec8-5fe6-4651-a626-f39da6b8010d","resolution":{"observed_at":"2026-08-10T23:47:11.434361Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T23:47:10.764926Z","title":"and Tsitsiklis, J","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.764926Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:e498b8e8cabc0b49e292b1efece818c6335ccc2ede59a2cd7ac1ab86fb2805a2","observation_id":"94b3b107-06cb-442e-9c7e-7768d31f3d98","resolution":{"observed_at":"2026-08-10T23:47:10.764926Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.01753","last_updated":"2024-02-11T08:10:01Z","snapshot_observed_at":"2026-08-13T10:20:37.324747Z","submitted_at":"2023-09-04T18:25:43Z","title":"On Penalty Methods for Nonconvex Bilevel Optimization and First-Order Stochastic Approximation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.01753","snapshot_observed_at":"2026-08-10T23:47:10.768370Z","title":"On penalty methods for nonconvex bilevel optimization and first-order stochastic approximation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.768370Z"},"links":{"cited_paper":"/paper/2309.01753","citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:85dc5dbd5d29d27ea2b1bacee0f560f7ca3d9c28598fcde0b918045a28051f9a","observation_id":"39c9b54b-6224-4cff-a86a-d5c8a4ef40a8","resolution":{"observed_at":"2026-08-10T23:47:10.768370Z","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-10T23:47:11.413433Z","title":null,"venue":null,"work_id":"d74542d0-2d3a-4f97-a9c9-7bcde3b80541","year":2023},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.772217Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:4aadfdb52eada49e28d048d2388b60588399ad19c04a69ed42d84b6155fff5fd","observation_id":"ef2fee26-11fe-4f14-8c5d-e03f0f4f96c3","resolution":{"observed_at":"2026-08-10T23:47:11.417181Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T23:47:11.401565Z","title":"An optimal method for stochastic composite optimization","venue":null,"work_id":"20f25f3a-5718-4c0c-818c-5d7cd1abe4a5","year":2012},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.775557Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:a7dd7f653f531342e9cf56167173082344d96609a69add1dfd17f9f8531f5a21","observation_id":"137b0cd6-017b-41c3-8b18-926b3c30707d","resolution":{"observed_at":"2026-08-10T23:47:11.405723Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.13972","last_updated":"2023-11-07T03:12:49Z","snapshot_observed_at":"2026-08-13T11:54:16.680219Z","submitted_at":"2023-04-27T06:27:37Z","title":"Convergence of Adam Under Relaxed Assumptions","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.13972","snapshot_observed_at":"2026-08-10T23:47:10.779023Z","title":"Convergence of adam under relaxed assumptions","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.779023Z"},"links":{"cited_paper":"/paper/2304.13972","citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:f8f3287a06aec820825a62a32be296033d997129757ff7aa5909bed734affc0a","observation_id":"8bfa074b-6e96-446a-ad10-df7949c4ea0a","resolution":{"observed_at":"2026-08-10T23:47:10.779023Z","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-10T23:47:11.389558Z","title":"Bome! bilevel optimization made easy: A simple first-order approach","venue":null,"work_id":"261741a8-ee97-4300-9be0-7e907cc10b01","year":2022},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.782704Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:37e4ab298203f2b7ba35aba3e58e1ec6aeaaef9699ad3f83640691a5cf93517c","observation_id":"eb2b473b-7bb4-497b-a8b5-1b9675aa482e","resolution":{"observed_at":"2026-08-10T23:47:11.393569Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T23:47:11.378052Z","title":"A communication-efficient distributed gradient clipping algorithm for training deep neural networks","venue":null,"work_id":"1277e7c7-e11f-40e3-8561-b91bfe5446fe","year":2022},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.786275Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:7fd01d8b71771e2de8a357c1b5863da81310718a53381b5a3cebb8cbbd4dd340","observation_id":"bc2fa080-7e33-4160-ac41-6cbd81a6c627","resolution":{"observed_at":"2026-08-10T23:47:11.382141Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T23:47:11.365961Z","title":"A generic first-order algorithmic framework for bi-level programming beyond lower-level singleton","venue":null,"work_id":"cba1d88d-1d66-48b4-b0f5-0286d6ee4412","year":2020},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.790105Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:3610837c13a21374116be8154d1ceab9dd3b5992bcb1cf41faec01756cf48616","observation_id":"6db0a183-4cbf-4013-82fa-d2d3b7e88f64","resolution":{"observed_at":"2026-08-10T23:47:11.370407Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2302.0603","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T23:47:11.042278Z","title":"Near-optimal non-convex stochastic optimization under generalized smoothness","venue":null,"work_id":"297a27a2-590d-424c-b5d0-24622b285d8c","year":2023},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.793778Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:94cf54c4ada68044e6d0a577f556c20899521b6bd6a6da8429d3320d3db72e79","observation_id":"4addc459-d9a4-4562-94ea-a62fcf8386fc","resolution":{"observed_at":"2026-08-10T23:47:11.050135Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T23:47:11.354449Z","title":"Bounds for the tracking error of first-order online optimization methods","venue":null,"work_id":"63be1bd4-6428-426a-b927-8f92e57ddc25","year":2021},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.797610Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:5962b2fd78ee22c30bf164f47997849f1766a41354632a53b83b2b78ad637bca","observation_id":"e96d37ef-2a24-4fec-877c-1ad5456b05b0","resolution":{"observed_at":"2026-08-10T23:47:11.358528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1909.09157","last_updated":"2020-02-12T15:29:39Z","snapshot_observed_at":"2026-08-09T17:12:58.580827Z","submitted_at":"2019-09-19T16:30:42Z","title":"Rapid Learning or Feature Reuse? Towards Understanding the Effectiveness of MAML","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1909.09157","snapshot_observed_at":"2026-08-10T23:47:10.801115Z","title":"Rapid learning or feature reuse? towards understanding the effectiveness of maml","venue":null,"work_id":null,"year":1909},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.801115Z"},"links":{"cited_paper":"/paper/1909.09157","citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:d239184f774cb85e2b76af10a2e0c6f8229eb0f119dcc452321252e89b41b443","observation_id":"b43d2154-7fa7-40a2-9fb4-54b8632ca427","resolution":{"observed_at":"2026-08-10T23:47:10.801115Z","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-10T23:47:11.343025Z","title":"M., and Levine, S","venue":null,"work_id":"f5b725dd-9352-44c4-b017-d1cec5b885b4","year":2019},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.804976Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:925ac7ef717ad525262e862af7dc27f8724c06c8f4754d8ad9adc0f59b350a27","observation_id":"cd3430b0-326a-46c7-b797-ef844c4ba39a","resolution":{"observed_at":"2026-08-10T23:47:11.346957Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.00883","last_updated":"2023-06-02T23:35:16Z","snapshot_observed_at":"2026-08-13T12:33:56.488430Z","submitted_at":"2023-03-02T00:57:38Z","title":"Variance-reduced Clipping for Non-convex Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.00883","snapshot_observed_at":"2026-08-10T23:47:10.809251Z","title":"Variance-reduced clipping for non-convex optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.809251Z"},"links":{"cited_paper":"/paper/2303.00883","citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:5b037d47316dd144dd1eeec45740a7f236d0d7b30c3cc89665cfc4b26d8147f4","observation_id":"de1156d2-aaa9-4398-8000-fffb2616a6fa","resolution":{"observed_at":"2026-08-10T23:47:10.809251Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.01696","last_updated":"2021-06-02T14:55:19Z","snapshot_observed_at":"2026-08-10T04:49:36.145417Z","submitted_at":"2020-12-03T04:36:04Z","title":"FairBatch: Batch Selection for Model Fairness","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.01696","snapshot_observed_at":"2026-08-10T23:47:10.813074Z","title":"E., and Suh, C","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.813074Z"},"links":{"cited_paper":"/paper/2012.01696","citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:b5b7ab096cbd72d2abe0bce92f8200035f7f1830aaac144e978bdca2f9f7448a","observation_id":"9f9a49b5-86cb-4f2f-a3f2-f75c3207381e","resolution":{"observed_at":"2026-08-10T23:47:10.813074Z","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-10T23:47:10.816868Z","title":"and Shtern, S","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.816868Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:3659775e08d68e338d18da205754bb90abb44023ec436f719aa4d0a1ba106b1d","observation_id":"f35c8cfe-ce7e-465b-9ace-31af41086a24","resolution":{"observed_at":"2026-08-10T23:47:10.816868Z","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-10T23:47:11.324357Z","title":"Truncated back-propagation for bilevel optimization","venue":null,"work_id":"ef1f6390-9b4b-450c-96a6-da3f2d48bfb7","year":2019},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.820455Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:c5a5e817dad6ebb477f950dcf5e9a4b6548ce7467bad4f250acf9e16a50379ad","observation_id":"64836122-9904-49b3-b6bd-97399f9e058e","resolution":{"observed_at":"2026-08-10T23:47:11.328295Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.05185","last_updated":"2025-01-06T22:56:30Z","snapshot_observed_at":"2026-08-13T12:47:28.742031Z","submitted_at":"2023-02-10T11:30:19Z","title":"On Penalty-based Bilevel Gradient Descent Method","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.05185","snapshot_observed_at":"2026-08-10T23:47:10.823915Z","title":"and Chen, T","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.823915Z"},"links":{"cited_paper":"/paper/2302.05185","citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:5a78ef819c9c02fd0dca2b11426d15a18680ec75e8273d2f05d6a77cb15a427e","observation_id":"5ff2b83e-b023-4882-9e06-717e4e5ff6f7","resolution":{"observed_at":"2026-08-10T23:47:10.823915Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.01123","last_updated":"2022-06-08T16:36:24Z","snapshot_observed_at":"2026-08-13T16:31:58.636451Z","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-10T23:47:10.827867Z","title":"A constrained optimization approach to bilevel optimization with multiple inner minima","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.827867Z"},"links":{"cited_paper":"/paper/2203.01123","citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:14236c8ecc742ca1362518d75e3e053c6b4e606822f057d5ef074caf3fc4b031","observation_id":"8319e4b6-433b-421a-a2f0-b416d43835fc","resolution":{"observed_at":"2026-08-10T23:47:10.827867Z","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-10T23:47:10.831662Z","title":"N., Kaiser, ., and Polosukhin, I","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.831662Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:bb441c869295f3d866bb0f7e733816ef4b18e3722e2cfe2a0e7263b34823527f","observation_id":"112082e4-c8ca-4972-93cf-84e6e007f58c","resolution":{"observed_at":"2026-08-10T23:47:10.831662Z","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-10T23:47:11.305503Z","title":"Descent approaches for quadratic bilevel programming","venue":null,"work_id":"55f2325f-a22e-45a5-a2f4-61775d120dcb","year":1994},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.835278Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:3567d7f35fd7890e6731f377eadf7d7374fa8a5a121a330e1847b1d799911eaf","observation_id":"e2f687a1-af2f-43d9-aede-f452486e4436","resolution":{"observed_at":"2026-08-10T23:47:11.309577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T23:47:11.294500Z","title":"Convergence of adagrad for non-convex objectives: Simple proofs and relaxed assumptions","venue":null,"work_id":"44d1b2a0-9f1e-43bc-a972-3634cd8bd9e6","year":2023},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.838980Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:f12d6a616db856c3087def1fab51e6543cb1d7398dde2b12e5a48169eed1ebaa","observation_id":"2773af33-12bc-452b-93d2-168d1d5628ca","resolution":{"observed_at":"2026-08-10T23:47:11.298580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T23:47:11.283238Z","title":null,"venue":null,"work_id":"b96fd771-d08d-43f4-bc24-61f441d86e53","year":1993},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.842619Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:a8d84f87f35c5d2aacb4af428178dea8c165048d415860633d6f0d807370ed19","observation_id":"cc86e127-e07a-4961-b210-9c01a08ea885","resolution":{"observed_at":"2026-08-10T23:47:11.287481Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T23:47:11.271371Z","title":"V., and Nedi \\'c , A","venue":null,"work_id":"e420953b-5ed4-4d0b-aeac-3068fb1dcb55","year":2018},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.846391Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:deeeda6a9ee6459958c29316a07b6db0b49198768d89abf362da7349edb0438b","observation_id":"55106a54-226c-42ba-8776-8bde183ba9f9","resolution":{"observed_at":"2026-08-10T23:47:11.275256Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T23:47:11.260679Z","title":"Provably faster algorithms for bilevel optimization","venue":null,"work_id":"230a4354-efa4-4153-a1a9-bece0af9b283","year":2021},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.852778Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:8c466b467f86fe159f912e03b4106b84e45d92a731537885249edb3d467cbf5a","observation_id":"afba0bb7-ba2d-4c71-96b5-27c3093034a2","resolution":{"observed_at":"2026-08-10T23:47:11.264370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T23:47:11.248883Z","title":"Improved analysis of clipping algorithms for non-convex optimization","venue":null,"work_id":"3202668f-78bc-4ae8-9bf6-2045e0d231eb","year":2020},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.856921Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:5f5c3e3aae31c59841327368cdb86e8329737910ced13ca668aaeccd3c5d7985","observation_id":"7010682d-7dad-4754-98e9-d4599124eeec","resolution":{"observed_at":"2026-08-10T23:47:11.252747Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T23:47:11.237860Z","title":"Why gradient clipping accelerates training: A theoretical justification for adaptivity","venue":null,"work_id":"ef3b2ee6-b3b3-4a0c-a6d9-cc81b5f471f7","year":2020},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.860782Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:b0711ed8e4241ebe0e1b646911a9df4ab60dea54ed8a4b59d28b29c06f9f07e3","observation_id":"5c584941-691f-4b3f-a17b-b0a144958260","resolution":{"observed_at":"2026-08-10T23:47:11.241767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T23:47:11.226348Z","title":"Why gradient clipping accelerates training: A theoretical justification for adaptivity","venue":null,"work_id":"29da6433-9fa2-43d0-b49b-e206fd7662f8","year":2020},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.864331Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:630b7dbb1e6f0df53b2a086126a3ff11c85594e0be86ce3976b4cdb6847e9c68","observation_id":"a822cb80-6f6c-40d3-ab5b-b7fe8a872d88","resolution":{"observed_at":"2026-08-10T23:47:11.230572Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T23:47:10.868099Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-10T23:47:10.868099Z"},"links":{"citing_paper":"/paper/2412.20017"},"observation_digest":"sha256:ab1a2e1033fb2dd41196a797aa6b0fc6b9f0b8f9737fd7138ab41221f33cab7b","observation_id":"d05d17d9-2be7-4806-ac37-5712e24f4be6","resolution":{"observed_at":"2026-08-10T23:47:10.868099Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.20017","last_updated":"2024-12-28T04:40:27Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T05:42:20.712957Z","submitted_at":"2024-12-28T04:40:27Z","title":"A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness"},"reference_resolution":{"displayed":71,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":26,"verified_exact":4,"verified_fuzzy":40},"total_outbound_references":71},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 71 of 71 outbound references and 0 inbound Pith citation observations for arXiv:2412.20017."}