{"as_of":"2026-08-22T10:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a652f31ee343e88ea932f90deecce9ce7e34079b6c4fd0ed86a82998d987c02a","coverage":[{"denominator":48,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":48,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T08:04:14.297636Z","state":"measured"},{"denominator":48,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":48,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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/2607.10957/citation-record","integrity":"/paper/2607.10957/integrity","json":"/paper/2607.10957/citation-record.json","paper":"/paper/2607.10957"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T08:04:14.297636Z","title":"Optimality conditions for a simple convex bilevel programming problem.Variational Analysis and Generalized Differentiation in Optimization and Control: In Honor of Boris S","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:c05ab99e918a5a92d66e7f085d3addb1bf7d126ea58d7257ecffd2e15b38f984","observation_id":"702fc44b-6cf3-4448-91b5-15d2b1b9eb7f","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":"Algorithmsforsimplebilevelprogramming","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:235d60829f6c61f024330ff7c2cc7602cf2dab07f6ffbaf63264a5cdf23ff3e3","observation_id":"44c48cbe-a0bc-4fae-9415-182df8226f52","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":"A conditional gradient-based method for simple bilevel optimization with convex lower-level problem","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:f53be0485c1fcfe86a701577e0ca67f397b804543c8c521c650cf92489624f3c","observation_id":"3425e1d6-e310-4f84-b4d8-e6c5f3445dd7","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":"An accelerated gradient method for convex smooth simple bilevel optimization.Advances in Neural Information Processing Systems, 37:45126–45154, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:c570458bfc4c935ceba42c26c0195226c57a2bda6472476df13a52e821dce808","observation_id":"86fd52a4-0298-4593-b2db-12a6c04e5ed0","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":"Coresets via bilevel optimization for continual learning and streaming.Advances in Neural Information Processing Systems, 33:14879–14890, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:d43245719b3c4124f638fdf762666972d98763629acf8a778f21ef159939a80e","observation_id":"20bce4cf-cba3-48b8-8725-cca806407661","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":"Bilevel coreset selection in continual learning: A new formulation and algorithm.Advances in Neural Information Processing Systems, 36:51026–51049, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:4336d0439c03965823acd42abfe6039276554369432e319899b150d279000e93","observation_id":"8c258e3c-37fb-4cd5-80be-7615c6349d21","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":"Bilevel programming for hyperparameter optimization and meta-learning","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:a47664f54c689288466b7462e985787ee30921d6930432718d1f184eea693d7e","observation_id":"c0ed2c7f-b991-4713-8d05-b344c4964b1b","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":"Truncated back-propagation for bilevel optimization","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:d3deb92668145176213adc93edf96e886e09ab7c16373bf6ca79acee171a2edb","observation_id":"7dce515d-6cfc-44ba-8650-b59d3b0035d8","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":"Meta-learning with implicit gradients.Advances in neural information processing systems, 32, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:bee4003289c9138679715171535e69b36ca8cdb44708e808a80181d106841a00","observation_id":"c4d286e9-bdd2-4990-915c-20eb427ae9b8","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1805.08136","last_updated":"2019-07-24T14:43:31Z","snapshot_observed_at":"2026-08-17T12:50:40.559528Z","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-07-14T08:04:14.297636Z","title":"Meta-learning with differentiable closed-form solvers.arXiv preprint arXiv:1805.08136, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"cited_paper":"/paper/1805.08136","citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:f18ce2dab87ae88c0898066a04088f7192b0bcdd581efe7cbe73f8b9491e7763","observation_id":"f5eac077-f7a6-480d-9363-5ce14931ea6f","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":"A two-timescale stochastic algorithm framework for bilevel optimization: Complexity analysis and application to actor-critic.SIAM Journal on Optimization, 33(1):147–180, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:f9751851f0642e14590f48443cfbbe9e702c6539cbe39c592c453f2fd01d1070","observation_id":"93e3a7ff-9018-4275-9469-78cd45694afb","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":"Bi-level actor-critic for multi-agent coordination","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:932367487b09593c3979d0ee8e279b4911502b05456595bab950b497a3b10a86","observation_id":"dacf2ccc-6861-45cb-9b78-c2181f8afda9","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":"Remember what you want to forget: Algorithms for machine unlearning.Advances in Neural Information Processing Systems, 34:18075–18086, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:7f031d515f288f4698cf305044b5be14ec6bc42a1ed66a3a278296d5309cb434","observation_id":"c61fd90f-f88c-4f20-9c85-3ec9c858e945","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":"Towards safer large language models through machine unlearning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:bf6f8f757801a685d86b550cb3a5769f98af88af9a4406720a62de190aa8ae10","observation_id":"ae3dacd5-7d83-4b5f-a941-e6289d254aa3","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":"Blur: A bi-level optimization approach for llm unlearning","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:43702fbdc559de7e8b873da488b15eee9c9475ef9adc4489bd92b7db49f62294","observation_id":"bda87cd9-20c5-4cb1-89ea-3047362292f7","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":"New York: Wiley, 1977","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:d51de4041b15e4b96dde497dd640e99a82a5c0ddc5474eeca803f6547ce3ee7b","observation_id":"6e84ff5c-07f9-4b51-bc55-e0379b44fe28","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":"An explicit descent method for bilevel convex optimization.Journal of Convex Analysis, 14(2):227, 2007","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:96b68c15e36e2d939a48969c126e6c52af26b86cc97da0f16c3d768669ef4bf4","observation_id":"24b2a476-e92b-4478-b3e9-213f72666aa0","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":"On the complexity of finding first-order critical points in constrained nonlinear optimization.Mathematical Programming, 144(1):93–106, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:5aa0d099f6533bb4c879ee923ed2ca03b0d56ca99e7af7078f7f6e45dbf8941a","observation_id":"aa7587ca-3ab9-43b2-a9e3-a0ea3a9fa5f1","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":"Ghost penalties in nonconvex constrained optimization: Diminishing stepsizes and iteration complexity.Mathematics of Operations Research, 46(2):595–627, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:eb7f76dbe2b90fa28e4916b01a72e3ff7c9fd46539892f2c727aa3efc6c9856c","observation_id":"48d856e2-7a8f-4813-b96e-c13a7971aa0f","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":"Bi-objective trade-off with dynamic barrier gradient descent.NeurIPS 2021, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:04cb931ba8c6d21a79520113889561a4f415abc10f670758471835753eb8978d","observation_id":"ec433fbb-7bf9-4ddf-892d-50ee002a8a9c","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.23155","last_updated":"2025-07-30T23:10:29Z","snapshot_observed_at":"2026-08-16T03:56:44.204953Z","submitted_at":"2025-07-30T23:10:29Z","title":"On the Complexity of Finding Stationary Points in Nonconvex Simple Bilevel Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.23155","snapshot_observed_at":"2026-07-14T08:04:14.297636Z","title":"On the complexity of finding stationary points in nonconvex simple bilevel optimization.arXiv preprint arXiv:2507.23155, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"cited_paper":"/paper/2507.23155","citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:2f1da4adca62b9115306ea67a0fa9f1aabb37e8474138a7bb0971bacf629a207","observation_id":"410db751-8297-4be2-827c-5a612321a0bb","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.02998","last_updated":"2025-03-06T08:57:29Z","snapshot_observed_at":"2026-08-16T14:21:26.739153Z","submitted_at":"2024-02-05T13:37:00Z","title":"Careful with that Scalpel: Improving Gradient Surgery with an EMA","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.02998","snapshot_observed_at":"2026-07-14T08:04:14.297636Z","title":"Careful with that scalpel: improving gradient surgery with an ema.arXiv preprint arXiv:2402.02998, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"cited_paper":"/paper/2402.02998","citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:8e3663fd0f273f58d5b0d6f0340601cb8c3c47d3982c19fbb7bc0f84fe0e0c7c","observation_id":"09e52c3b-c729-455b-8a54-ef285e99e751","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":"Projection-free methods for stochastic simple bilevel optimization with convex lower-level problem","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:0f693fad945f0323ff30fa5b24f941bec2b183ac5f9abb3d3c4826a7038cc88a","observation_id":"74c15b88-556e-4af6-bca9-318275654305","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":"Conditional gradient methods with standard lmo for stochastic simple bilevel optimization.arXiv preprint arXiv:2505.18037, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:bea3505609d13b1a594cf7e197acc9b714063bae886fd3e20fe782cdb99ff828","observation_id":"8a0273ee-7eb9-422f-bb58-ffc64170126a","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":"Stochastic approximation for estimating the price of stability in stochastic nash games.ACM Transactions on Modeling and Computer Simulation, 34(2):1–24, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:c350bd82bbcb691249e4ec5620715a4f90b6baf550608d0e62607b3ba2a783db","observation_id":"cbcd09fa-8e68-4c51-9997-f8baa28c6b80","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":"Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization.Mathematical Programming, 161(1): 611–626, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:b8b6a346703caf2ca3baeb4fc53493e7e43405d9f972913604cabf72c8b9cba5","observation_id":"7731a453-8f23-46ca-abeb-5ccb333d3a97","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":"Evaluation complexity bounds for smooth constrained nonlinear optimization using scaled kkt conditions and high-order models","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:a8644147ee71a639f0cbe1cd8d7f299e877c98c461ef57da0ac1470b2b89263b","observation_id":"2539968d-05ce-44d5-aca6-be4246d924cf","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":"Evaluation complexity for nonlinear constrained optimization using unscaled kkt conditions and high-order models","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:83bddd1f964ea18f1d912fb6a0117574d10e6ce7701d7d06a9e9bb70b16b8789","observation_id":"eded7046-181c-4e91-8667-60da93c6ea31","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.11518","last_updated":"2020-12-01T14:23:29Z","snapshot_observed_at":"2026-08-17T20:01:19.175582Z","submitted_at":"2019-08-30T03:33:53Z","title":"Inexact Proximal-Point Penalty Methods for Constrained Non-Convex Optimization","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.11518","snapshot_observed_at":"2026-07-14T08:04:14.297636Z","title":"Inexact proximal-point penalty methods for constrained non-convex optimization.arXiv preprint arXiv:1908.11518, 2019","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"cited_paper":"/paper/1908.11518","citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:af2bc0c0e7c103a33a6da3bcefa8020e5033d651656095d7029683d2270fdec3","observation_id":"78c9de08-f632-4306-a427-7728ee7ae0a6","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":"Stochastic first-order methods for convex and nonconvex functional constrained optimization.Mathematical Programming, 197(1):215–279, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:1188aa203dd1db43308a3ab0000cdace5a47b7f84f65434ed245f34661630c51","observation_id":"92878885-bbe3-4a8c-83a9-b7fbc0067055","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":"A momentum-based linearized augmented lagrangian method for nonconvex constrained stochastic optimization.Mathematics of Operations Research, 51(1):92–133, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:798c0c8d59e8ab259880d19fa729d6e42d5b0237884eda8310faae4e8e684464","observation_id":"15f626aa-1469-4af1-bcf5-53f3791541b1","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":"Stochastic compositional optimization with compositional constraints.INFORMS Journal on Optimization, 8(1):1–21, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:d59ff8c6ddb8f0f3162236aabe1b9e2b585665368d4ae14caf5252fa6da29ad6","observation_id":"98ec5e58-0bcf-40ef-8012-f3872cd683e4","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":"Sequential quadratic optimization for solving expectation equality constrained stochastic optimization problems.arXiv preprint arXiv:2503.09490, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:5cdf6372fafad97f84f63e9e01acb1650aba84f0303a44ff1ab29a7ca4f4072b","observation_id":"224f76e9-6a0b-4b49-bd92-1e1313f973bb","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":"A two-phase stochastic momentum-based algorithm for nonconvex expectation-constrained optimization.Journal of Scientific Computing, 104(1):16, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:4a45f3732cbe4516aef8a918ce8e464285521c2943e3f995bde307d52a1a7618","observation_id":"98a6319d-9a6b-4312-9963-fcd99693378f","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":"Bome! bilevel optimization made easy: A simple first-order approach.Advances in neural information processing systems, 35:17248–17262, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:490c5b26b31930dddb8f3a213d02ea621fb790ca2b1e1501ff74920812028bd6","observation_id":"3d23a87d-318b-4362-97c3-16a49a059863","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.02422","last_updated":"2023-10-05T21:57:43Z","snapshot_observed_at":"2026-08-16T15:26:45.916895Z","submitted_at":"2023-06-04T17:54:11Z","title":"A Generalized Alternating Method for Bilevel Learning under the Polyak-{\\L}ojasiewicz Condition","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.02422","snapshot_observed_at":"2026-07-14T08:04:14.297636Z","title":"A generalized alternating method for bilevel learning under the polyak-{\\L}ojasiewicz condition.arXiv preprint arXiv:2306.02422, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"cited_paper":"/paper/2306.02422","citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:39235f2b924975985c5140e0eb58152492f15b9f6342275de633525113784978","observation_id":"0c58dd5c-e94a-4c24-966f-6182fab18b1e","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":"On finding small hyper-gradients in bilevel optimization: Hardness results and improved analysis","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:3d368559a7e65ca549f0b59a996579f73020f24192b4f3e8e8df7356f172865b","observation_id":"2a4beffc-4a4a-4c01-bb64-2a0957ebad09","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:245405910964671db54d98e6f61c61bd7a08e0064d598362af53fe7f60ecaa24","observation_id":"a08800fb-1ec2-4f18-9edb-4dcdf48eebf1","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-16T15:03:24.799877Z","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-07-14T08:04:14.297636Z","title":"On penalty methods for nonconvex bilevel optimization and first-order stochastic approximation.arXiv preprint arXiv:2309.01753, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"cited_paper":"/paper/2309.01753","citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:fbdf00c1326391ef3ca7e6fdbf6e3320d6c8afe75d9c308bdd82a7de4f5ea516","observation_id":"b23586e6-f3ee-408b-9a89-5c49d06f8c7b","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":"A near-optimal algorithm for stochastic bilevel optimization via double-momentum.Advances in neural information processing systems, 34:30271–30283, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:baf78c2b218660cf768bf5c3ad83818a53b3f0eb611f4b79bd58912059fb38e4","observation_id":"16adf11b-5d67-4095-ac66-26a0a6220d69","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.13781","last_updated":"2021-06-25T17:33:51Z","snapshot_observed_at":"2026-08-16T18:14:25.850201Z","submitted_at":"2021-06-25T17:33:51Z","title":"Tighter Analysis of Alternating Stochastic Gradient Method for Stochastic Nested Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.13781","snapshot_observed_at":"2026-07-14T08:04:14.297636Z","title":"Tighter analysis of alternating stochastic gradient method for stochastic nested problems.arXiv preprint arXiv:2106.13781, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"cited_paper":"/paper/2106.13781","citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:e40cd86a4d4a54be4c7bd4e1721ee5516faf14e3ddc40f6635c5c8d14d5a1bed","observation_id":"15fc629f-34f7-4d9f-b9c6-f6126ec3fdd2","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.17215","last_updated":"2025-04-24T03:07:23Z","snapshot_observed_at":"2026-08-18T22:12:33.941616Z","submitted_at":"2025-04-24T03:07:23Z","title":"Perturbed Gradient Descent via Convex Quadratic Approximation for Nonconvex Bilevel Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.17215","snapshot_observed_at":"2026-07-14T08:04:14.297636Z","title":"Perturbed gra- dient descent via convex quadratic approximation for nonconvex bilevel optimization.arXiv preprint arXiv:2504.17215, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"cited_paper":"/paper/2504.17215","citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:3cedecfaf7c189c2340932bba4a7b7998280268fa573697ec1987d42c37ca9bb","observation_id":"5fd41249-4964-430e-afcd-2412b6b9034d","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":"Sequential qcqp for bilevel optimization with line search.IEEE Control Systems Letters, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:17e6f0073ec9988389b40278665ea591f38d46a9901d40a296125eac94c093cb","observation_id":"ef5e012a-0659-4d88-a3b5-10bd71c795b9","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":"Accelerated stochastic algorithms for convex-concave saddle-point problems.Mathematics of Operations Research, 47(2):1443–1473, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:e2e0ca856385ee779f2995e2efa5eabdf91cf163faa245ac4fbad66428f085ba","observation_id":"97559c2b-ec99-4248-985a-6ab276a22d18","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":"Momentum-based variance reduction in non-convex SGD","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:ee777513b2f58b2db32aad80508b08eccf00165c232d78a6db8f4674a05837fd","observation_id":"8547c62e-1b21-4547-acf2-47050f135e35","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.06121","last_updated":"2024-01-11T18:57:12Z","snapshot_observed_at":"2026-08-16T14:08:04.457126Z","submitted_at":"2024-01-11T18:57:12Z","title":"TOFU: A Task of Fictitious Unlearning for LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.06121","snapshot_observed_at":"2026-07-14T08:04:14.297636Z","title":"Tofu: A task of fictitious unlearning for llms.arXiv preprint arXiv:2401.06121, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"cited_paper":"/paper/2401.06121","citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:4202d7ea4ba244c861cb4b486a92d37c61989f859ad1b4e7b5578fe3cc4a96fc","observation_id":"138f20a7-d7d3-4076-8fc0-53ec0033e62a","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.06460","last_updated":"2024-07-14T20:14:02Z","snapshot_observed_at":"2026-08-16T13:35:57.672523Z","submitted_at":"2024-07-08T23:47:29Z","title":"MUSE: Machine Unlearning Six-Way Evaluation for Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.06460","snapshot_observed_at":"2026-07-14T08:04:14.297636Z","title":"Muse: Machine unlearning six-way evaluation for language models.arXiv preprint arXiv:2407.06460, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"cited_paper":"/paper/2407.06460","citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:c51deff96f61915d420ade68c3b9fcd6368a683c03edc1ae16b03c8ecf97d537","observation_id":"0decda2f-d75e-4e09-9462-3e134a1145ed","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","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-07-14T08:04:14.297636Z","title":"Openunlearning: Accelerating llm unlearning via unified benchmarking of methods and metrics.arXiv preprint arXiv:2506.12618, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-07-14T08:04:14.297636Z"},"links":{"citing_paper":"/paper/2607.10957"},"observation_digest":"sha256:12d19a721d36cbf1bb3d6827077e866842aa701fbbc28b0cc899567a952e05e5","observation_id":"ac3816f7-8a19-43e8-9be3-9d2b914c8de1","resolution":{"observed_at":"2026-07-14T08:04:14.297636Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.10957","last_updated":"2026-07-12T23:23:02Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T14:08:39.748502Z","submitted_at":"2026-07-12T23:23:02Z","title":"Stochastic Dynamic Barrier Perturbed Gradient Methods for Nonconvex Simple Bilevel Optimization"},"reference_resolution":{"displayed":48,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":48,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":48},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 48 of 48 outbound references and 0 inbound Pith citation observations for arXiv:2607.10957."}