Paper Citation Record · LEDGER

Variance-reduced Clipping for Non-convex Optimization

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

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

pith.paper-citation-record.v1
2303.00883 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 7 of 7 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-16T06:30:59.297886+00:00

measured 7 of 7 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-15T23:39:51.943258Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-06T18:33:08.182516Z

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 de1156d2-aaa9-4398-8000-fffb2616a6fa · inbound

A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness cites this paper.

A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness Variance-reduced Clipping for Non-convex Optimization

Reference 56

Resolution: unresolved; no resolver link, observed 2026-08-10T23:47:10.809251Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f2b12f9d-0766-4e8f-aaa7-fb006b7b7af0 · inbound

Outlier-Robust Training of Machine Learning Models cites this paper.

Outlier-Robust Training of Machine Learning Models Variance-reduced Clipping for Non-convex Optimization

Reference 69

Resolution: unresolved; no resolver link, observed 2026-08-10T23:02:28.325872Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 70402f0a-9d47-4096-b2f3-c8db8dc97d71 · inbound

Complexity Lower Bounds of Adaptive Gradient Algorithms for Non-convex Stochastic Optimization under Relaxed Smoothness cites this paper.

Complexity Lower Bounds of Adaptive Gradient Algorithms for Non-convex Stochastic Optimization under Relaxed Smoothness Variance-reduced Clipping for Non-convex Optimization

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-15T23:30:24.984392Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f0edf0b1-92a7-49d0-ab89-89e787e690e4 · inbound

A Fast Newton Method Under Local Lipschitz Smoothness cites this paper.

A Fast Newton Method Under Local Lipschitz Smoothness Variance-reduced Clipping for Non-convex Optimization

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-15T23:39:51.943258Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4a1895d6-f73c-4bda-97d0-59034e8515a7 · inbound

Revisiting Convergence: Shuffling Complexity Beyond Lipschitz Smoothness cites this paper.

Revisiting Convergence: Shuffling Complexity Beyond Lipschitz Smoothness Variance-reduced Clipping for Non-convex Optimization

Reference 28

Resolution: verified exact; local_arxiv, observed 2026-08-06T18:33:08.210849Z

Source-reported events for the cited work

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

Observation 267930ab-61af-4287-8bd2-7c05ca38ceab · inbound

Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity cites this paper.

Revisiting Randomized Smoothing: Nonsmooth Nonconvex Optimization Beyond Global Lipschitz Continuity Variance-reduced Clipping for Non-convex Optimization

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-15T17:22:55.374619Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f25e0a5c-681d-48af-a8bd-bf01ca13d2d5 · inbound

Generalized Convexity and Smoothness via Conjugate Duality: Optimization Theory for Deep Neural Networks cites this paper.

Generalized Convexity and Smoothness via Conjugate Duality: Optimization Theory for Deep Neural Networks Variance-reduced Clipping for Non-convex Optimization

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-11T15:48:32.823113Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.