Pith. sign in

Paper Citation Record · LEDGER

Taking the Road Less Scheduled with Adaptive Polyak Steps

As of 3 August 2026, this Paper Citation Record lists 10 of 10 outbound references and 1 inbound Pith citation observation for arXiv:2511.07767.

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

pith.paper-citation-record.v1
2511.07767 v2

Coverage vector

measured 10 of 10 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-05-17T23:17:34.914457Z

measured 11 of 11 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-03T06:30:56.289259+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-07-14T08:04:06.432613Z

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

10 of 10 outbound references displayed

  • verified exact4
  • verified fuzzy3
  • unresolved1
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch2

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 0cb2a3a8-a1f6-4130-a392-df937fbdb7af · outbound

This paper cites Analysis of Schedule-Free Nonconvex Optimization.

Taking the Road Less Scheduled with Adaptive Polyak Steps Analysis of Schedule-Free Nonconvex Optimization

Reference 1

Resolution
verified exact
arxiv_id, observed 2026-05-17T23:20:27.670616Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.

source=pdf_text observed=2026-05-17T23:17:34.914457Z digest=sha256:296a7e1b666543bb6d2a8d497ff8de5f0288c272828ce4ab14b3be5cd83e6e97

Observation 40131a86-20e5-4a41-9aeb-9c4b91d16687 · outbound

This paper cites Optimal Linear Decay Learning Rate Schedules and Further Refinements.

Taking the Road Less Scheduled with Adaptive Polyak Steps Optimal Linear Decay Learning Rate Schedules and Further Refinements

Reference 2

Resolution
verified exact
arxiv_id, observed 2026-05-17T23:20:27.656986Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.

source=pdf_text observed=2026-05-17T23:17:34.914457Z digest=sha256:c5ae8081677ab1f62dc141da74359f8138438786721f2226a828bbfdc9c0eb25

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

This paper cites Revisiting the Polyak step size.

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-03T06:30:56.289259+00:00.

source=pdf_text observed=2026-05-17T23:17:34.914457Z digest=sha256:4070826ecf1d33461c3c4d9daa44d8779ac56f0c8b9051b0302a41f220014b57

Observation 83f267ac-c01c-45d5-a2c6-48429b8b73df · outbound

This paper cites Adam: A Method for Stochastic Optimization.

Taking the Road Less Scheduled with Adaptive Polyak Steps Adam: A Method for Stochastic Optimization

Reference 4

Resolution
verified exact
local_arxiv, observed 2026-05-17T23:20:27.661283Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.

source=pdf_text observed=2026-05-17T23:17:34.914457Z digest=sha256:092060042f15868a60263d9396145f233c2067bb864640f02226282fa3e5c763

Observation 70482cb0-1ab9-484b-bb32-05ad4accc180 · outbound

This paper cites Stochastic Polyak Step-size for SGD: An Adaptive Learning Rate for Fast Convergence.

Taking the Road Less Scheduled with Adaptive Polyak Steps Stochastic Polyak Step-size for SGD: An Adaptive Learning Rate for Fast Convergence

Reference 5

Resolution
verified exact
arxiv_id, observed 2026-05-17T23:20:27.665986Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.

source=pdf_text observed=2026-05-17T23:17:34.914457Z digest=sha256:1491e31a2d185ce3a3d9f5d4d276b05e6241302ccd9a71ef16461365468fd251

Observation 0158fb66-6af1-48d3-9c8e-ce2711480af9 · outbound

This paper cites Stochastic Polyak Step-sizes and Momentum: Convergence Guarantees and Practical Performance.

Taking the Road Less Scheduled with Adaptive Polyak Steps Stochastic Polyak Step-sizes and Momentum: Convergence Guarantees and Practical Performance

Reference 6

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

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.

source=pdf_text observed=2026-05-17T23:17:34.914457Z digest=sha256:3aa6c7ac08612d8dc72e70ca86d8c318993684865e2c72140e9f7349a0672129

Observation 14cf1a28-79f0-4f87-9f8a-26e502d0683b · outbound

This paper cites 2 1.2 Contributions and Background.

Taking the Road Less Scheduled with Adaptive Polyak Steps 2 1.2 Contributions and Background

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-05-17T23:20:28.461794Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.

source=pdf_text observed=2026-05-17T23:17:34.914457Z digest=sha256:d6a48ca701f6cff7b813374b56d148bf2ee83eb9cca0b1b27cf5788fceb60bcd

Observation 701e86da-37f1-4132-808b-97587a2599df · outbound

This paper cites TX t=1 wt⟨gt,z t −x ⋆⟩ # =E.

Taking the Road Less Scheduled with Adaptive Polyak Steps TX t=1 wt⟨gt,z t −x ⋆⟩ # =E

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-05-17T23:20:28.468837Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.

source=pdf_text observed=2026-05-17T23:17:34.914457Z digest=sha256:016ad915e89947864f6e96c1d8e522e44413ac188d36fab1759d4172c47961f4

Observation 588aee9c-543f-4d5b-8139-33f704d79661 · outbound

This paper cites As mentioned in Section 4, this is to avoid the complication of writing custom BatchNorm code to approximate batch statistics of thexsequence ofSchedule-free.

Taking the Road Less Scheduled with Adaptive Polyak Steps As mentioned in Section 4, this is to avoid the complication of writing custom BatchNorm code to approximate batch statistics of thexsequence ofSchedule-free

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-05-17T23:20:28.465447Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.

source=pdf_text observed=2026-05-17T23:17:34.914457Z digest=sha256:b9c15f93d868326c7445567d88377f5b2e5d34c15f80e11293c99c9326b4be22

Observation f9d6f0b2-736e-4c59-9381-6cf2af32e7c3 · outbound

This paper cites an unresolved cited work.

Taking the Road Less Scheduled with Adaptive Polyak Steps Unresolved cited work

Reference 10

Resolution
unresolved
raw_fallback, observed 2026-05-17T23:20:28.458597Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.

source=pdf_text observed=2026-05-17T23:17:34.914457Z digest=sha256:cf1d666622ad766045c14660551d6a20699a40d39597187fa1eb308ea2b49e49

Pith citing papers

Observation 59937c91-802e-4155-afeb-3c5d252efd55 · inbound

WSqD: A Horizon-Free Learning Rate Schedule for Large Model Training cites this paper.

WSqD: A Horizon-Free Learning Rate Schedule for Large Model Training Taking the Road Less Scheduled with Adaptive Polyak Steps

Reference 54

Resolution
unresolved
no resolver link, observed 2026-07-14T08:04:06.432613Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-14T08:04:06.432613Z digest=sha256:149f9bbb1a04f267243ce743db2118a4cfdc27ad9143fdf325c220a3fb79dcb2