{"as_of":"2026-08-14T00:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:008776da1aa343310c11a274a6c480cb2fa1730d1b4f91d7f7c97b1cfea61f4f","coverage":[{"denominator":61,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":61,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T18:49:52.651020Z","state":"measured"},{"denominator":62,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":62,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T04:33:10.554853Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T17:08:43.639380Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"cited_work":{"arxiv_id":"2502.05600","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.05600","snapshot_observed_at":"2026-07-03T17:08:43.639380Z","title":"A parameter-free and near-optimal zeroth-order algorithm for stochastic convex optimization.arXiv preprint arXiv:2502.05600, 2025","venue":null,"work_id":"6ae528a1-350a-42d6-aec7-6ffb106c3cd7","year":2025},"citing_paper":{"arxiv_id":"2606.14970","last_updated":"2026-06-22T08:40:27Z","snapshot_observed_at":"2026-07-06T23:52:28.557859Z","submitted_at":"2026-06-12T21:46:54Z","title":"Zero-order Parameter-free Optimization for LMO-based Methods: Novel Approach for Efficient Fine-tuning","version":2},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-06-27T04:33:10.554853Z"},"links":{"cited_paper":"/paper/2502.05600","citing_paper":"/paper/2606.14970"},"observation_digest":"sha256:43566ba6bd79dcbd1eb4ec52b5ee50dc31746aa0bcf4a7ffd0a36a7f4adc4bf8","observation_id":"ae9b23cc-19b6-483d-bdb7-406c239036d5","resolution":{"observed_at":"2026-07-03T17:08:43.640812Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.05600/citation-record","integrity":"/paper/2502.05600/integrity","json":"/paper/2502.05600/citation-record.json","paper":"/paper/2502.05600"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:53.616760Z","title":"Optimal algorithms for online convex optimization with multi-point bandit feedback","venue":null,"work_id":"695e69cd-81a1-4c66-99d8-26e7e5fa8257","year":2010},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.232460Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:c5505827480439863165af6fce2b6f1d6a530852452c39fa80c1be3247514807","observation_id":"36443e27-632d-4f5d-866d-93232843b052","resolution":{"observed_at":"2026-08-08T18:49:53.621933Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:53.599189Z","title":"Zeroth-order (non)-convex stochastic optimization via conditional gradient and gradient updates","venue":null,"work_id":"b94a36b0-46a8-439a-ba43-1f23c927e641","year":2018},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.238418Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:943bcf3dd5a244f1ffa6c5446698ef60d6741f1509b87a8c27b180df6506d29d","observation_id":"cc0ede2c-1047-4882-88bb-c90ae1dde36c","resolution":{"observed_at":"2026-08-08T18:49:53.605312Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:53.583333Z","title":"Two-point step size gradient methods","venue":null,"work_id":"b2e96f82-cb45-4948-a3eb-53e03e4d5e2a","year":1988},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.245568Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:474c2764cfa802df02c1436967c4866f24adc921f300ea1b2761f2b8dd6cbcff","observation_id":"6c808476-21ce-4e71-9a5a-2774c242cef5","resolution":{"observed_at":"2026-08-08T18:49:53.588145Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:53.568098Z","title":"On the distance between two neural networks and the stability of learning","venue":null,"work_id":"fc3166b9-6e5a-43dd-8de6-5c46b62c3451","year":2020},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.363895Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:f77e28bdbb4bdf7faab4f12998eeaadc2f8b7a4e561e9aa3b0a25aa0bdc70fbc","observation_id":"5b53c678-f3ee-43fd-8b54-eb89d2d0a984","resolution":{"observed_at":"2026-08-08T18:49:53.573278Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:53.552071Z","title":"Training neural networks for and by interpolation","venue":null,"work_id":"66e2d867-4b2c-4542-b7fa-c73b0e949dd2","year":2020},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.369289Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:e3bd22acaac96c435624ccba3bf9566d25cf40a1f3454bbfcd971aaa7909ddf2","observation_id":"79c50953-6838-49b8-8f51-fac545afb56e","resolution":{"observed_at":"2026-08-08T18:49:53.557613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:53.537115Z","title":"Online learning with imperfect hints","venue":null,"work_id":"b42d6a83-1f76-46ec-9ff6-5fec1ca29cac","year":2020},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.374181Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:fe4529a43ad8ebbf4c7f52fea70350d670f50ed10af7891c91baa49dde626bf6","observation_id":"353b20ce-e4bc-47a6-a66d-bb89d0ac2495","resolution":{"observed_at":"2026-08-08T18:49:53.542119Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:53.520283Z","title":"Making sgd parameter-free","venue":null,"work_id":"f32e0344-8daa-4b56-a192-3416c69b79ea","year":2022},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.379630Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:75fc072c4b0f73b14fe1d4e9ecaf8e1be15078c5b09ff20efa475750d495c91a","observation_id":"a9eb4f30-1647-41a1-87c8-8755c05bc420","resolution":{"observed_at":"2026-08-08T18:49:53.525380Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:52.384158Z","title":"Libsvm: a library for support vector machines","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.384158Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:13c5b9770ba411ac904c40cad2418d5c48b0b58a0f688ab678f96399ca869152","observation_id":"0e041fac-feb5-4c12-94a1-e3bb2cfa14fe","resolution":{"observed_at":"2026-08-08T18:49:52.384158Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:53.494332Z","title":"Better parameter-free stochastic optimization with ode updates for coin-betting","venue":null,"work_id":"4ac74a71-e8d9-4b8a-9a47-d096d9a9fcbe","year":2022},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.388933Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:25b24e598b21a679432335cc55e02ef09c691090a9a180ca9814211bf7abcd9e","observation_id":"daa39421-995d-44a2-8933-0447d4d2b89c","resolution":{"observed_at":"2026-08-08T18:49:53.499234Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:53.478628Z","title":"Faster gradient-free algorithms for nonsmooth nonconvex stochastic optimization","venue":null,"work_id":"342f5d2c-6f67-482e-9744-c9c12cd86b01","year":2023},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.393808Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:23a7c5d12e9b7cdd8bd1d3c4b9daff21d829e23d16b168f6c3d9cf1f7bd518ce","observation_id":"926d5cdf-f65a-4d11-b96a-ece53bd8c0d1","resolution":{"observed_at":"2026-08-08T18:49:53.483655Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:52.398714Z","title":"Black-box reductions for parameter-free online learning in banach spaces","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.398714Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:16d277321ce30d4bb82b35e94de78ebf1c980ab464e2e1ea1211e0edc969eefb","observation_id":"1ded3382-56d1-4850-ac7f-a68a0891a266","resolution":{"observed_at":"2026-08-08T18:49:52.398714Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:53.452323Z","title":"Learning-rate-free learning by d-adaptation","venue":null,"work_id":"888f6f88-874e-4787-a48b-7b05c8603255","year":2023},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.403427Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:5110051a4b86c29480171eab9758d7662eeb5a3d37aac7547854d7cb6210cdc2","observation_id":"b8185a1d-15a6-4d6a-ac81-f4ad1cefe6b8","resolution":{"observed_at":"2026-08-08T18:49:53.457840Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:52.408627Z","title":"Adaptive subgradient methods for online learning and stochastic optimization","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.408627Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:6a9bafe85ae63ca0cc7f367b325d4344c0bb123d45399b810c66c41f9b43225f","observation_id":"712939a9-c8cb-4583-8880-78d86c8ea34e","resolution":{"observed_at":"2026-08-08T18:49:52.408627Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:53.426435Z","title":"Duchi, Peter L","venue":null,"work_id":"3f39773a-79ce-4056-8241-254a1570367d","year":2012},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.414034Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:813f952fecc680ed801cdfb383b97c20e37370662c17317a3b9aa8671e02495a","observation_id":"1180fe6c-072e-4aca-a99d-33e348fbf2ac","resolution":{"observed_at":"2026-08-08T18:49:53.431422Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:53.407408Z","title":"Duchi, Michael I","venue":null,"work_id":"44d47f8f-8589-4d65-be9d-dd5c05c44665","year":2015},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.418771Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:44ce0ac083abcf0d104def5016312c21fe2efc68c542b20059bac254247b68f9","observation_id":"d3f7d536-5221-4fb0-91e6-96e7891e1491","resolution":{"observed_at":"2026-08-08T18:49:53.413062Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:52.423430Z","title":"Probability: theory and examples , volume 49","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.423430Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:815387128da35d5e4dc4ff9660a71b1a749153a1cff4a6196c4282c07f6620f1","observation_id":"14d1b00e-205d-49dc-aeaa-ad097930f4f5","resolution":{"observed_at":"2026-08-08T18:49:52.423430Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"cs/0408007","last_updated":"2004-08-02T21:24:41Z","snapshot_observed_at":"2026-08-12T23:45:21.723107Z","submitted_at":"2004-08-02T21:24:41Z","title":"Online convex optimization in the bandit setting: gradient descent without a gradient","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"cs/0408007","snapshot_observed_at":"2026-08-08T18:49:52.428331Z","title":"Online convex optimization in the bandit setting: gradient descent without a gradient","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.428331Z"},"links":{"cited_paper":"/paper/cs/0408007","citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:218634b298ff86b516c0ae3bb73aa0471ed2cacb8ac928d67b67b46b1e614732","observation_id":"3921b38b-443a-4423-b38c-b22b036c45e0","resolution":{"observed_at":"2026-08-08T18:49:52.428331Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.12289","last_updated":"2023-03-01T11:39:47Z","snapshot_observed_at":"2026-08-13T16:50:54.805675Z","submitted_at":"2022-01-28T17:55:21Z","title":"The Power of First-Order Smooth Optimization for Black-Box Non-Smooth Problems","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.12289","snapshot_observed_at":"2026-08-08T18:49:52.434137Z","title":"The power of first-order smooth optimization for black-box non-smooth problems","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.434137Z"},"links":{"cited_paper":"/paper/2201.12289","citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:eb7a4ae0743b2bd400b6b8ee49575f20d8ba52a2356430621c24b548338925b3","observation_id":"4d75941c-75df-4b81-9158-cecc187c771f","resolution":{"observed_at":"2026-08-08T18:49:52.434137Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:53.379256Z","title":"Stochastic first-and zeroth-order methods for nonconvex stochastic programming","venue":null,"work_id":"d0847f88-bcba-4904-9b14-667a3634c663","year":2013},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.439291Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:31add3148f232d9cc1d46031cefa475003dc74691773afb741b8d59fdaac4209","observation_id":"58a3a714-5f17-4016-80aa-1e54b55c326f","resolution":{"observed_at":"2026-08-08T18:49:53.384960Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6572","last_updated":"2015-03-20T20:19:16Z","snapshot_observed_at":"2026-08-12T17:13:46.394331Z","submitted_at":"2014-12-20T01:17:12Z","title":"Explaining and Harnessing Adversarial Examples","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6572","snapshot_observed_at":"2026-08-08T18:49:52.443797Z","title":"Explaining and harnessing adversarial examples","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.443797Z"},"links":{"cited_paper":"/paper/1412.6572","citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:fd24549a7eb77b5b742bd93b14b4ef5cdb5cd224a29d6de27d5fb7a7b9b7d9e6","observation_id":"0db60a49-b7f7-4524-8a6d-9a69a7c71d73","resolution":{"observed_at":"2026-08-08T18:49:52.443797Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:53.363231Z","title":"Howard, Aaditya Ramdas, Jon McAuliffe, and Jasjeet Sekhon","venue":null,"work_id":"1d1aff69-e67c-4612-9c66-7abad97da5f7","year":2021},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.449004Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:080a2be2b668a0725e6c7abca3da2b87bbf7c3b24b4b1a163159f23f78bab882","observation_id":"00a7f8f8-a63a-4958-87bf-b46924b3c75f","resolution":{"observed_at":"2026-08-08T18:49:53.368206Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1807.07978","last_updated":"2019-03-28T02:56:51Z","snapshot_observed_at":"2026-07-06T06:51:27.956294Z","submitted_at":"2018-07-20T18:00:27Z","title":"Prior Convictions: Black-Box Adversarial Attacks with Bandits and Priors","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.07978","snapshot_observed_at":"2026-08-08T18:49:52.454222Z","title":"Prior convictions: Black-box adversarial attacks with bandits and priors","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.454222Z"},"links":{"cited_paper":"/paper/1807.07978","citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:863582ef183794ab76036b3cb0ab10eca16cd06214ba04508d0345fc624381c5","observation_id":"f80756ce-ce41-4c57-964b-dff24a5439f5","resolution":{"observed_at":"2026-08-08T18:49:52.454222Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:53.347489Z","title":"Dog is SGD’s best friend: A parameter-free dynamic step size schedule","venue":null,"work_id":"f5f16e95-509d-48f7-82c5-87daaefa5809","year":2023},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.459571Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:561e9b172f75bc540ce32b8d150ab97b3c12d186424092bc5bc1d49ed79622e3","observation_id":"3be57e68-84bb-4330-8a66-b174f43963c9","resolution":{"observed_at":"2026-08-08T18:49:53.353094Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.12022","last_updated":"2023-07-16T21:12:43Z","snapshot_observed_at":"2026-08-13T12:48:35.753096Z","submitted_at":"2023-02-08T18:28:48Z","title":"DoG is SGD's Best Friend: A Parameter-Free Dynamic Step Size Schedule","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.12022","snapshot_observed_at":"2026-08-08T18:49:52.465284Z","title":"Dog is sgd’s best friend: A parameter-free dynamic step size schedule, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.465284Z"},"links":{"cited_paper":"/paper/2302.12022","citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:f0b47f6481a2ba7a2a41efaaee13c4861e880d05558712d4c73c1719d06be735","observation_id":"5d9ebbb4-67c5-436b-a6dd-002d3f298dd5","resolution":{"observed_at":"2026-08-08T18:49:52.465284Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:53.332851Z","title":"Parameter-free mirror descent","venue":null,"work_id":"21c7761a-c2a8-4f88-ba18-628d455c9bfa","year":2022},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.471227Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:43a53aef3945cf73340fcdd9733705e846aceccd46902bc372b331e5018a05de","observation_id":"cdf2a47a-bdc8-4904-99a8-1f27a62fb9e7","resolution":{"observed_at":"2026-08-08T18:49:53.337828Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.07793","last_updated":"2024-03-18T20:19:43Z","snapshot_observed_at":"2026-08-13T04:20:27.907660Z","submitted_at":"2024-02-12T16:59:06Z","title":"Tuning-Free Stochastic Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.07793","snapshot_observed_at":"2026-08-08T18:49:52.476014Z","title":"Tuning-free stochastic optimization","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.476014Z"},"links":{"cited_paper":"/paper/2402.07793","citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:848770e9ac5b8bc21b7d8938be148d70665e61d226d23aabeee96c572bcb1ecd","observation_id":"4a054e7d-17a7-4a92-a3c3-5d84cae457cc","resolution":{"observed_at":"2026-08-08T18:49:52.476014Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:53.317306Z","title":"Stochastic estimation of the maximum of a regression function","venue":null,"work_id":"161b615e-2417-4621-9656-a657814d9ec0","year":1952},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.481334Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:a6fb566ab4f7f4f9f6ca953456e211e0f89f7bad4413b604ece6790e70d84d76","observation_id":"34593c07-09ae-456a-b95a-eb90a06de1bf","resolution":{"observed_at":"2026-08-08T18:49:53.322576Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:53.301454Z","title":"Kingma and Jimmy Ba","venue":null,"work_id":"e4886ced-70a0-49d9-938d-7798edb2d82c","year":2014},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.485898Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:24b969c06bae1401b083ec520e2154f091334ab86beaba2a256e48972f124ad0","observation_id":"054a3d56-fb2e-4785-9644-e4821286377b","resolution":{"observed_at":"2026-08-08T18:49:53.306487Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:53.285933Z","title":"An algorithm with optimal dimension-dependence for zero-order nonsmooth nonconvex stochastic optimization","venue":null,"work_id":"971dc1e7-a75b-4d20-a208-8a07da42ef62","year":2024},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.490255Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:f947267c4a1c85deeb1fafa8b29c2aa8de8df5b4a1c38d7fe39a2c68eb0c55af","observation_id":"1970435e-a449-404e-9ad3-12ab1903a349","resolution":{"observed_at":"2026-08-08T18:49:53.290732Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.12139","last_updated":"2024-11-15T12:23:42Z","snapshot_observed_at":"2026-08-13T05:46:01.113607Z","submitted_at":"2023-10-18T17:50:13Z","title":"Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.12139","snapshot_observed_at":"2026-08-08T18:49:52.494744Z","title":"Optimal and parameter-free gradient minimization methods for smooth optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.494744Z"},"links":{"cited_paper":"/paper/2310.12139","citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:af1c5a90b439ec41c7e73e2222c6556c0c43be3c8b5a91fb182b18707565e300","observation_id":"33eba5b0-4c0f-4fc2-b613-294a55961dd0","resolution":{"observed_at":"2026-08-08T18:49:52.494744Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.10082","last_updated":"2024-08-17T03:06:14Z","snapshot_observed_at":"2026-08-13T22:26:32.905743Z","submitted_at":"2023-10-16T05:26:03Z","title":"A simple uniformly optimal method without line search for convex optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.10082","snapshot_observed_at":"2026-08-08T18:49:52.499732Z","title":"A simple uniformly optimal method without line search for convex optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.499732Z"},"links":{"cited_paper":"/paper/2310.10082","citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:6f90db9d55d8c64868d9cedc1339f35ba81da21ae8d10940239fa885dd687e14","observation_id":"dc27d49f-6d70-4de7-8556-123ac7ef1ae7","resolution":{"observed_at":"2026-08-08T18:49:52.499732Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:53.271012Z","title":"Gradient-free methods for deterministic and stochastic nonsmooth nonconvex optimization","venue":null,"work_id":"c3c3414a-1cb5-4848-9c64-d22ffd94ee80","year":2022},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.504847Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:63c146e749cad14050412e5ab5f281a0cf7644824730f7f145f286a78f16190a","observation_id":"f217a5b6-8e84-4a05-b1aa-b42156f5002b","resolution":{"observed_at":"2026-08-08T18:49:53.275887Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:53.255090Z","title":"A primer on zeroth-order optimization in signal processing and machine learning: Principals, recent advances, and applications","venue":null,"work_id":"ce3d2a29-80fc-4855-b83c-675d30c9a1ca","year":2020},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.510156Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:26f5f55f612f60ac9a8c9b44147e5458a3a935d5dd281463f6ea5a374e4d759a","observation_id":"05f453e7-34da-4fc0-9886-15ded1f5be23","resolution":{"observed_at":"2026-08-08T18:49:53.260538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1611.02770","last_updated":"2017-02-07T14:24:44Z","snapshot_observed_at":"2026-07-06T05:17:56.287788Z","submitted_at":"2016-11-08T23:25:00Z","title":"Delving into Transferable Adversarial Examples and Black-box Attacks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.02770","snapshot_observed_at":"2026-08-08T18:49:52.515847Z","title":"Delving into transferable adversarial examples and black-box attacks","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.515847Z"},"links":{"cited_paper":"/paper/1611.02770","citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:00da027444b87d69559a61875032d0c2d09a5f8a37c884480fe419bc34dd92d7","observation_id":"0930d8ef-be91-4866-8abe-8e2b6c85ac9c","resolution":{"observed_at":"2026-08-08T18:49:52.515847Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:53.238952Z","title":"Stochastic polyak step-size for sgd: An adaptive learning rate for fast convergence","venue":null,"work_id":"5a9726d3-8554-46ad-b8fd-06cc865e6393","year":2021},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.521812Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:2f1740f8c685aab415b93d28444e3fa1a41e743a35d4491a1f31c8263612a632","observation_id":"bf3722ba-ab99-47d5-89d0-3cdb437fb0d4","resolution":{"observed_at":"2026-08-08T18:49:53.243696Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:53.223741Z","title":"Achieving all with no parameters: Adanormalhedge","venue":null,"work_id":"9dd12bf3-7b66-41e4-93eb-5ad093866600","year":2015},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.526866Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:8a741af6dd7cd993423849dd97429a20b52e5344f7d755dce03ffdaaf9374bd6","observation_id":"d51b7833-834a-4ed9-8703-ac7a0748b03e","resolution":{"observed_at":"2026-08-08T18:49:53.228746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.07055","last_updated":"2018-03-19T17:35:14Z","snapshot_observed_at":"2026-07-06T06:29:06.402420Z","submitted_at":"2018-03-19T17:35:14Z","title":"Simple random search provides a competitive approach to reinforcement learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.07055","snapshot_observed_at":"2026-08-08T18:49:52.531774Z","title":"Simple random search provides a competitive approach to reinforcement learning","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.531774Z"},"links":{"cited_paper":"/paper/1803.07055","citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:e7c7e13bc659e14c8899dc62fd2a9fe19c213a76cf7fd8b0497d58b952aef147","observation_id":"f12b0d7b-c90f-4163-b0c1-79578da3fa5c","resolution":{"observed_at":"2026-08-08T18:49:52.531774Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:53.207939Z","title":"Lipschitz and comparator-norm adaptivity in online learning","venue":null,"work_id":"9ad340a7-012a-44d4-8be2-e53185c1cd3b","year":2020},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.536874Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:181e6ac8199aba8c1a2d13284539095e27c1087a551ed9e2856a14217832c9be","observation_id":"734e02e0-00d2-4898-9b3d-b0b137e62ddc","resolution":{"observed_at":"2026-08-08T18:49:53.213279Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.09261","last_updated":"2020-05-24T15:14:43Z","snapshot_observed_at":"2026-08-10T01:13:32.660024Z","submitted_at":"2020-05-19T07:44:52Z","title":"Adaptive First-and Zeroth-order Methods for Weakly Convex Stochastic Optimization Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.09261","snapshot_observed_at":"2026-08-08T18:49:52.541953Z","title":"Adaptive first-and zeroth-order methods for weakly convex stochastic optimization problems","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.541953Z"},"links":{"cited_paper":"/paper/2005.09261","citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:cad1e267018524c3d38ba20db5506a461581c960ad28e7c76cc62e26778800a3","observation_id":"8473a882-f7ce-49a1-974d-f399a1fa4c53","resolution":{"observed_at":"2026-08-08T18:49:52.541953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:53.192161Z","title":"Random gradient-free minimization of convex functions","venue":null,"work_id":"f6cc1f89-5a7f-4287-98f7-d33f2bb091cc","year":2017},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.547016Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:1b371d5c66ebebe00ee1a2cc26ddde3e3b2c83b6a88f9e24f2a62973540ab4f4","observation_id":"fcc7e03f-e52c-4c43-85bf-010e8a6fe782","resolution":{"observed_at":"2026-08-08T18:49:53.197775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:53.176368Z","title":"Coin betting and parameter-free online learning.Advances in Neural Information Processing Systems, 29, 2016","venue":null,"work_id":"58e02d33-3462-4084-aa71-97291b667dd4","year":2016},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.551831Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:ca0950c2ae66077b70fd8863aee34726534bbdb34789b1565914dd86f2671423","observation_id":"285d6089-0263-454f-9cd3-f15216d509d1","resolution":{"observed_at":"2026-08-08T18:49:53.181777Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:52.556495Z","title":"Training deep networks without learning rates through coin betting","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.556495Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:7b439fdeb95afae9bbe8b65df80918bfb975f4bee567cf2c607ff6e331c862bd","observation_id":"24d1bba4-f3bb-453d-aa36-1a2fe03f891c","resolution":{"observed_at":"2026-08-08T18:49:52.556495Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:53.151339Z","title":"A stochastic line search method with expected complexity analysis","venue":null,"work_id":"37847241-aa0e-425b-8283-26b07765ba91","year":2020},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.561676Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:f4024926abbea3cb50f04c2695f759cef51e09391184f1bac0c2963293a7a650","observation_id":"b7f04ed1-5b0f-4876-a75e-bb4660376cb2","resolution":{"observed_at":"2026-08-08T18:49:53.156096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:53.136643Z","title":"Introduction to optimization","venue":null,"work_id":"6a2f75c7-355d-47c9-a68d-beb565eb9b28","year":1987},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.566525Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:61527b6e395c13606f9fc8cc671953660cd8f026d7c7145cee5c9ffb0598c6e4","observation_id":"fc62997b-e804-40c3-b3d6-e2734fb9a2c6","resolution":{"observed_at":"2026-08-08T18:49:53.141341Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:53.120966Z","title":"An optimal structured zeroth-order algorithm for non-smooth optimization","venue":null,"work_id":"58dd93d1-a564-4bae-b595-58863efbfb20","year":2024},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.571180Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:99a3c27f6ed5586528b9f0a8de2e4ec100993fb6c5928c936694ce54944e8994","observation_id":"d8ce338d-5279-476f-a4c1-d9b3b770bebc","resolution":{"observed_at":"2026-08-08T18:49:53.126200Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:53.105733Z","title":"L4: Practical loss-based stepsize adaptation for deep learning","venue":null,"work_id":"d8aca813-8bf0-4bd7-aa89-0de0d8fb701e","year":2018},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.575770Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:61cf859c9ae5bfc643e4740a17ebf37912f2745b48ec9b334547765377124379","observation_id":"dd2617a2-bfb0-4695-9587-7920a1fd7f2d","resolution":{"observed_at":"2026-08-08T18:49:53.110659Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:52.580588Z","title":"Understanding adversarial training: Increasing local stability of supervised models through robust optimization","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.580588Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:cfe6dd2a70cb6d4320811c55901653686816ef4ae0b312e42169aa64f6c9468f","observation_id":"8e3803c8-7a80-4b85-9116-d73adb6d00de","resolution":{"observed_at":"2026-08-08T18:49:52.580588Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:53.080790Z","title":"Online learning and online convex optimization","venue":null,"work_id":"462072d6-ed06-4bfe-bbfd-76e725f7d7dc","year":2012},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.585516Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:a51ea8d2584153aafe0707a500137227a3b157b0fea5e1c46803ef7d441e01af","observation_id":"085cb9c7-2cc6-43ea-99a8-e864bcd122a8","resolution":{"observed_at":"2026-08-08T18:49:53.085569Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:53.066174Z","title":"An optimal algorithm for bandit and zero-order convex optimization with two-point feedback","venue":null,"work_id":"721600bd-abee-4326-b8f1-3e2271c9ef42","year":2017},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.590368Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:ecd80f7d1d5d00a7aa1d04f109bdb4a8c120d8af3c784dbbea440102dab288c6","observation_id":"98fffc83-472d-4b6d-aaf2-ff2a1ebfa910","resolution":{"observed_at":"2026-08-08T18:49:53.070911Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:52.595476Z","title":"Adafactor: Adaptive learning rates with sublinear memory cost","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.595476Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:19745ac69270d8aedd38860a66ff95e4cceb41d25de9fb3142800c9c82cd25e7","observation_id":"f0f59710-0205-4263-a51c-5cae4f5a2b3b","resolution":{"observed_at":"2026-08-08T18:49:52.595476Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1211.2260","last_updated":"2012-11-09T22:13:10Z","snapshot_observed_at":"2026-07-06T02:59:34.393809Z","submitted_at":"2012-11-09T22:13:10Z","title":"No-Regret Algorithms for Unconstrained Online Convex Optimization","version":1},"cited_work":{"arxiv_id":"1211.2260","doi":null,"metadata_source":"pith","pith_arxiv_id":"1211.2260","snapshot_observed_at":"2026-08-08T18:49:52.742899Z","title":"No-Regret Algorithms for Unconstrained Online Convex Optimization","venue":"cs.LG","work_id":"cecf7219-aa56-4a85-9b74-a7beb0254c3d","year":2012},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.600678Z"},"links":{"cited_paper":"/paper/1211.2260","citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:9f6676b59c1dd2badf69c0cb24eb2c4f1212472c0f6100d132860e36b9dbcb56","observation_id":"bc115a12-d3ad-4bd6-abf6-5fe4216d24b9","resolution":{"observed_at":"2026-08-08T18:49:52.750138Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:53.041042Z","title":"Barzilai-borwein step size for stochastic gradient descent","venue":null,"work_id":"83d7e4dd-9399-4853-91f6-a5f9d69a48e9","year":2016},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.606902Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:ddaa5735f570b95f85cda792c1da68e8ceb7684b53e3a48cc9229d9966630f09","observation_id":"d71d5497-ba80-4ca8-9645-f52c1a5bf6d6","resolution":{"observed_at":"2026-08-08T18:49:53.045720Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:53.023522Z","title":"Lecture 6.5-rmsprop: Divide the gradient by a running average of its recent magnitude","venue":null,"work_id":"bc661845-52ff-46aa-b637-e3630428e44f","year":2012},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.611779Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:9eb367b3d217d9fdbf438a272f49d92830ae551bb25d2b4579fc2717fb7ef235","observation_id":"dc951868-083c-4e03-a5ec-5ccb48f8b99e","resolution":{"observed_at":"2026-08-08T18:49:53.029878Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:53.006086Z","title":"Painless stochastic gradient: Interpolation, line-search, and convergence rates","venue":null,"work_id":"122fac97-65fc-4838-9470-1adecad913de","year":2019},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.616880Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:e43b16902cecb4b1dbab902a4e19b51453b25f5b71ea69fd262284c04550c746","observation_id":"10e11de0-ed7b-44a9-bfee-d88d140b2a23","resolution":{"observed_at":"2026-08-08T18:49:53.011371Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:52.990015Z","title":"Provable adaptivity of adam under non-uniform smoothness","venue":null,"work_id":"42cea2fb-ee8a-4609-8326-008dd6b683ef","year":2024},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.621734Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:83d0f3eeba67671288b506f41ceab07b9f09fa6555255487f6b571f669214d14","observation_id":"aa1402f7-232c-4421-b504-95cf30a54ef5","resolution":{"observed_at":"2026-08-08T18:49:52.995430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:52.973553Z","title":"Generalized polyak step size for first order optimization with momentum","venue":null,"work_id":"4c2d4a21-d8d9-41df-bac7-80726bd49247","year":2023},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.626297Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:0f304859735e0804d3b319e54265fac40d91ce9de84fb72c926e51151122e98e","observation_id":"5c529546-8b92-4d29-9093-202f7d805c30","resolution":{"observed_at":"2026-08-08T18:49:52.979118Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:52.956810Z","title":"Finite sample convergence rates of zero-order stochastic optimization methods","venue":null,"work_id":"4073f0ba-be33-413b-8804-ca035054a479","year":2012},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.631453Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:8b129be365a45883d61980d66a54f38d2e74e339a2591ac3d3c38e62d754b5f7","observation_id":"c9ff0660-ef8c-4070-92d9-744581c06cf7","resolution":{"observed_at":"2026-08-08T18:49:52.961741Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1708.03888","last_updated":"2017-09-13T23:25:07Z","snapshot_observed_at":"2026-07-06T05:55:05.946111Z","submitted_at":"2017-08-13T11:01:57Z","title":"Large Batch Training of Convolutional Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1708.03888","snapshot_observed_at":"2026-08-08T18:49:52.635960Z","title":"Large batch training of convolutional networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.635960Z"},"links":{"cited_paper":"/paper/1708.03888","citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:87d8313a12218e52cd210a21e0e31c2dc87604fa9cfd95a8b3c4466b33142a90","observation_id":"7c4f2928-33fc-4b73-ac9a-9a4e2a62b55c","resolution":{"observed_at":"2026-08-08T18:49:52.635960Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T18:49:52.940834Z","title":"On stochastic gradient and subgradient methods with adaptive steplength sequences","venue":null,"work_id":"94722820-fdbd-4c34-bb76-e5a1a60c617b","year":2012},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.640806Z"},"links":{"citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:9baace6792ba3253dd54c73613d60119a04e7e892937d9f2622ef552d318555c","observation_id":"7ca883b3-5051-4eaa-8feb-4f2d4c62b912","resolution":{"observed_at":"2026-08-08T18:49:52.945988Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1212.5701","last_updated":"2012-12-22T15:46:49Z","snapshot_observed_at":"2026-07-06T03:02:42.105044Z","submitted_at":"2012-12-22T15:46:49Z","title":"ADADELTA: An Adaptive Learning Rate Method","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1212.5701","snapshot_observed_at":"2026-08-08T18:49:52.645495Z","title":"Adadelta: an adaptive learning rate method","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.645495Z"},"links":{"cited_paper":"/paper/1212.5701","citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:22a95d3f2ce03a9c605770ab31e8daa655f7522276b416d24fd248b5e45319d7","observation_id":"8fe9f462-59d6-449d-a397-e640aa3981fc","resolution":{"observed_at":"2026-08-08T18:49:52.645495Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16793","last_updated":"2025-02-24T11:29:08Z","snapshot_observed_at":"2026-08-12T23:35:57.084703Z","submitted_at":"2024-06-24T16:56:41Z","title":"Adam-mini: Use Fewer Learning Rates To Gain More","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16793","snapshot_observed_at":"2026-08-08T18:49:52.651020Z","title":"Adam-mini: Use fewer learning rates to gain more","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-08T18:49:52.651020Z"},"links":{"cited_paper":"/paper/2406.16793","citing_paper":"/paper/2502.05600"},"observation_digest":"sha256:96ddaef3bd71dffdd587277fff04f0e03852e1a2410001836c47f3621ad7f152","observation_id":"ed6a2b6b-07e1-4ec9-bb3d-90f393f4698a","resolution":{"observed_at":"2026-08-08T18:49:52.651020Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.05600","last_updated":"2025-05-05T05:36:29Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-13T19:57:41.497637Z","submitted_at":"2025-02-08T15:02:51Z","title":"A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization"},"reference_resolution":{"displayed":61,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":21,"verified_exact":1,"verified_fuzzy":39},"total_outbound_references":61},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 61 of 61 outbound references and 1 inbound Pith citation observation for arXiv:2502.05600."}