{"as_of":"2026-08-11T13:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b27b49a1d4e885e4fdc5484984fad8974029c35872f1717753e0b2171b9362c1","coverage":[{"denominator":79,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":79,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T05:13:40.783845Z","state":"measured"},{"denominator":79,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":79,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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.22353/citation-record","integrity":"/paper/2607.22353/integrity","json":"/paper/2607.22353/citation-record.json","paper":"/paper/2607.22353"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:13:33.309532Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:33.309532Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:92a244bc2485f17109b2052e2433c04e1c48f1707af1444d2e891686ded00878","observation_id":"bb065fc0-0a05-4c0b-b8b9-c5cb1a9aef5e","resolution":{"observed_at":"2026-08-01T05:13:33.309532Z","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-01T05:13:33.426289Z","title":"Springer, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:33.426289Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:cd2a0dd50d7645ec5f11f28a6764de54dd148629cfee9628d5733f43397d6532","observation_id":"4ec1a498-9928-412e-9347-e24d39d8504b","resolution":{"observed_at":"2026-08-01T05:13:33.426289Z","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-01T05:13:33.497693Z","title":"Erdogdu, Adil Salim, and Shunshi Zhang","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:33.497693Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:eec521048ec7974c015119a0f8ce1fb1d6530d747fbe6e3d13923d38ed2bc16a","observation_id":"4f5f28b9-db8f-45c4-90cb-78ae3920ff74","resolution":{"observed_at":"2026-08-01T05:13:33.497693Z","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-01T05:13:33.582642Z","title":"Constrained consensus-based optimization and numerical heuristics for the few particle regime.Journal of Global Optimization, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:33.582642Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:700a1be1d918a7ba6b754c622df20799cd2be426632b7e66ab16d351b5fabcf7","observation_id":"50bfd91b-b04d-4890-be28-702397444265","resolution":{"observed_at":"2026-08-01T05:13:33.582642Z","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-01T05:13:33.683813Z","title":null,"venue":null,"work_id":null,"year":1954},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:33.683813Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:bf9bab97e4ac22ebc82df9fa2bf034c578a22dca3fd4180d2ebcbd53440bb3ef","observation_id":"904deeec-e6de-4481-b2a6-f8295a6c344d","resolution":{"observed_at":"2026-08-01T05:13:33.683813Z","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-01T05:13:33.747011Z","title":"Weighted Csisz´ ar-Kullback-Pinsker inequalities and applications to transportation inequalities.Annales de la Facult´ e des sciences de Toulouse : Math´ ematiques, Ser","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:33.747011Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:c6758d5ef314a80fdc7cf64eae5fc717a9a5e1154a14058816920278bc3d9842","observation_id":"444dfb63-7670-4840-b9aa-cb59e2401700","resolution":{"observed_at":"2026-08-01T05:13:33.747011Z","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-01T05:13:33.812359Z","title":"A distributed Plug- and-Play MCMC algorithm for high-dimensional inverse problems.IEEE Transactions on Computa- tional Imaging, 12:839–849, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:33.812359Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:2f88aeb034e480b4ce0f4fdd91fca38e0a8394c8ee39579a580239262c8a4313","observation_id":"603d0cdc-0205-43c1-848f-690c49a9645e","resolution":{"observed_at":"2026-08-01T05:13:33.812359Z","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-01T05:13:33.901436Z","title":"Springer, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:33.901436Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:83aed6c10b23722a038905cc07c020f8f9944f3d0efd19edd7cb950ef306e0e9","observation_id":"60039717-a66f-4bb6-84dc-d2cba9db5934","resolution":{"observed_at":"2026-08-01T05:13:33.901436Z","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-01T05:13:34.055311Z","title":"Metastability in reversible diffu- sion processes I: Sharp asymptotics for capacities and exit times.Journal of the European Mathematical Society, 6(4):399–424, 2004","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:34.055311Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:9f874e4457662a042b150f9da9804c2672e167c4d7229fc401d8f49b49089bb4","observation_id":"0e231cfa-5130-474a-ac4d-6ddf26759c05","resolution":{"observed_at":"2026-08-01T05:13:34.055311Z","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-01T05:13:34.187018Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:34.187018Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:6626757da2a3e019fbf1bf71106aaedce2860c69edb0c939e841c279f9ccaf4f","observation_id":"dc2cd950-3a14-4259-8e93-372ca5a8346d","resolution":{"observed_at":"2026-08-01T05:13:34.187018Z","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-01T05:13:34.284562Z","title":"Carrillo, Shi Jin, Lei Li, and Yuhua Zhu","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:34.284562Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:2e05e4da902b6842a7fecc40fcffb29d44c66d8205d6beb08549f29095aac145","observation_id":"d7fd3b98-8a92-4dac-ae1b-7b4b48f999c7","resolution":{"observed_at":"2026-08-01T05:13:34.284562Z","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-01T05:13:34.426158Z","title":"Functional inequalities for perturbed measures with applications to log-concave measures and to some Bayesian problems.Bernoulli, 28(4):2294–2321, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:34.426158Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:f63edc5e96ab2670295ed9fbf426b1cabdfc76a90cddbe73521650c5b7514fd4","observation_id":"c38a3abb-357a-4e27-ba88-6bb607076fb9","resolution":{"observed_at":"2026-08-01T05:13:34.426158Z","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-01T05:13:34.551936Z","title":"A note on Talagrand’s transportation inequality and logarithmic Sobolev inequality.Probability Theory and Related Fields, 148(1–2):285–304, 2010","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:34.551936Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:aa0d3cb321c882f9e7f91996975ab1f41b99a347aaea417ef9c18a0e234f64da","observation_id":"5f696dad-9e3b-4ea1-9bd3-a9effbf69504","resolution":{"observed_at":"2026-08-01T05:13:34.551936Z","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-01T05:13:34.711748Z","title":"Chen, Ayush Sekhari, and Karthik Sridharan","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:34.711748Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:401cee2e4277c379e3a6da14adf6956d6e440f9e554dea5e1478fa1419cf3312","observation_id":"6f530e9c-1608-4ad9-8e58-8e557acedfda","resolution":{"observed_at":"2026-08-01T05:13:34.711748Z","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-01T05:13:34.848463Z","title":"Zoo: Zeroth order optimiza- tion based black-box attacks to deep neural networks without training substitute models","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:34.848463Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:5055d037b846ff516a5d26842e405e8a9fec4579e7398d062c0d36d9763084f8","observation_id":"54c2479e-0df8-486c-b4cf-c7b9f0675f88","resolution":{"observed_at":"2026-08-01T05:13:34.848463Z","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-01T05:13:34.954419Z","title":"Chatterji, Yasin Abbasi-Yadkori, Peter L","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:34.954419Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:eca40cb0f69420a67e850daa3d3e40a6531496ad1adc43379c5ee101b7151ff0","observation_id":"68a876cf-a655-4976-a101-1e183a57bae8","resolution":{"observed_at":"2026-08-01T05:13:34.954419Z","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-01T05:13:35.105173Z","title":"Erdogdu, Mufan Li, Ruoqi Shen, and Shunshi Zhang","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:35.105173Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:78f3a47bb5d247734bfbeda31a9bf10193365e8eae89e494535172b01d80b52e","observation_id":"40bf168b-ccff-4a17-b30e-5dea1cb1bc6f","resolution":{"observed_at":"2026-08-01T05:13:35.105173Z","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-01T05:13:35.164537Z","title":"Diffusion for global optimization inR n","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:35.164537Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:c44f1e91c521321a3514f8dc88f81c390c5ef4979a88f15b084f65ba9c9c4c1b","observation_id":"2762a53c-a1e1-43ba-b7ca-7a87a11eead9","resolution":{"observed_at":"2026-08-01T05:13:35.164537Z","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-01T05:13:35.284625Z","title":"Conn, Katya Scheinberg, and Luis N","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:35.284625Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:6a8185e4080aff95cdcb92ff9dbfbb1789a485f973174e82b61848440ac5284e","observation_id":"fae021b9-5404-43e0-beb8-f4f6cb770e35","resolution":{"observed_at":"2026-08-01T05:13:35.284625Z","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-01T05:13:35.346119Z","title":"Dalalyan","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:35.346119Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:c0e8fb1078c4c17ed263f9970299bdfbc3f4c0e0cf1fa62471ca0d277d220cf5","observation_id":"9206da60-7f08-43b9-a53a-73ee81375369","resolution":{"observed_at":"2026-08-01T05:13:35.346119Z","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-01T05:13:35.413523Z","title":"Dalalyan and Avetik Karagulyan","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:35.413523Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:5a91efb2f005061afb0cdf776123a06867dcd591ec588eb2be691e997bc32cbd","observation_id":"e5012f4c-a70c-449e-b51a-1b73c6cfd166","resolution":{"observed_at":"2026-08-01T05:13:35.413523Z","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-01T05:13:35.467023Z","title":"Nagaraj, and Anant Raj","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:35.467023Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:ea3faf9db5f6a5105edfcf4ee1b6132f9a49965554ec2d7c11d26f3335ce7fe8","observation_id":"e2ab4bfb-e551-46c1-9ed5-8491dc86e1f9","resolution":{"observed_at":"2026-08-01T05:13:35.467023Z","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-01T05:13:35.549492Z","title":"Duchi, Michael I","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:35.549492Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:0c056dc1df85f1082b5633446e22ed3f9d0576ccb7cf75a731572648e78b7758","observation_id":"fccecec3-d3c7-4c64-b774-fac7b0ac3633","resolution":{"observed_at":"2026-08-01T05:13:35.549492Z","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-01T05:13:35.636769Z","title":"Analysis of Langevin Monte Carlo via convex optimization.Journal of Machine Learning Research, 20(73):1–46, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:35.636769Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:a5698efc39e6ac0ed48ae64b5f52a658f87e710d998c3c71dd19ac65e5d6ce57","observation_id":"b39f5ae4-233a-46dd-89f4-f8347d508c44","resolution":{"observed_at":"2026-08-01T05:13:35.636769Z","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-01T05:13:35.696621Z","title":"Nonasymptotic convergence analysis for the unadjusted Langevin algorithm.The Annals of Applied Probability, 27(3):1551–1587, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:35.696621Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:2afc74a3598e66abf55eb5d8e75f7d60fc6392571eb8f1ea3048ae32b5f236ec","observation_id":"5424259e-0af8-4cf3-858e-17679f37ca05","resolution":{"observed_at":"2026-08-01T05:13:35.696621Z","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-01T05:13:35.757725Z","title":"Reflection couplings and contraction rates for diffusions.Probability Theory and Related Fields, 166(3):851–886, Dec 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:35.757725Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:9f00dfa63cdb103995c225a570482a01ed2e3a186d495c94b3f3dc142fd1b2e1","observation_id":"8ecb050e-f206-49fd-9cfd-0da14d022b2e","resolution":{"observed_at":"2026-08-01T05:13:35.757725Z","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-01T05:13:35.818953Z","title":"Ehrhardt, Lorenz Kuger, and Carola-Bibiane Sch¨ onlieb","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:35.818953Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:8c7e085452b99897ea2ec6e75e8ae000a3d15e512b3189cc2c597e1c5bc5bf85","observation_id":"feb3b07b-464c-4213-b775-7fc210bd2efa","resolution":{"observed_at":"2026-08-01T05:13:35.818953Z","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-01T05:13:35.901026Z","title":"Erdogdu and Rasa Hosseinzadeh","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:35.901026Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:3b438e321901944a37145151ebb1b2facee34948df9c93abf6458e616cc27281","observation_id":"c38f64d9-6331-42ec-b916-259e86a426a7","resolution":{"observed_at":"2026-08-01T05:13:35.901026Z","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-01T05:13:35.960945Z","title":"Flaxman, Adam T","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:35.960945Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:75c6cb9eb1f94ba7586d82416aaff0292b1b3ce36cbf07a55873baa627da11ce","observation_id":"1556e89f-bbaf-439b-bea5-17d7dea056b5","resolution":{"observed_at":"2026-08-01T05:13:35.960945Z","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-01T05:13:36.012205Z","title":"From consensus-based optimiza- tion to evolution strategies: Proof of global convergence, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:36.012205Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:100e8bab664ea31f9c3f4909b30d667d06d52586c3c8ba725609f91b2cd52a4c","observation_id":"7cf3245e-3cab-4c48-93f8-0ab98e3f393b","resolution":{"observed_at":"2026-08-01T05:13:36.012205Z","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-01T05:13:36.073276Z","title":"Consensus-based optimization methods converge globally.SIAM Journal on Optimization, 34(3):2973–3004, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:36.073276Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:6ca0072e4c323dc7308d15da29e2eaaa11a3b7df28909d01945acc3e4a5298b1","observation_id":"57c13d4f-1d1a-4fd9-b83c-99aba4397343","resolution":{"observed_at":"2026-08-01T05:13:36.073276Z","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-01T05:13:36.137566Z","title":"On the information-adaptive variants of the admm: An iteration complexity perspective.Journal of Scientific Computing, 76(1):327–363, Jul 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:36.137566Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:f40a6d0498c6ebc09fe0db1c9b626095514bb014dd0cccc17632bd9362bbb9e4","observation_id":"e054d5ab-a4bf-4d75-8730-c3289554be49","resolution":{"observed_at":"2026-08-01T05:13:36.137566Z","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-01T05:13:36.221243Z","title":"Diffusions for global optimization.SIAM Journal on Control and Optimization, 24(5):1031–1043, 1986","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:36.221243Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:f764583a9c07a30432d44cfef3bd12242c61136a43ae3784980bd4458b71cd8a","observation_id":"5e1130b5-2fbe-4d22-9eb6-5bba34248b8b","resolution":{"observed_at":"2026-08-01T05:13:36.221243Z","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-01T05:13:36.335741Z","title":"Stochastic first- and zeroth-order methods for nonconvex stochastic programming.SIAM Journal on Optimization, 23(4):2341–2368, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:36.335741Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:cab7bcb4dd09405e779cf4f7b061a6695616f225fdd73c8349af817be5ae13cc","observation_id":"784a235d-34ec-442b-acd3-145355c45450","resolution":{"observed_at":"2026-08-01T05:13:36.335741Z","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-01T05:13:36.447292Z","title":null,"venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:36.447292Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:b9ec9cbfe59f9d39d59c9e3bb509c980f6dfac63b388b378b1708366d1a8bb12","observation_id":"0d183d6a-e89e-4b3f-a9b3-b841b17eec02","resolution":{"observed_at":"2026-08-01T05:13:36.447292Z","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-01T05:13:36.563960Z","title":"SGD for structured nonconvex functions: Learn- ing rates, minibatching and interpolation","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:36.563960Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:fd125440eab94a219fdaab3b003fcf239b90e60d8707f2fce32abb34e6c8d5a0","observation_id":"94eab770-13b9-412f-a439-b0b06400efc6","resolution":{"observed_at":"2026-08-01T05:13:36.563960Z","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-01T05:13:36.698141Z","title":"Diffusion at absolute zero: Langevin sampling using successive Moreau envelopes.SIAM Journal on Imaging Sciences, 19(1):35–77, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:36.698141Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:c52d847939a737edbf5675e4f15ea987f71b0b87b91e79d104b15a6030910daf","observation_id":"0f8c0bc0-ba79-4b33-9a8c-16bd838b5a24","resolution":{"observed_at":"2026-08-01T05:13:36.698141Z","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-01T05:13:36.832878Z","title":"Subgradient Langevin methods for sampling from nonsmooth potentials.SIAM Journal on Mathematics of Data Science, 6(4):897–925, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:36.832878Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:019438f273d0b1fd6ae96e8832703554d867ec45a3cc338493b71d71227239db","observation_id":"ab80c46f-c2e7-4123-9d26-631a63142e26","resolution":{"observed_at":"2026-08-01T05:13:36.832878Z","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-01T05:13:36.883139Z","title":"Forward-KL convergence of time-inhomogeneous Langevin diffu- sions, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:36.883139Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:f26503646140dff6bc7f5e866a9703d71a5a523bccb5cb39eb1443b62cb08a51","observation_id":"7f4b71bd-6e0f-42c0-bb67-00bcca82dacd","resolution":{"observed_at":"2026-08-01T05:13:36.883139Z","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-01T05:13:36.998542Z","title":"Cooling schedules for optimal annealing.Mathematics of Operations Research, 13(2):311– 329, 1988","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:36.998542Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:91145fa63e4a7055db53627f2379227ca20f4dfad1c74b5bb250ae357b880ef9","observation_id":"0b5fff09-9c30-4dae-b7eb-dc47e6feac25","resolution":{"observed_at":"2026-08-01T05:13:36.998542Z","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-01T05:13:37.072228Z","title":"Harris, K","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:37.072228Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:3402270d54d5570e2d75befa6609a6fc0c07c3310f1018725cbe951c2d499701","observation_id":"4e2163a7-45a1-49ca-bc26-67efd646a007","resolution":{"observed_at":"2026-08-01T05:13:37.072228Z","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-01T05:13:37.157914Z","title":"Logarithmic Sobolev inequalities and stochastic Ising models","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:37.157914Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:fdb7fb35aa308885ed875275a37eca6cbfc9a1f051f0cacbed16e9a0d29819e2","observation_id":"ebe7ffa8-c55d-4f9f-9da8-b48760f5cb85","resolution":{"observed_at":"2026-08-01T05:13:37.157914Z","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-01T05:13:37.251024Z","title":null,"venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:37.251024Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:0ff4db05865b8fdb635b6c2ff0e29ee1c7afc2abaac8d5535575ac69265a2517","observation_id":"6cc211d3-0446-4507-973b-e941de49ae6c","resolution":{"observed_at":"2026-08-01T05:13:37.251024Z","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-01T05:13:37.373651Z","title":"The performance of the unadjusted Langevin algorithm without smoothness assumptions, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:37.373651Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:fe2312d8b24202875254d3191d93302ae3bf8dd815cd97a4e97bd293d3375eca","observation_id":"b17d9087-f9d3-4218-bf3c-acc16390fcb4","resolution":{"observed_at":"2026-08-01T05:13:37.373651Z","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-01T05:13:37.457465Z","title":"Improved convergence rate of stochastic gradient Langevin dynam- ics with variance reduction and its application to optimization","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:37.457465Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:fa72bb78dad4b6fa81ebdb45e1c380cf6dc16367ff789bcb1078737b67d93cd5","observation_id":"b616ef62-961d-4b33-b130-2d22144e5281","resolution":{"observed_at":"2026-08-01T05:13:37.457465Z","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-01T05:13:37.546558Z","title":"Zygalakis","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:37.546558Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:124b8ed21574e759cafd69ab672612a7d9944b58a94cec47112552e3cfd2e25c","observation_id":"146f071d-992b-45ff-81c7-1181c59b7afb","resolution":{"observed_at":"2026-08-01T05:13:37.546558Z","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-01T05:13:37.679806Z","title":"Proximal basin hopping: global optimization with guarantees, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:37.679806Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:4f388103b69daf01502c509b613b731ab57b0698dd2cacae6b8f99f31844efb2","observation_id":"0909da5b-ba7d-4e1c-9fe4-9230a04b282d","resolution":{"observed_at":"2026-08-01T05:13:37.679806Z","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-01T05:13:37.729800Z","title":"Bayesian imaging using Plug & Play priors: When Langevin meets Tweedie.SIAM Journal on Imaging Sciences, 15(2):701–737, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:37.729800Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:edd3a31500be5b4e0f2bad1f4bb77e0f47de843e2f0e6d13e952e1d5a214242a","observation_id":"98188150-828f-4cfe-8db6-61b77fac94f7","resolution":{"observed_at":"2026-08-01T05:13:37.729800Z","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-01T05:13:37.789253Z","title":"On maximum a posteriori estimation with Plug & Play priors and stochastic gradient descent.Journal of Mathematical Imaging and Vision, 65(1):140–163, Jan 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:37.789253Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:0dad88a76b49080b58392bfc81c31378c8a980635c825827f9ed9a2d603b9933","observation_id":"dcf1e02c-fae9-4888-aadb-04518de490dd","resolution":{"observed_at":"2026-08-01T05:13:37.789253Z","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-01T05:13:37.887600Z","title":"Almost sure convergence rates analysis and saddle avoidance of stochastic gradient methods.Journal of Machine Learning Research, 25(271):1–40, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:37.887600Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:67027936fa251a6e01b50b79c91089cdb7f514c4afc36b74dcee1e5e0ecc5233","observation_id":"3caefd63-78c7-4d14-bdc7-94fa2538a869","resolution":{"observed_at":"2026-08-01T05:13:37.887600Z","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-01T05:13:37.998022Z","title":"One-point gradient estimators for zeroth-order stochastic gradient Langevin dynamics","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:37.998022Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:f7fe5adef2936441a2ce234c4ae9a4d1d9f2432828bfb2be04b597512f546c02","observation_id":"3d77fab7-3a4c-40a5-b1c3-991031f234a2","resolution":{"observed_at":"2026-08-01T05:13:37.998022Z","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-01T05:13:38.068639Z","title":"Majka, Aleksandar Mijatovi´ c, and Lukasz Szpruch","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:38.068639Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:0405a709f307b2aab6388b5cc756594e0189d0a5d6d529efce3fc4e5387b8917","observation_id":"8818d265-fe3a-43f7-864a-ccf1cd323bf0","resolution":{"observed_at":"2026-08-01T05:13:38.068639Z","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-01T05:13:38.115996Z","title":"Global optimization of Lipschitz functions","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:38.115996Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:b659d1de1c7deb5ee4c7ed9af86566fa3da90c0446d800f4f2b43557cd1dd208","observation_id":"eea998c7-1979-464a-aded-a8f26707cdd6","resolution":{"observed_at":"2026-08-01T05:13:38.115996Z","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-01T05:13:38.289544Z","title":"Lee, Danqi Chen, and Sanjeev Arora","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:38.289544Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:54dfacd318545e3a6d0037b87c98396af9b88ed2ecf43054bd2601f0aa0aedaf","observation_id":"17dcd76b-acff-4dae-af74-a6a7da2eea0a","resolution":{"observed_at":"2026-08-01T05:13:38.289544Z","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-01T05:13:38.344672Z","title":"Mattingly, Andrew M","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:38.344672Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:b15df5ada442872da8623034cfcba08fbecb7ad9e9eebf13cce9dce990a728ef","observation_id":"67823ca0-661d-4e9e-b410-c1746e599988","resolution":{"observed_at":"2026-08-01T05:13:38.344672Z","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-01T05:13:38.499392Z","title":"Convergence of zeroth-order proximal point algorithms in the high-temperature regime, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:38.499392Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:2b38bc11ba1f89cc6ebb9d58140c56bfe83213ac61faae9883f383b5fa875154","observation_id":"64782abe-270d-4c7a-bb3c-118dcc170e40","resolution":{"observed_at":"2026-08-01T05:13:38.499392Z","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-01T05:13:38.609638Z","title":"Random gradient-free minimization of convex functions.Foun- dations of Computational Mathematics, 17(2):527–566, Apr 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:38.609638Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:525a4eb85f151beb490c8475325ceb36738871ee743fe9d17d0c8fc7d04faf64","observation_id":"8d419512-e3bd-4f9b-9bef-7802a47a2402","resolution":{"observed_at":"2026-08-01T05:13:38.609638Z","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-01T05:13:38.715743Z","title":"Unadjusted Langevin algorithm for non-convex weakly smooth potentials.Communications in Mathematics and Statistics, 13(4):979–1036, Aug 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:38.715743Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:3be757bb011ae21e1bd280147a53636ef7bf06747498eb9bc2a810ae0793938c","observation_id":"c51b5ef4-4408-40d7-9303-6936eb251b36","resolution":{"observed_at":"2026-08-01T05:13:38.715743Z","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-01T05:13:38.757675Z","title":"Pytorch: An imperative style, high-performance deep learning library","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:38.757675Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:81125a5cafa3737a57506fc38615a893d41869c337bc9c1dba522afabe764c81","observation_id":"dfc6450b-7a22-4e73-ae01-c7c4eff2abae","resolution":{"observed_at":"2026-08-01T05:13:38.757675Z","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-01T05:13:38.857464Z","title":"A consensus-based model for global optimization and its mean-field limit.Mathematical Models and Methods in Applied Sciences, 27(1):183– 204, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:38.857464Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:c0e498f067c43123bbbd5d25257a2e5df1ac66d4b0f593ed74e80475faf57999","observation_id":"8bbf3e73-81bd-4cd0-9623-145d4ad9e1c2","resolution":{"observed_at":"2026-08-01T05:13:38.857464Z","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-01T05:13:38.942268Z","title":"Non-convex learning via stochastic gradient Langevin dynamics: a nonasymptotic analysis","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:38.942268Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:364e70913f7066c5d6c704930a6d32c4b6cdc1d0e0bd70da2733bd6e9e170c31","observation_id":"902ce515-a6ea-41ed-90a1-3f6922fa2f94","resolution":{"observed_at":"2026-08-01T05:13:38.942268Z","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-01T05:13:39.058966Z","title":"A new formulation for zeroth-order op- timization of adversarial EXEmples in malware detection.IEEE Transactions on Information Forensics and Security, 21:506–515, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:39.058966Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:7790d73def6ae23ca8101833a319923ebfcb5bc90c9348be91af9e22356a6d40","observation_id":"cc61011a-b86d-4378-95ab-d8e5777f1ba3","resolution":{"observed_at":"2026-08-01T05:13:39.058966Z","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-01T05:13:39.209616Z","title":"An optimal structured zeroth- order algorithm for non-smooth optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:39.209616Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:7534251fcce56b7729347d8383e8bb934ffa444744a7a0de6f72f11840c2eef0","observation_id":"d0c8ed0e-b01e-4a8c-9ec8-b8656a2763ab","resolution":{"observed_at":"2026-08-01T05:13:39.209616Z","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-01T05:13:39.338469Z","title":"Stochastic zeroth order descent with structured directions.Computational Optimization and Applications, 89(3):691–727, Dec 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:39.338469Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:36cad5117583e3b02bfd0dfc0b76467e869079ab9db04c31956289d9e6b994b1","observation_id":"c4dab15e-860f-452e-b298-b759a1c02ef8","resolution":{"observed_at":"2026-08-01T05:13:39.338469Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.23758","last_updated":"2025-06-30T12:07:39Z","snapshot_observed_at":"2026-08-11T12:46:22.520369Z","submitted_at":"2025-06-30T12:07:39Z","title":"A Structured Proximal Stochastic Variance Reduced Zeroth-order Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.23758","snapshot_observed_at":"2026-08-01T05:13:39.448136Z","title":"A structured proximal stochastic variance reduced zeroth-order algorithm.arXiv preprint arXiv:2506.23758, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:39.448136Z"},"links":{"cited_paper":"/paper/2506.23758","citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:23edf3c6d118e02969dd0a35a74ad91886d72dfc59c69416398afa3a3f5d5a0c","observation_id":"9ca1c297-5b84-4cec-9b11-701bd9559af7","resolution":{"observed_at":"2026-08-01T05:13:39.448136Z","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-01T05:13:39.539040Z","title":"Zoba: An efficient single-loop zeroth-order bilevel optimization algo- rithm, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:39.539040Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:09f789197c1a33650db12e0b92e0fb3609584d2e74176302760e135f6aac6fcb","observation_id":"f362bf22-a11e-47e7-8a6d-7556194c5986","resolution":{"observed_at":"2026-08-01T05:13:39.539040Z","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-01T05:13:39.686867Z","title":"From stability of Langevin diffusion to convergence of proximal MCMC for non-log-concave sampling","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:39.686867Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:670e114de7a007fea18aea2d19db722a5510baa933b4464a518aa4b544ad096c","observation_id":"13333398-20d9-4573-b23a-910eb6bc1270","resolution":{"observed_at":"2026-08-01T05:13:39.686867Z","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-01T05:13:39.761428Z","title":"Roberts and Richard L","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:39.761428Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:eb32d5c0f55816a6181a3d8a9a2f1ba429ca2b2dbccbdca65f878bee368d1f53","observation_id":"badceb99-b5a5-4850-b3f4-eb326f3367ff","resolution":{"observed_at":"2026-08-01T05:13:39.761428Z","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-01T05:13:39.813796Z","title":"Stochastic zeroth-order discretizations of Langevin diffusions for Bayesian inference.Bernoulli, 28(3):1810–1834, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:39.813796Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:949da90cc9bf0283dc2c070f4b274a4e92e16d2d306447462ea90f4109eaf53f","observation_id":"b382ce06-6985-4e2c-b98f-e55a4fa2d324","resolution":{"observed_at":"2026-08-01T05:13:39.813796Z","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-01T05:13:39.904905Z","title":"Automatic gain tuning for humanoid robots walking architectures using gradient-free optimization tech- niques","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:39.904905Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:ffe2f0faa33e1e055fccb16f9ef283f54fee20a740b765c874a19a79861b5769","observation_id":"10ab4051-67d6-4fbb-b63d-166c60e14fc3","resolution":{"observed_at":"2026-08-01T05:13:39.904905Z","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-01T05:13:39.992958Z","title":"Solis and Roger J-B","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:39.992958Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:1e4c898c2aab2b37aeee0e06ef3dfdc837cec90a7acfdad4f62fa64e62f903d3","observation_id":"e1ddd7d4-f039-4429-ada0-46f53d183448","resolution":{"observed_at":"2026-08-01T05:13:39.992958Z","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-01T05:13:40.042706Z","title":"Discrete-time simulated annealing: A convergence analysis via the eyring–kramers law.Numerical Algebra, Control and Optimization, 14(4):778–794, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:40.042706Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:a9beaf946e71db70e3d7844054bef61690ad020a6da6205bbc32fdcb9237d2fd","observation_id":"7cb719e6-9682-45bf-9984-f2f8b233c74d","resolution":{"observed_at":"2026-08-01T05:13:40.042706Z","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-01T05:13:40.131298Z","title":"Tail probability estimates of continuous-time simulated annealing processes.Numerical Algebra, Control and Optimization, 13(3&4):473–485, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:40.131298Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:8c62fa1adf26c8892dee46a9151fcc53da443c6f2afb821ab7b5ffe3185af0da","observation_id":"bbd3aa95-ff89-49d2-b9cd-53a81e3780d4","resolution":{"observed_at":"2026-08-01T05:13:40.131298Z","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-01T05:13:40.220981Z","title":"Rapid convergence of the unadjusted Langevin algorithm: Isoperimetry suffices","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:40.220981Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:7c23fd2cfc692c5b01be5a17a90c5acf6bc3acccf1f6298bdfd3fceb4e028a19","observation_id":"74c46d04-f0d4-4fa0-b2cc-f13bbab1f269","resolution":{"observed_at":"2026-08-01T05:13:40.220981Z","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-01T05:13:40.278966Z","title":"Springer Berlin, Heidelberg, Berlin, Heidelberg, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:40.278966Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:689d5c6cc4e84acf6b822bb3e03c13ec744ea78d03a9d9873baa8ce95216291a","observation_id":"680076ea-b98e-4795-80ae-823a8058f237","resolution":{"observed_at":"2026-08-01T05:13:40.278966Z","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-01T05:13:40.355852Z","title":"Global convergence of Langevin dynamics based algorithms for nonconvex optimization","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:40.355852Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:f99e6f643689f6a9f5ea6694c51ec2a14ea5201e38eb7b3f642efbe7eeafc95c","observation_id":"f447e18e-098e-434b-af4e-443bc45d7deb","resolution":{"observed_at":"2026-08-01T05:13:40.355852Z","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-01T05:13:40.472241Z","title":"Inexact proximal point algorithms for zeroth-order global optimization, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:40.472241Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:cdeb306c27d13185e3b298c82ea52a44f6c91eb03e67813ba7ec451732d3efe4","observation_id":"d4568446-9445-4b0c-919f-1228aa5ab996","resolution":{"observed_at":"2026-08-01T05:13:40.472241Z","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-01T05:13:40.606725Z","title":"Faster convergence of stochastic gradient Langevin dynamics for non-log-concave sampling","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:40.606725Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:ccee9f1a353b8f2427e213091e9fd9df15b4532b043a21635a3418c4582ddfd4","observation_id":"8d5f2c93-9e84-4779-93b6-c87b53c81234","resolution":{"observed_at":"2026-08-01T05:13:40.606725Z","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-01T05:13:40.783845Z","title":"Moreover, their main result is a Wasserstein tracking bound to the Gibbs measure, rather than an explicit expected-excess-risk oracle complexity","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-01T05:13:40.783845Z"},"links":{"citing_paper":"/paper/2607.22353"},"observation_digest":"sha256:71cdb51b4701d2cc659af9529c29826ca6aa7b49e18d65cc17922a06e494415a","observation_id":"055e9d63-f822-497c-8e3a-09e49eed3565","resolution":{"observed_at":"2026-08-01T05:13:40.783845Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.22353","last_updated":"2026-07-24T14:34:48Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-06T11:26:22.620548Z","submitted_at":"2026-07-24T14:34:48Z","title":"Langevin for Nonconvex Optimization: Exact, Inexact and Zeroth-Order"},"reference_resolution":{"displayed":79,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":78,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":79},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 79 of 79 outbound references and 0 inbound Pith citation observations for arXiv:2607.22353."}