Paper Citation Record · LEDGER

Revisiting the Polyak step size

As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 15 inbound Pith citation observations for arXiv:1905.00313.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
1905.00313 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 15 of 15 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-09T06:31:02.800959+00:00

measured 15 of 15 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-07T13:10:09.962195Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-07-04T06:59:37.573960Z

Reference resolution

0 of 0 outbound references displayed

verified exact0
verified fuzzy0
unresolved0
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 646bff14-c432-4b12-8f50-d88818f8d5d7 · inbound

Uniformly Optimal and Parameter-free First-order Methods for Convex and Function-constrained Optimization cites this paper.

Uniformly Optimal and Parameter-free First-order Methods for Convex and Function-constrained Optimization Revisiting the Polyak step size

Reference 17

Resolution: verified exact; arxiv_id, observed 2026-05-23T07:42:42.941700Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 830e8eff-9523-47ee-986c-3c8d79cc32c5 · inbound

Gradient Methods with Online Scaling Part I. Theoretical Foundations cites this paper.

Gradient Methods with Online Scaling Part I. Theoretical Foundations Revisiting the Polyak step size

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-07T13:10:09.962195Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e4b572fb-421f-4531-bfde-433b0ebf10b9 · inbound

Stein Diffusion Guidance: Training-Free Posterior Correction for Sampling Beyond High-Density Regions cites this paper.

Stein Diffusion Guidance: Training-Free Posterior Correction for Sampling Beyond High-Density Regions Revisiting the Polyak step size

Reference 12

Resolution: metadata mismatch; arxiv_id, observed 2026-05-22T00:14:27.745331Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation bbd06d20-371f-4e35-8d39-f5a4d6d8f595 · inbound

Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization cites this paper.

Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization Revisiting the Polyak step size

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-06T17:59:06.331920Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e607a1ba-7829-44b6-bd5f-047daea1bc44 · inbound

Simple Optimizers for Convex Aligned Multi-Objective Optimization cites this paper.

Simple Optimizers for Convex Aligned Multi-Objective Optimization Revisiting the Polyak step size

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-05T05:05:47.733519Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ad572987-0329-47f2-9c3a-459330515b2e · inbound

Taking the Road Less Scheduled with Adaptive Polyak Steps cites this paper.

Taking the Road Less Scheduled with Adaptive Polyak Steps Revisiting the Polyak step size

Reference 3

Resolution: metadata mismatch; arxiv_id, observed 2026-05-17T23:20:27.652905Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation e5d28cd5-7d6b-49d0-af3e-c23073758738 · inbound

Safeguarded Stochastic Polyak Step Sizes for Non-smooth Optimization: Robust Performance Without Small (Sub)Gradients cites this paper.

Safeguarded Stochastic Polyak Step Sizes for Non-smooth Optimization: Robust Performance Without Small (Sub)Gradients Revisiting the Polyak step size

Reference 2009

Resolution: unresolved; no resolver link, observed 2026-08-03T19:10:48.457152Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ec352a9b-0355-4212-901d-d28eb70854dd · inbound

A short proof of near-linear convergence of adaptive gradient descent under fourth-order growth and convexity cites this paper.

A short proof of near-linear convergence of adaptive gradient descent under fourth-order growth and convexity Revisiting the Polyak step size

Reference 8

Resolution: verified exact; arxiv_id, observed 2026-05-10T13:40:27.350076Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation cd5a610b-f887-4b19-b775-5744e014afc7 · inbound

Fix the Loss, Not the Radius: Rethinking the Adversarial Perturbation of Sharpness-Aware Minimization cites this paper.

Fix the Loss, Not the Radius: Rethinking the Adversarial Perturbation of Sharpness-Aware Minimization Revisiting the Polyak step size

Reference 31

Resolution: metadata mismatch; arxiv_id, observed 2026-05-12T06:26:23.386341Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 17bd5c80-0287-4cdb-8ad1-9f77f7e14573 · inbound

Adaptive Sharpness-Aware Minimization with a Polyak-type Step size: A Theory-Grounded Scheduler cites this paper.

Adaptive Sharpness-Aware Minimization with a Polyak-type Step size: A Theory-Grounded Scheduler Revisiting the Polyak step size

Reference 7

Resolution: verified exact; arxiv_id, observed 2026-07-02T00:06:23.893278Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation da2944f6-952c-4281-a30d-bb0e37acee2c · inbound

Introduction to stochastic gradient methods cites this paper.

Introduction to stochastic gradient methods Revisiting the Polyak step size

Reference 18

Resolution: metadata mismatch; arxiv_id, observed 2026-07-02T04:56:38.507896Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 55cc2e41-8829-4821-a7d7-c4d5910f1f3f · inbound

Large-scale empirical tuning and comparison of default optimizers for variational inference cites this paper.

Large-scale empirical tuning and comparison of default optimizers for variational inference Revisiting the Polyak step size

Reference 43

Resolution: metadata mismatch; arxiv_id, observed 2026-07-02T20:57:23.296734Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation ec36a56a-3b9c-4b04-b1ce-99fe9d0269b8 · inbound

Restart and Adaptive Acceleration in Stochastic Gradient Methods cites this paper.

Restart and Adaptive Acceleration in Stochastic Gradient Methods Revisiting the Polyak step size

Reference 133

Resolution: metadata mismatch; arxiv_id, observed 2026-07-04T06:59:37.575443Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

Observation 5b556308-7a59-4df8-abee-42a4691812e6 · inbound

Normalized First-Order Methods for Convex (L0, L1)-Smooth Optimization with Inexact Gradients cites this paper.

Normalized First-Order Methods for Convex (L0, L1)-Smooth Optimization with Inexact Gradients Revisiting the Polyak step size

Reference 4

Resolution: unresolved; no resolver link, observed 2026-07-30T15:28:01.799579Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 200ba93d-aced-47b3-aef4-d3b88a3665b7 · inbound

Discrete-Time Adaptive Control in High Dimensions: Near Dimension-Free Performance via Mirror Descent cites this paper.

Discrete-Time Adaptive Control in High Dimensions: Near Dimension-Free Performance via Mirror Descent Revisiting the Polyak step size

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-04T10:42:02.988308Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.