{"as_of":"2026-08-07T19:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:771a2ef9a6c12e883ccd0c52a2a5036cc8a0079620f921228972c83219052965","coverage":[{"denominator":59,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":59,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:22:53.121791Z","state":"measured"},{"denominator":60,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":60,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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-26T10:25:20.703566Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-04T09:09:43.452646Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"cited_work":{"arxiv_id":"2506.11336","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.11336","snapshot_observed_at":"2026-07-04T09:09:43.452646Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","venue":"cs.LG","work_id":"c1a6b694-0c2a-4248-9399-ee8cc3439182","year":2025},"citing_paper":{"arxiv_id":"2606.22669","last_updated":"2026-06-21T21:05:59Z","snapshot_observed_at":"2026-08-07T17:50:26.020541Z","submitted_at":"2026-06-21T21:05:59Z","title":"Clipping the Price of Adaptivity at the Tail","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-26T10:25:20.703566Z"},"links":{"cited_paper":"/paper/2506.11336","citing_paper":"/paper/2606.22669"},"observation_digest":"sha256:26e6819536f35deb1d77bed7bc82ed333d5111831c705da439978ea68b0d861f","observation_id":"9d8e736e-3b35-41d0-b764-977d2ff37d19","resolution":{"observed_at":"2026-07-04T09:09:43.454234Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.11336/citation-record","integrity":"/paper/2506.11336/integrity","json":"/paper/2506.11336/citation-record.json","paper":"/paper/2506.11336"},"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-07T04:22:54.115744Z","title":"Information-theoretic lower bounds on the oracle complexity of stochastic convex opti- mization","venue":null,"work_id":"ea374962-fc95-4764-84c1-36af69fd36aa","year":2012},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:49.937763Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:2ace872380c34da1e5dadc2e11d7a943cfaadb6216809849a51a6381f6c6f1c8","observation_id":"be244e73-ce9e-4f9a-8c5d-8cc925259ceb","resolution":{"observed_at":"2026-08-07T04:22:54.120100Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:54.101269Z","title":"Characterizing subdifferential of norm, 2023","venue":null,"work_id":"b8bf0a2c-9448-45df-ba99-78861ad390b8","year":2023},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:50.006338Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:153257c5f7a03c1fdf9d9b66e27bf4feb2e979723151d58867ef29be29f45ef6","observation_id":"fa54ef7b-e6ef-410d-9b7d-7d2338b44d59","resolution":{"observed_at":"2026-08-07T04:22:54.105683Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:54.085914Z","title":"How free is parameter-free stochastic optimization? In International Conference on Machine Learning (ICML) , 2024","venue":null,"work_id":"385d7abd-9a43-4b28-b700-556548659482","year":2024},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:50.157295Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:de3d89f22989ed705840f6b15c0205052b8eadc817c211dd7529521b129f5579","observation_id":"542fb9ac-3663-4009-ae02-386f60e8e101","resolution":{"observed_at":"2026-08-07T04:22:54.090603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:54.071069Z","title":"Mirror descent and nonlinear projected subgradient methods for convex optimization","venue":null,"work_id":"392d1f3a-f6a6-4324-8549-886d3a8b195e","year":2003},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:50.253864Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:ffbd61ce8e2cc7e5201ec84efad0a32753e987cf01f692a7e8d23e43fd5e610f","observation_id":"a6020f4e-16e2-4167-af72-05b682c6b4d5","resolution":{"observed_at":"2026-08-07T04:22:54.075627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:54.056396Z","title":"Probability inequalities for the sum of independent random variables","venue":null,"work_id":"ddb98637-7de9-472f-8a2d-4e970da0ba24","year":1962},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:50.346572Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:a3918f1f7974699bbf849b2c64858b5360cf613aa51cc5bd331f0bb12c44c4aa","observation_id":"df752033-b7d9-49f9-b076-b2d9fa25f262","resolution":{"observed_at":"2026-08-07T04:22:54.060637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:54.037368Z","title":"The ladder: A reliable leaderboard for machine learn- ing competitions","venue":null,"work_id":"0dc1c695-c8ad-4aff-a2b1-599b87f4b482","year":2015},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:50.420219Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:48d62fbb4c41450305e6b304e3704a5d82177023c6c626a3e0e7679c587637a6","observation_id":"49b26fe6-3db9-41f9-a5f1-d37c9024d8de","resolution":{"observed_at":"2026-08-07T04:22:54.045165Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:54.023709Z","title":"Sharper bounds for uni- formly stable algorithms","venue":null,"work_id":"9eb0bfce-3627-403a-8377-669c5a23b3c3","year":2020},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:50.584948Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:4c78a14603500f26392b7100e03c18cdd791dac3e389a4986b95f26310b6e1d2","observation_id":"25cd8f3c-2bd3-408e-930d-33bdb9f2e4e3","resolution":{"observed_at":"2026-08-07T04:22:54.027945Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:54.010104Z","title":"Olshen, and Charles J","venue":null,"work_id":"d05eaebe-d0ac-4980-8328-4d6ebf9189ab","year":1984},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:50.714875Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:998b7805e12d157c761ff9be39c6bd39123520d26a1be6079d389bb99bd1de7e","observation_id":"838f143e-384f-484a-a1be-544b1212d45c","resolution":{"observed_at":"2026-08-07T04:22:54.014360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.996355Z","title":"Making SGD parameter-free","venue":null,"work_id":"02019fa7-cd4e-4ec3-bc75-46349da75cb9","year":2022},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:50.811057Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:47f4f056ad64dcca4e03744547cd0a05e3d385d2b639257dc75f3f3057f5084f","observation_id":"376c10de-5f98-4f57-ac40-f3eb22f8743c","resolution":{"observed_at":"2026-08-07T04:22:54.000394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.10898","last_updated":"2024-06-27T14:04:51Z","snapshot_observed_at":"2026-07-06T17:31:21.158599Z","submitted_at":"2024-02-16T18:56:41Z","title":"The Price of Adaptivity in Stochastic Convex Optimization","version":3},"cited_work":{"arxiv_id":"2402.10898","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.10898","snapshot_observed_at":"2026-08-07T04:22:53.361625Z","title":"The Price of Adaptivity in Stochastic Convex Optimization","venue":"math.OC","work_id":"223c638b-0f2b-419a-8c1f-34ebd5074adc","year":2024},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:50.938543Z"},"links":{"cited_paper":"/paper/2402.10898","citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:6de90596aa32941f11a664521352215bff80d620d471534a4aaed3d2e667f45b","observation_id":"ac42d13c-460c-4527-8cac-9fc6b9947820","resolution":{"observed_at":"2026-08-07T04:22:53.368384Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.982225Z","title":"Better parameter-free stochastic optimization with ODE updates for coin-betting","venue":null,"work_id":"3585ad9c-774d-41d6-bcf9-28264324928a","year":2022},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:51.046109Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:c5c48cffeb2b78af283f747e06ef4634f95a44f2863f30a5d8b76fc97e6d375d","observation_id":"006282cc-93aa-4e23-a204-2bb23b9ea969","resolution":{"observed_at":"2026-08-07T04:22:53.986733Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.966945Z","title":"Artificial constraints and hints for unbounded online learning","venue":null,"work_id":"303c59c8-0e7f-403f-b79f-ea4ce30e3d6f","year":2019},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:51.139882Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:c394509135f872eb9e5152a2b12a15ed661d7646c858115ecffca54f124ddff8","observation_id":"420dd763-a0d1-4bfb-baa3-51cd0915dac8","resolution":{"observed_at":"2026-08-07T04:22:53.971811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.953322Z","title":"Black-box reductions for parameter-free online learning in banach spaces","venue":null,"work_id":"08ccf6ed-e760-4995-b8dc-078b2f7a8712","year":2018},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:51.261840Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:21508a52b8f418866b1736f68207620838eec5b073bbe7d4ef8d6b5ebe3fa100","observation_id":"86f8ac88-0792-46f8-a66c-92261ca22c8e","resolution":{"observed_at":"2026-08-07T04:22:53.957533Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.939451Z","title":"Learning-rate-free learning by D- adaptation","venue":null,"work_id":"581872bf-0431-4700-a9ac-e94fb5bfd865","year":2023},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:51.383771Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:886ed82bf0d7ed6dda837b6bd7773cdf21e8b7c6f466f1c6c43a3f9608470507","observation_id":"81543762-ac59-4fe8-9eb9-14d5a187e74e","resolution":{"observed_at":"2026-08-07T04:22:53.944082Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.925306Z","title":"An image is worth 16x16 words: Trans- formers for image recognition at scale","venue":null,"work_id":"db80222a-cb28-4996-b8ec-22aa937d1cfb","year":2021},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:51.489208Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:24a8102f230280b7884457954be0d83351b98442c99cd082a23f7557264f78bd","observation_id":"fe772f4e-e17e-4658-9d96-d87e49f6a33f","resolution":{"observed_at":"2026-08-07T04:22:53.930066Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.911271Z","title":"Adaptive subgradient methods for online learning and stochastic optimization","venue":null,"work_id":"a4742fea-2d7a-44bd-a5b0-8008dee04ae9","year":2011},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:51.588353Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:8b0c11ab304ed4d0373f6417943e36792c1f1c76ab5efd6ba36eac380a0bea3c","observation_id":"d3911f59-7614-4265-8f53-1e8c84aec01e","resolution":{"observed_at":"2026-08-07T04:22:53.915523Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.894976Z","title":"Data filtering networks","venue":null,"work_id":"40ba5663-6896-4989-8ae4-eede57e45a9e","year":2024},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:51.749154Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:0e06b1e1b6c731e6a286bf40c8e678e23b6af73bf6fee820adbdcd85e9f50d12","observation_id":"40f576e1-ac7d-4471-a867-db6b24445338","resolution":{"observed_at":"2026-08-07T04:22:53.900393Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1706.06569","last_updated":"2017-06-20T17:51:00Z","snapshot_observed_at":"2026-07-06T05:47:41.160272Z","submitted_at":"2017-06-20T17:51:00Z","title":"A Unified Approach to Adaptive Regularization in Online and Stochastic Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.06569","snapshot_observed_at":"2026-08-07T04:22:52.051694Z","title":"A unified approach to adaptive regu- larization in online and stochastic optimization","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:52.051694Z"},"links":{"cited_paper":"/paper/1706.06569","citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:c9f54a65af16f1e60da798bbf6264bd17717964cb747961a4619ca2d09049e8f","observation_id":"60bde1bc-eb81-4a74-82bd-d172e4170347","resolution":{"observed_at":"2026-08-07T04:22:52.051694Z","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-07T04:22:53.876321Z","title":"The Elements of Statistical Learning: Data Mining, Inference, and Prediction","venue":null,"work_id":"92ecac63-7bc2-41cc-87ff-aed67e7a2960","year":2009},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:52.218968Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:a2c767fcadb26bc886c091b0b28b172f2aa1cad94fe387fcbeef9d51e6ffcfda","observation_id":"65fb7dfd-737f-4d02-8e7d-22636f303e3a","resolution":{"observed_at":"2026-08-07T04:22:53.881693Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.859495Z","title":"Beyond the regret minimization barrier: optimal al- gorithms for stochastic strongly-convex optimization","venue":null,"work_id":"053e990a-a833-4e56-9728-d6af5b92aeaa","year":2014},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:52.381477Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:3859c62b1fa30dbad9fa82c8608cb2bac9166db885c75fb105c9a3ee05ba0c6e","observation_id":"51733f5b-00bb-4f25-8ec4-4352d6b1f01d","resolution":{"observed_at":"2026-08-07T04:22:53.864211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.843598Z","title":"Probability inequalities for sums of bounded random variables","venue":null,"work_id":"36b40d12-24cb-49c9-83a7-c3ef2b148094","year":1963},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:52.554657Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:f5c89f6d79575d6001c3ab0ef4949520bf9333a45ad7e1f23f76a961c21e9616","observation_id":"76574844-7dce-4cc3-a493-98a8f6201332","resolution":{"observed_at":"2026-08-07T04:22:53.847932Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.828150Z","title":"Time-uniform chernoff bounds via nonnegative supermartingales","venue":null,"work_id":"9b8d758a-b884-41f0-8e15-1acece4c2c1e","year":2020},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:52.632624Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:7350d8dd331c7d5bf24448b29bbfff69cc90b97c3f0124ab2ed76431525a536a","observation_id":"9a1fd5ed-9966-4f16-bf30-11413cecc273","resolution":{"observed_at":"2026-08-07T04:22:53.833257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.811851Z","title":"Pushing the limits of simple pipelines for few-shot learning: External data and fine-tuning make a difference","venue":null,"work_id":"b72fa7cb-0c13-47d3-806e-f1e140b65fa4","year":2022},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:52.780954Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:d8e382d7333ee7e8dbd555d9647aeb602683764d28667e7a772a8fe84b198035","observation_id":"5a3d0bdd-f371-4aa3-bd4c-329ff95845bb","resolution":{"observed_at":"2026-08-07T04:22:53.816354Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:52.919904Z","title":null,"venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:52.919904Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:b7c6442277caf0696649e2f3c8cd2cd0a3f02eda9a59af662d127edbeaa2fb0d","observation_id":"c8cf5c46-ea1c-4816-8eaf-0ef3c34f4294","resolution":{"observed_at":"2026-08-07T04:22:52.919904Z","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-07T04:22:52.982450Z","title":"Openclip, July 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:52.982450Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:76ab99220b8a93ee4b5bbf2b679c31eee40ddef76cfc70b003b941870d70ad6d","observation_id":"cd5385b2-8b3f-405a-b5dd-b6fb82a85c49","resolution":{"observed_at":"2026-08-07T04:22:52.982450Z","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-07T04:22:53.795038Z","title":"DoG is SGD’s best friend: A parameter-free dynamic step size schedule","venue":null,"work_id":"24002e23-d9cf-4a11-9b18-f1cb7b41207a","year":2023},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:52.987195Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:768b559b10b9642994f357798c49a65de9d97f177a675d7824283e6a6a1607b9","observation_id":"6fdf6703-76bd-4026-b689-ae437373ebbe","resolution":{"observed_at":"2026-08-07T04:22:53.800336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2001.08361","last_updated":"2020-01-23T03:59:20Z","snapshot_observed_at":"2026-07-06T08:52:12.656082Z","submitted_at":"2020-01-23T03:59:20Z","title":"Scaling Laws for Neural Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.08361","snapshot_observed_at":"2026-08-07T04:22:52.990964Z","title":"Scaling laws for neural language models","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:52.990964Z"},"links":{"cited_paper":"/paper/2001.08361","citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:6b045fe4ce14a1e43bf67413151ca5f37aa8d6240a83ca4691185d8b05250798","observation_id":"14b9f9c7-591e-4ff9-ab00-0cad79202753","resolution":{"observed_at":"2026-08-07T04:22:52.990964Z","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-07T04:22:53.778759Z","title":"Algorithmic stability and sanity-check bounds for leave- one-out cross-validation","venue":null,"work_id":"7988da95-0e8d-47fd-bc3c-1c25c07dc56b","year":1997},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:52.995489Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:d5a0ef14fa5bc37a50eb814ec43ffe33870ccf401508206cd81e5108ab2a0038","observation_id":"5ad41e8b-0d52-4a76-821d-df34fc609825","resolution":{"observed_at":"2026-08-07T04:22:53.783442Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.764036Z","title":"Adaptive scale- invariant online algorithms for learning linear models","venue":null,"work_id":"3ee2b1b0-6565-4ed8-9728-19b1d3eff4a4","year":2019},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:52.999654Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:ef070ccbfa75a9498ab1d927172ef530201569ba0265375be6f47199750774a9","observation_id":"a7c3ec8f-fe67-407a-bd7f-1af2a242d18c","resolution":{"observed_at":"2026-08-07T04:22:53.768856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.750031Z","title":"Tuning-free stochastic optimization","venue":null,"work_id":"a72239f6-9338-409d-bcad-b6a2f56cbbe7","year":2024},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:53.003773Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:82040195405c203d9b5b75d689db5eaf7ff9a1b1b6dc3a65534506174697aaef","observation_id":"200a28bc-de72-4815-ae13-371d23c970c1","resolution":{"observed_at":"2026-08-07T04:22:53.754547Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.733648Z","title":"On the upper bound for the absolute constant in the berry–esseen inequality","venue":null,"work_id":"e84104e1-2cfa-4ad8-a1f2-69bfbbb1f46f","year":2010},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:53.008418Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:52959cec96d111b448a6c8241d0b9bad8b6a174194fdeaea989d0822ee2687cc","observation_id":"76b9b8f8-7fb0-4a35-a72a-e7dad13814db","resolution":{"observed_at":"2026-08-07T04:22:53.738363Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.718872Z","title":"Accelerated parameter-free stochastic optimization","venue":null,"work_id":"681dc4ab-fb04-41b3-b3bc-5807c5a55572","year":2024},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:53.012560Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:72907267ed4bab0f9002ce6f9f26a651888cdbad424eb2c25364c2a28ac3fbe2","observation_id":"b333938e-dd4c-43bb-841e-4c63eb6a4c71","resolution":{"observed_at":"2026-08-07T04:22:53.723510Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.016863Z","title":"Learning multiple layers of features from tiny images","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:53.016863Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:f8f85eb9fdcc956d77acf4655dd614843a7d84150a49311c1884d71c87205076","observation_id":"3c1d3b01-7089-4790-ba84-450a3a890c42","resolution":{"observed_at":"2026-08-07T04:22:53.016863Z","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-07T04:22:53.691448Z","title":"Necessary and sufficient geometries for gradient meth- ods","venue":null,"work_id":"c2395367-7981-40bd-b4ac-607352ebe98b","year":2019},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:53.021170Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:177635b76802fcaa40152b1492c17c16d4b9b05210e50b074343b957a4d312cb","observation_id":"8e11b013-0042-4d1a-8544-9d6384abd5b4","resolution":{"observed_at":"2026-08-07T04:22:53.696966Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.673815Z","title":"Martingale methods for sequential estimation of convex functionals and divergences","venue":null,"work_id":"fa430acb-5034-4eef-bc08-30925f0e1975","year":2023},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:53.025306Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:bebe9ef673fe99402a8f823777f589681c412510f67348fa594eddfd3ab2b39f","observation_id":"eef8ef2e-a2c4-48ac-ae41-78c8fec7b8f9","resolution":{"observed_at":"2026-08-07T04:22:53.678493Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.659389Z","title":"Empirical Bernstein bounds and sample variance penalization","venue":null,"work_id":"4dfe8205-f850-46d8-b37b-3b80f4a20720","year":2009},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:53.029378Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:316ddfa648a79159b0da808efef785a0c762c12e60c35e24ef610db2e6252dd5","observation_id":"bdaebf94-3882-4306-9f90-1ddb3fd52137","resolution":{"observed_at":"2026-08-07T04:22:53.663580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.644719Z","title":"pandas: a foundational python library for data analysis and statistics","venue":null,"work_id":"e48028d6-a333-48e7-979d-4771e347b729","year":2011},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:53.033411Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:f32f4e6ab70986971d73f2369b01ccfd2bd6456bd868ce6cb124c5e7713bc7c2","observation_id":"8a783177-cbbd-4a31-b693-912bcdaba0ad","resolution":{"observed_at":"2026-08-07T04:22:53.649734Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.630984Z","title":"Unconstrained online linear learning in Hilbert spaces: Minimax algorithms and normal approximations","venue":null,"work_id":"8dc53091-7b8b-4331-a3ac-d203cc57fa70","year":2014},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:53.037448Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:c30b38bd622be1d77a563a797232085452a9aee55365bdf40341afc04b8d9dc4","observation_id":"6cb43d48-f7c5-412f-9211-08d388f970a9","resolution":{"observed_at":"2026-08-07T04:22:53.635271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.617092Z","title":"Adaptive bound optimization for online convex optimization","venue":null,"work_id":"5c0ac21d-9cdd-44bb-913e-1405b74bde97","year":2010},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:53.041514Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:d3e2fa8dd2b0b68c69eb5c6304fd806db4bb4982be91f97ad17c96b483ea7c2b","observation_id":"ea8f70a3-cea5-4016-9dac-6eeee69effdc","resolution":{"observed_at":"2026-08-07T04:22:53.621508Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.602821Z","title":"The effect of natural distribution shift on question answering models","venue":null,"work_id":"2811e720-7fe5-4a4b-b4bc-0580d76af712","year":2020},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:53.045663Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:8c159d8aa2c2be9887ea9fa4e97273541a9fa5ebab0740ea61c82c8e0346c739","observation_id":"1b0e7401-2879-4f19-85c6-b19b53f0d4f6","resolution":{"observed_at":"2026-08-07T04:22:53.607096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.589527Z","title":"Proximity and duality in a hilbertian space","venue":null,"work_id":"1e5f0f2f-fc99-441c-acda-8672a6ce4be6","year":1965},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:53.049536Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:b3f23fc61e6cec4343327281f174a581991644dda803e640cfb35ef43ed417d0","observation_id":"cb1427ac-b498-4411-b564-40f1b759ff8c","resolution":{"observed_at":"2026-08-07T04:22:53.593776Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.576304Z","title":"word2number, 2014","venue":null,"work_id":"4fbf6211-7795-4b20-ab5d-00fe8066ed59","year":2014},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:53.053635Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:f70c01899d91c46a878b0f9da291ae7b747d0a9f71740f98edef6cb1f89af6f1","observation_id":"326b3384-c657-43a9-8976-81977d043708","resolution":{"observed_at":"2026-08-07T04:22:53.580562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.561976Z","title":"Problem complexity and method efficiency in optimization","venue":null,"work_id":"86bdabcb-be40-4237-b0da-0db79bfdb9ec","year":1983},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:53.057692Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:ea6feecd931248d068c7231909e0985ce8f9d54262c7c586c8ef53f1083903a8","observation_id":"bef51c10-fdc4-45f4-84e9-503a1da5ce41","resolution":{"observed_at":"2026-08-07T04:22:53.566650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.13213","last_updated":"2026-06-21T08:13:27Z","snapshot_observed_at":"2026-07-06T08:47:45.187408Z","submitted_at":"2019-12-31T08:16:31Z","title":"Online Learning: A Modern Introduction Using Convex Optimization","version":10},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.13213","snapshot_observed_at":"2026-08-07T04:22:53.061986Z","title":"A modern introduction to online learning","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:53.061986Z"},"links":{"cited_paper":"/paper/1912.13213","citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:067ddf87216e6ea9aa203278778307ace774211b5f4bb2f7ceb3a78a4e3f2e30","observation_id":"739a5f00-f398-41bc-9fdb-6603e0a8da1f","resolution":{"observed_at":"2026-08-07T04:22:53.061986Z","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-07T04:22:53.548910Z","title":"Training deep networks without learning rates through coin betting","venue":null,"work_id":"11c2ced2-816b-457c-ad4d-42bb7494b60f","year":2017},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:53.066483Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:8590c1486ed1093ce98cceab96739387e3c004952ba0d64b7415dfbf750d3210","observation_id":"bfdd2e0a-e7cc-453a-912c-d7fea1b039f9","resolution":{"observed_at":"2026-08-07T04:22:53.552996Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.534143Z","title":"Py- Torch: An imperative style, high-performance deep learning library","venue":null,"work_id":"c128205e-49a8-4b2e-bedc-9539c3502dc1","year":2019},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:53.070781Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:68023bb16ad28c1fa498eb0b70f980cba7bbff4473cd379fcef7da97a121a78a","observation_id":"efbb2e34-d006-415b-9ae2-e446626d46cf","resolution":{"observed_at":"2026-08-07T04:22:53.539617Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.520333Z","title":"Learning transferable visual models from natural language supervision","venue":null,"work_id":"58836398-6701-4029-8f5c-27cb802976eb","year":2021},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:53.074690Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:3830d0d86a128b94035519847302f40e5ce6dbb6c7628238f97947b970e0d1cf","observation_id":"26d63249-140d-434a-b6d7-83cf39b3364b","resolution":{"observed_at":"2026-08-07T04:22:53.525302Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.506775Z","title":"Do imagenet classifiers generalize to imagenet? In International conference on machine learning , pages 5389–5400","venue":null,"work_id":"df8f3fa0-d5ba-442e-9735-151650a8d29c","year":2019},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:53.078485Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:b5a0be4b63d3c23af8bf5a2488279d3b92af3001459b9f30d9f0b75c94cb61bc","observation_id":"9e370265-71dd-48e8-bee7-406caad03635","resolution":{"observed_at":"2026-08-07T04:22:53.510971Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.492828Z","title":"A meta-analysis of overfitting in machine learning","venue":null,"work_id":"505fc39e-de50-44ab-8c2c-588cdbf49100","year":2019},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:53.081974Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:2820da9f20a0f922135abb721d2d07102c57bb27ee48eeea75504eb2c63af43b","observation_id":"9766970a-fd96-4c1f-84ca-4069a3d5972c","resolution":{"observed_at":"2026-08-07T04:22:53.497288Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.05530","last_updated":"2024-12-16T17:39:39Z","snapshot_observed_at":"2026-07-06T17:41:42.995949Z","submitted_at":"2024-03-08T18:54:20Z","title":"Gemini 1.5: Unlocking multimodal understanding across millions of tokens of context","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.05530","snapshot_observed_at":"2026-08-07T04:22:53.085499Z","title":"Gemini 1.5: Unlock- ing multimodal understanding across millions of tokens of context","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:53.085499Z"},"links":{"cited_paper":"/paper/2403.05530","citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:ec18e8d068ffd59e6dfe05303394c548d38a45b94343cc5af4f29dbf63cb5eaa","observation_id":"ebc237fe-3ce4-4fab-afa0-625457c7affc","resolution":{"observed_at":"2026-08-07T04:22:53.085499Z","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-07T04:22:53.479044Z","title":"An overview of statistical learning theory","venue":null,"work_id":"ae143e5f-6f2e-4986-bdc5-d10d407413fc","year":1999},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:53.089856Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:46c5df3940b588621d6ebcdbf18049c35a468b7fcb561953f9446a2c61d4d5cc","observation_id":"547f8ec2-9113-4e75-bd3f-889f386d5587","resolution":{"observed_at":"2026-08-07T04:22:53.483610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.093597Z","title":"Welcome to the tidyverse","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:53.093597Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:291e8d18437b7339af7dce1a51f73cb3698a53b30f084fb7e5cab7c64595ca01","observation_id":"7426c32e-7b2a-479f-b40f-d5c7feff80a1","resolution":{"observed_at":"2026-08-07T04:22:53.093597Z","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-07T04:22:53.465224Z","title":"Cold case: The lost MNIST digits.Advances in neural information processing systems, 32, 2019","venue":null,"work_id":"a374caf3-89e9-4c31-b59b-d87cd31f7291","year":2019},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:53.097597Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:19d25d6d6a15246df22e9a517635807b49fa1d154553461cc638e08c60319cd5","observation_id":"038b1f82-33d0-496e-9d60-6121dc78f58b","resolution":{"observed_at":"2026-08-07T04:22:53.469443Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.450158Z","title":"[22] withYt = 1 n Pt i=1(Vi −ν), ct = H/n, Ψ(·) = ∥·∥ 2, D = 1, m = H 2/n, x = p (m/2) ln 2/δ, we get that with probability 1 − δ that ∥ ¯V − ν∥2 ≤ H r 2 ln(2/δ) n","venue":null,"work_id":"dc086c03-02ad-48f7-a921-44af0e4b39fb","year":null},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:53.101628Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:3395b21ce61f2887765944806afa443160a3c7abda702beabb9d32115746e61b","observation_id":"7f907157-283d-46c6-9bbf-a8b0a75d0fad","resolution":{"observed_at":"2026-08-07T04:22:53.455494Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.435437Z","title":null,"venue":null,"work_id":"a3153a20-c227-4da2-b6ef-2b571558603f","year":null},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:53.105851Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:2d9cf0711163e253b74ba31c4c53959892e3e79987afc50dc8730019bf8e614f","observation_id":"d655b602-a4e6-4311-a408-822035ad6523","resolution":{"observed_at":"2026-08-07T04:22:53.439959Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.421442Z","title":"37 Figure 4: A sample of images, generated by the outlined process, that were presented to Gemini showcasing all 15 backgrounds","venue":null,"work_id":"69c0032c-588e-4f1c-97b0-db26080c6d4e","year":null},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:53.109722Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:2d8d235e797e151f84f64429c1ddb7d0b9fecae203e59ceb635eedf0a119d7d7","observation_id":"e92eb466-8189-471c-b4d2-5294dd0df805","resolution":{"observed_at":"2026-08-07T04:22:53.426084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.407331Z","title":"} and within square brackets [","venue":null,"work_id":"e4fe85fc-6d5a-4266-af4c-046b58c9e61f","year":null},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:53.113955Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:14672f90afc4870248326ac83c991c870fdd728a7d63603452d19d89caced575","observation_id":"be4bf44f-f005-44e9-bc2b-09372edce7a6","resolution":{"observed_at":"2026-08-07T04:22:53.411462Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.392366Z","title":"The first successful conversion is returned, or 0 otherwise","venue":null,"work_id":"2e70aeee-cab7-40cb-bdd9-ae2a1a74d8b0","year":null},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:53.117893Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:0917add33ef9eeaff3b3874ca5b85b508e5549c830418312f755a1d084234ba1","observation_id":"5899d529-9f04-4523-b8c5-8d9b1e73c069","resolution":{"observed_at":"2026-08-07T04:22:53.396891Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:22:53.378313Z","title":"3 circles, 2 squares, 1 star","venue":null,"work_id":"8ea0f586-43a2-4ed7-836e-e7c59e7fe482","year":null},"citing_paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:53.121791Z"},"links":{"citing_paper":"/paper/2506.11336"},"observation_digest":"sha256:1f2b66bebe62ca373ce836752a4f698b8e7169071288402d49d8f5076e7c20b8","observation_id":"fe5ee6a9-a055-47ec-aa0e-104dec3148c0","resolution":{"observed_at":"2026-08-07T04:22:53.382216Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.11336","last_updated":"2026-06-08T16:05:40Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T04:08:34.386024Z","submitted_at":"2025-06-12T22:14:49Z","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization"},"reference_resolution":{"displayed":59,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":1,"verified_fuzzy":49},"total_outbound_references":59},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 59 of 59 outbound references and 1 inbound Pith citation observation for arXiv:2506.11336."}