Paper Citation Record · LEDGER

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles

As of 7 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 0 inbound Pith citation observations for arXiv:2607.09167.

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

pith.paper-citation-record.v1
2607.09167 v1

Coverage vector

measured 36 of 36 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-13T04:58:09.207999Z

measured 36 of 36 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

36 of 36 outbound references displayed

verified exact0
verified fuzzy0
unresolved34
parse uncertain0
malformed identifier2
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 3c1445de-4521-41e0-81cc-2a0d2450a764 · outbound

This paper cites The exact worst-case conver- gence rate of the gradient method with fixed step lengths for L-smooth functions.Optimization Letters, 16(6):1649–1661, 2022.

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles The exact worst-case conver- gence rate of the gradient method with fixed step lengths for L-smooth functions.Optimization Letters, 16(6):1649–1661, 2022

Reference 1

Resolution: unresolved; no resolver link, observed 2026-07-13T04:58:09.207999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 41479527-9518-4b55-af31-fa113d60fd6d · outbound

This paper cites General framework for online-to- nonconvex conversion: Schedule-free SGD is also effective for nonconvex optimization.

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles General framework for online-to- nonconvex conversion: Schedule-free SGD is also effective for nonconvex optimization

Reference 2

Resolution: unresolved; no resolver link, observed 2026-07-13T04:58:09.207999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 465627dc-a41f-490e-b7d4-061a583e1176 · outbound

This paper cites Duchi, Dylan J.

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles Duchi, Dylan J

Reference 3

Resolution: unresolved; no resolver link, observed 2026-07-13T04:58:09.207999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1b545073-6859-45b1-a418-8b10236c7caa · outbound

This paper cites Analysis of Schedule-Free non-convex optimiza- tion.

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles Analysis of Schedule-Free non-convex optimiza- tion

Reference 4

Resolution: unresolved; no resolver link, observed 2026-07-13T04:58:09.207999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation af6dfdb9-685f-4d43-b04b-f8462807d15f · outbound

This paper cites Duchi, Oliver Hinder, and Aaron Sidford.

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles Duchi, Oliver Hinder, and Aaron Sidford

Reference 5

Resolution: unresolved; no resolver link, observed 2026-07-13T04:58:09.207999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b8a6ef9d-b4cd-47d1-9490-54f466866382 · outbound

This paper cites Zico Kolter, and Ameet Talwalkar.

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles Zico Kolter, and Ameet Talwalkar

Reference 6

Resolution: unresolved; no resolver link, observed 2026-07-13T04:58:09.207999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0a55b7ef-b1d6-4535-8ab8-e35fd122714c · outbound

This paper cites Benchmarking Neural Network Training Algorithms.

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles Benchmarking Neural Network Training Algorithms

Reference 7

Resolution: unresolved; no resolver link, observed 2026-07-13T04:58:09.207999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0f0c96b3-181e-48ca-b41a-c414d3cbe6b2 · outbound

This paper cites Momentum via Primal Averaging: Theoretical Insights and Learning Rate Schedules for Non-Convex Optimization.

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles Momentum via Primal Averaging: Theoretical Insights and Learning Rate Schedules for Non-Convex Optimization

Reference 8

Resolution: unresolved; no resolver link, observed 2026-07-13T04:58:09.207999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5ba1628b-61c0-4694-8078-7a87494d7d61 · outbound

This paper cites The road less scheduled.Advances in Neural Information Processing Systems, 37, 2024.

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles The road less scheduled.Advances in Neural Information Processing Systems, 37, 2024

Reference 9

Resolution: unresolved; no resolver link, observed 2026-07-13T04:58:09.207999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 772e9ccb-e639-4ea7-9e2a-e448f82fe6d2 · outbound

This paper cites an unresolved cited work.

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles Unresolved cited work

Reference 10

Resolution: unresolved; no resolver link, observed 2026-07-13T04:58:09.207999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 912dba95-d907-42ef-9fb8-959781bf570a · outbound

This paper cites The complexity of finding stationary points with stochastic gradient descent.

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles The complexity of finding stationary points with stochastic gradient descent

Reference 11

Resolution: unresolved; no resolver link, observed 2026-07-13T04:58:09.207999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 631b0d67-d679-4b1c-a18b-929372b79b12 · outbound

This paper cites Performance of first-order methods for smooth convex mini- mization: a novel approach.Mathematical Programming, 145(1):451–482, 2014.

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles Performance of first-order methods for smooth convex mini- mization: a novel approach.Mathematical Programming, 145(1):451–482, 2014

Reference 12

Resolution: unresolved; no resolver link, observed 2026-07-13T04:58:09.207999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4d582068-8d61-4301-91f7-7af178250786 · outbound

This paper cites Stochastic first-and zeroth-order methods for nonconvex stochastic programming.SIAM Journal on Optimization, 23(4):2341–2368, 2013.

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles Stochastic first-and zeroth-order methods for nonconvex stochastic programming.SIAM Journal on Optimization, 23(4):2341–2368, 2013

Reference 13

Resolution: unresolved; no resolver link, observed 2026-07-13T04:58:09.207999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8a5f73ef-244b-4caf-9ba3-a16d0e554f5e · outbound

This paper cites Hendrickx, Adrien B.

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles Hendrickx, Adrien B

Reference 14

Resolution: unresolved; no resolver link, observed 2026-07-13T04:58:09.207999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c55cb825-b2df-4d6e-94fd-7d9cd02d74d5 · outbound

This paper cites Vetrov, and Andrew Gordon Wilson.

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles Vetrov, and Andrew Gordon Wilson

Reference 15

Resolution: unresolved; no resolver link, observed 2026-07-13T04:58:09.207999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation af612877-dc38-4ff5-b2f1-94a9a45d802d · outbound

This paper cites Better theory for SGD in the nonconvex world.Transactions on Machine Learning Research, 2023.

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles Better theory for SGD in the nonconvex world.Transactions on Machine Learning Research, 2023

Reference 16

Resolution: unresolved; no resolver link, observed 2026-07-13T04:58:09.207999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0cb09fa6-2767-4607-9500-9f7ab67cf4cd · outbound

This paper cites Kingma and Jimmy Lei Ba.

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles Kingma and Jimmy Lei Ba

Reference 17

Resolution: unresolved; no resolver link, observed 2026-07-13T04:58:09.207999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 94d87cd3-11e9-47f4-ba0c-3063bff34bd9 · outbound

This paper cites Lee, Ioannis Panageas, Georgios Piliouras, Max Simchowitz, Michael I.

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles Lee, Ioannis Panageas, Georgios Piliouras, Max Simchowitz, Michael I

Reference 18

Resolution: unresolved; no resolver link, observed 2026-07-13T04:58:09.207999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 97cb24f2-0bb1-4df1-b79f-3fb33fb1a605 · outbound

This paper cites Loss landscapes and optimization in over- parameterized non-linear systems and neural networks.Applied and Computational Harmonic Analysis, 59:85–116, 2022.

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles Loss landscapes and optimization in over- parameterized non-linear systems and neural networks.Applied and Computational Harmonic Analysis, 59:85–116, 2022

Reference 19

Resolution: unresolved; no resolver link, observed 2026-07-13T04:58:09.207999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ee9fdcaa-e780-4f8b-994a-2c83bb3d3b60 · outbound

This paper cites Decoupled weight decay regularization.

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles Decoupled weight decay regularization

Reference 20

Resolution: unresolved; no resolver link, observed 2026-07-13T04:58:09.207999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 68135acb-3b5d-47ec-840b-ce8077fd8788 · outbound

This paper cites Exponential moving average of weights in deep learning: Dynamics and benefits.Transactions on Machine Learning Research, 2024.

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles Exponential moving average of weights in deep learning: Dynamics and benefits.Transactions on Machine Learning Research, 2024

Reference 21

Resolution: unresolved; no resolver link, observed 2026-07-13T04:58:09.207999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fb99c1f4-ee91-4d45-b5bb-1f7c028d55d8 · outbound

This paper cites Connections between Schedule- Free optimizers and accelerated SGD variants.

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles Connections between Schedule- Free optimizers and accelerated SGD variants

Reference 22

Resolution: unresolved; no resolver link, observed 2026-07-13T04:58:09.207999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ccfaa9d3-95ab-4baa-8c94-73276766c525 · outbound

This paper cites A non-autonomous center-stable set theorem for saddle avoidance in optimization.

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles A non-autonomous center-stable set theorem for saddle avoidance in optimization

Reference 23

Resolution: unresolved; no resolver link, observed 2026-07-13T04:58:09.207999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9c7faeb9-82cf-417f-983d-15e2cdd21695 · outbound

This paper cites Quasi-monotone subgradient methods for nonsmooth convex minimization.Journal of Optimization Theory and Applications, 165(3):917–940, 2015.

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles Quasi-monotone subgradient methods for nonsmooth convex minimization.Journal of Optimization Theory and Applications, 165(3):917–940, 2015

Reference 24

Resolution: unresolved; no resolver link, observed 2026-07-13T04:58:09.207999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9fd86724-a89d-4b26-adcd-12c498091e13 · outbound

This paper cites Iterate averaging as regularization for stochastic gradient descent.

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles Iterate averaging as regularization for stochastic gradient descent

Reference 25

Resolution: unresolved; no resolver link, observed 2026-07-13T04:58:09.207999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b38c2ee9-8195-421a-898d-c7a3749540b8 · outbound

This paper cites an unresolved cited work.

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles Unresolved cited work

Reference 26

Resolution: unresolved; no resolver link, observed 2026-07-13T04:58:09.207999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5744f804-8a3c-4483-9e81-5624d6be56df · outbound

This paper cites an unresolved cited work.

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles Unresolved cited work

Reference 27

Resolution: unresolved; no resolver link, observed 2026-07-13T04:58:09.207999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fe1f2437-f245-44a7-88ce-a4f842e8e417 · outbound

This paper cites Efficient estimations from a slowly convergent Robbins–Monro process.

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles Efficient estimations from a slowly convergent Robbins–Monro process

Reference 28

Resolution: unresolved; no resolver link, observed 2026-07-13T04:58:09.207999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bd12b555-936e-479e-9df5-d67b62d0c8c7 · outbound

This paper cites Ryu, Adrien B.

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles Ryu, Adrien B

Reference 29

Resolution: unresolved; no resolver link, observed 2026-07-13T04:58:09.207999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 13f3c193-2cd5-4927-82e5-044b1efca981 · outbound

This paper cites Through the river: Under- standing the benefit of Schedule-Free methods for language model training.Advances in Neural Information Processing Systems, 38, 2025.

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles Through the river: Under- standing the benefit of Schedule-Free methods for language model training.Advances in Neural Information Processing Systems, 38, 2025

Reference 30

Resolution: unresolved; no resolver link, observed 2026-07-13T04:58:09.207999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b2147132-18b8-4771-a8c5-dfbfca01a72e · outbound

This paper cites Primal averaging: A new gradient evaluation step to attain the optimal individual convergence.IEEE Transactions on Cybernetics, 50(2): 835–845, 2018.

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles Primal averaging: A new gradient evaluation step to attain the optimal individual convergence.IEEE Transactions on Cybernetics, 50(2): 835–845, 2018

Reference 31

Resolution: unresolved; no resolver link, observed 2026-07-13T04:58:09.207999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a0478881-c227-4f56-8687-b9086f3d91d1 · outbound

This paper cites Taylor, Julien M.

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles Taylor, Julien M

Reference 32

Resolution: unresolved; no resolver link, observed 2026-07-13T04:58:09.207999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d048f239-426b-4751-8d73-45a822c5cb91 · outbound

This paper cites Understanding warmup-stable-decay learning rates: A river valley loss landscape view.

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles Understanding warmup-stable-decay learning rates: A river valley loss landscape view

Reference 33

Resolution: unresolved; no resolver link, observed 2026-07-13T04:58:09.207999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 730d4f6c-5460-4d2f-9d60-1918272ab2a1 · outbound

This paper cites fast” variable zk and the “slow.

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles fast” variable zk and the “slow

Reference 34

Resolution: malformed identifier; no resolver link, observed 2026-07-13T04:58:09.207999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5651ca7f-1ce2-4372-ad71-26ad000f1ea0 · outbound

This paper cites Limitations.

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles Limitations

Reference 35

Resolution: malformed identifier; no resolver link, observed 2026-07-13T04:58:09.207999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e744d2b6-04dc-49db-964d-6393943220eb · outbound

This paper cites Guidelines: • The answer [N/A] means that the paper does not involve crowdsourcing nor research with human subjects.

Understanding Schedule-Free Methods in Nonconvex Optimization: Rate Guarantees and Escaping Saddles Guidelines: • The answer [N/A] means that the paper does not involve crowdsourcing nor research with human subjects

Reference 36

Resolution: unresolved; no resolver link, observed 2026-07-13T04:58:09.207999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.