Pith. sign in

Paper Citation Record · LEDGER

A Robust $\widetilde{\mathcal{O}}(1/\sqrt{T})$ Rate for Unprojected TD Learning with Linear Function Approximation

As of 17 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 3 inbound Pith citation observations for arXiv:2506.01052.

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

pith.paper-citation-record.v1
2506.01052 v3

Coverage vector

measured 21 of 21 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T12:03:21.469609Z

measured 24 of 24 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 3 of 3 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-06-27T23:43:27.932309Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-07-03T23:29:02.034641Z

Reference resolution

21 of 21 outbound references displayed

  • verified exact0
  • verified fuzzy15
  • unresolved6
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 1d5643d9-2025-4b22-9964-92ad4c933866 · outbound

This paper cites A finite time analysis of temporal difference learning with linear function approximation.

A Robust $\widetilde{\mathcal{O}}(1/\sqrt{T})$ Rate for Unprojected TD Learning with Linear Function Approximation A finite time analysis of temporal difference learning with linear function approximation

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T12:03:27.410486Z

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.

source=arxiv_source observed=2026-08-07T12:03:18.617315Z digest=sha256:4294d1fbed892bc64afce6379ed673d4e4072aacfc6554479541e54a049fb91b

Observation ec333438-c1ed-4c55-b275-bc94098c4c92 · outbound

This paper cites Deepdriving: Learning affordance for direct perception in autonomous driving.

A Robust $\widetilde{\mathcal{O}}(1/\sqrt{T})$ Rate for Unprojected TD Learning with Linear Function Approximation Deepdriving: Learning affordance for direct perception in autonomous driving

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T12:03:26.917892Z

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.

source=arxiv_source observed=2026-08-07T12:03:18.682758Z digest=sha256:1386641e13418c86f752a52f01360851fef0f2ec4a69ffd463be70d31a7c1718

Observation 7bd7d890-9da1-41fa-85d6-530cb310fb9b · outbound

This paper cites Cutkosky and Francesco Orabona.

A Robust $\widetilde{\mathcal{O}}(1/\sqrt{T})$ Rate for Unprojected TD Learning with Linear Function Approximation Cutkosky and Francesco Orabona

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T12:03:26.420242Z

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.

source=arxiv_source observed=2026-08-07T12:03:18.827002Z digest=sha256:cddbcbd9541996bbfb20685fc4a3e4f025e9fbfb13ee66abb722f4ffb9046737

Observation fb67af19-7fe8-4d7d-9fec-36f5bb844bc7 · outbound

This paper cites Finite sample analysis of two-timescale stochastic approximation with applications to reinforcement learning.

A Robust $\widetilde{\mathcal{O}}(1/\sqrt{T})$ Rate for Unprojected TD Learning with Linear Function Approximation Finite sample analysis of two-timescale stochastic approximation with applications to reinforcement learning

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T12:03:26.041499Z

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.

source=arxiv_source observed=2026-08-07T12:03:18.972656Z digest=sha256:0b016beade02a1c7fd8718e7f8d9b92e017794bf7b0a7b01c229ceabce2e895c

Observation 9cb3a3f7-445c-465b-8da7-cf2debe6104b · outbound

This paper cites Logarithmic Sobolev inequalities for finite Markov chains.

A Robust $\widetilde{\mathcal{O}}(1/\sqrt{T})$ Rate for Unprojected TD Learning with Linear Function Approximation Logarithmic Sobolev inequalities for finite Markov chains

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T12:03:25.685916Z

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.

source=arxiv_source observed=2026-08-07T12:03:19.061133Z digest=sha256:74618728e51e0678116f1929434a097d8224f10ae7242c25dc9789194335c572

Observation d564c3d4-6ac3-42a7-8cd8-2e3b0f6a4abb · outbound

This paper cites Deep reinforcement learning for robotic manipulation with asynchronous off-policy updates.

A Robust $\widetilde{\mathcal{O}}(1/\sqrt{T})$ Rate for Unprojected TD Learning with Linear Function Approximation Deep reinforcement learning for robotic manipulation with asynchronous off-policy updates

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T12:03:25.301077Z

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.

source=arxiv_source observed=2026-08-07T12:03:19.210341Z digest=sha256:60525cd6d4460d6bdf367596b53b8da8f84cd72af99ce79f0b96588b4d14db58

Observation 471abd51-65e4-4fd7-bbfe-277c76423a81 · outbound

This paper cites DoG is SGD 's best friend: A parameter-free dynamic step size schedule.

A Robust $\widetilde{\mathcal{O}}(1/\sqrt{T})$ Rate for Unprojected TD Learning with Linear Function Approximation DoG is SGD 's best friend: A parameter-free dynamic step size schedule

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T12:03:24.909078Z

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.

source=arxiv_source observed=2026-08-07T12:03:19.319129Z digest=sha256:26eef4d7a2bc0edfa507d06c0a33c02e09468bde47321abf7daa4d0ed579277c

Observation ff5df0d8-eb78-42cc-8c04-56e2ec90063b · outbound

This paper cites On TD (0) with function approximation: Concentration bounds and a centered variant with exponential convergence.

A Robust $\widetilde{\mathcal{O}}(1/\sqrt{T})$ Rate for Unprojected TD Learning with Linear Function Approximation On TD (0) with function approximation: Concentration bounds and a centered variant with exponential convergence

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T12:03:24.580141Z

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.

source=arxiv_source observed=2026-08-07T12:03:19.469727Z digest=sha256:aece41d0641ae650d09f177521cf4a6f5c72c419482e9fea094ee223317225f9

Observation 47003276-022e-4df4-808f-7b7d96485781 · outbound

This paper cites Stochastic approximation: a survey.

A Robust $\widetilde{\mathcal{O}}(1/\sqrt{T})$ Rate for Unprojected TD Learning with Linear Function Approximation Stochastic approximation: a survey

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T12:03:24.223236Z

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.

source=arxiv_source observed=2026-08-07T12:03:19.620040Z digest=sha256:d8541db506d0bc771104fd15169eab6afb3b32dfa75246415effa72707103846

Observation 1c95acc9-e3c2-4b24-932a-9deb21d9f9ad · outbound

This paper cites Linear stochastic approximation: How far does constant step-size and iterate averaging go? In International conference on artificial intelligence and statistics, pages 1347--1355.

A Robust $\widetilde{\mathcal{O}}(1/\sqrt{T})$ Rate for Unprojected TD Learning with Linear Function Approximation Linear stochastic approximation: How far does constant step-size and iterate averaging go? In International conference on artificial intelligence and statistics, pages 1347--1355

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T12:03:23.806451Z

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.

source=arxiv_source observed=2026-08-07T12:03:19.779890Z digest=sha256:5cdb28d45d0bff3917f27d993db04c4b509826852f4c92031f392647f97e12c8

Observation 5497b0d8-739c-46cc-8cb7-49e1d57eb3c7 · outbound

This paper cites Markov chains and mixing times, volume 107.

A Robust $\widetilde{\mathcal{O}}(1/\sqrt{T})$ Rate for Unprojected TD Learning with Linear Function Approximation Markov chains and mixing times, volume 107

Reference 11

Resolution
unresolved
no resolver link, observed 2026-08-07T12:03:19.946010Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T12:03:19.946010Z digest=sha256:9a1678ff92e211f13f5c6bb9ea3936a873c245e15449bf17a2f7c7d7f3394b4f

Observation 01a6ae64-ac52-43fb-8979-810e7d79c305 · outbound

This paper cites Temporal difference learning as gradient splitting.

A Robust $\widetilde{\mathcal{O}}(1/\sqrt{T})$ Rate for Unprojected TD Learning with Linear Function Approximation Temporal difference learning as gradient splitting

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T12:03:23.460603Z

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.

source=arxiv_source observed=2026-08-07T12:03:20.094695Z digest=sha256:9c5c1e28bbf26ba158bdb254c7884e4e431b0a2a052f8d46b26487514def383e

Observation 82719736-fc3b-4a88-9abb-063adc43b8ef · outbound

This paper cites Reinforcement Learning: Foundations.

A Robust $\widetilde{\mathcal{O}}(1/\sqrt{T})$ Rate for Unprojected TD Learning with Linear Function Approximation Reinforcement Learning: Foundations

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T12:03:23.179762Z

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.

source=arxiv_source observed=2026-08-07T12:03:20.266446Z digest=sha256:095793d94f6270160b1a8cfac86c6141adfa5b081e2fe8b4cba562f4da73da53

Observation 4e820a99-e309-4ebe-bf3d-7a0fce6df899 · outbound

This paper cites A simple finite-time analysis of TD learning with linear function approximation.

A Robust $\widetilde{\mathcal{O}}(1/\sqrt{T})$ Rate for Unprojected TD Learning with Linear Function Approximation A simple finite-time analysis of TD learning with linear function approximation

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T12:03:22.861122Z

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.

source=arxiv_source observed=2026-08-07T12:03:20.517986Z digest=sha256:cf4736e9f31c0b98a7389bcc76432a3c950e73fe0ef9a5468295662e1f6adc17

Observation 3856d66e-0213-4226-b285-cf6cf4cc1925 · outbound

This paper cites Approximate Temporal Difference Learning is a Gradient Descent for Reversible Policies.

A Robust $\widetilde{\mathcal{O}}(1/\sqrt{T})$ Rate for Unprojected TD Learning with Linear Function Approximation Approximate Temporal Difference Learning is a Gradient Descent for Reversible Policies

Reference 15

Resolution
unresolved
no resolver link, observed 2026-08-07T12:03:20.765551Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T12:03:20.765551Z digest=sha256:3f2093f74c502d06efdb89685f663f7a69df25ad7b005af140a7b8e7f423496f

Observation 0553c78a-6c65-4b45-86b8-ca08b2f7abe0 · outbound

This paper cites Parameter-free Stochastic Optimization of Variationally Coherent Functions.

A Robust $\widetilde{\mathcal{O}}(1/\sqrt{T})$ Rate for Unprojected TD Learning with Linear Function Approximation Parameter-free Stochastic Optimization of Variationally Coherent Functions

Reference 16

Resolution
unresolved
no resolver link, observed 2026-08-07T12:03:20.888572Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T12:03:20.888572Z digest=sha256:e815af330fbde59e30db84de4856d86f9298f37b6efdcc49761ba90c74dfae9c

Observation 64eb2c5d-7ba6-4fd2-9eb7-e224ef1934c0 · outbound

This paper cites Mastering the game of go with deep neural networks and tree search.

A Robust $\widetilde{\mathcal{O}}(1/\sqrt{T})$ Rate for Unprojected TD Learning with Linear Function Approximation Mastering the game of go with deep neural networks and tree search

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T12:03:22.625362Z

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.

source=arxiv_source observed=2026-08-07T12:03:21.008136Z digest=sha256:bb06ca3e794db53629e683372348b871600f8f5ee81ec847bccf24a8b07d297d

Observation 59e42b4e-b53a-4c23-b908-54615f8be824 · outbound

This paper cites Finite-time error bounds for linear stochastic approximation and td learning.

A Robust $\widetilde{\mathcal{O}}(1/\sqrt{T})$ Rate for Unprojected TD Learning with Linear Function Approximation Finite-time error bounds for linear stochastic approximation and td learning

Reference 18

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T12:03:22.330205Z

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.

source=arxiv_source observed=2026-08-07T12:03:21.121927Z digest=sha256:0430f94b069b130674b67e1aa754005bbd7060359e0df22ce5dbada1cddfea7c

Observation f01bc406-cc4d-4117-9bd7-f630f9287375 · outbound

This paper cites Learning to predict by the methods of temporal differences.

A Robust $\widetilde{\mathcal{O}}(1/\sqrt{T})$ Rate for Unprojected TD Learning with Linear Function Approximation Learning to predict by the methods of temporal differences

Reference 19

Resolution
unresolved
no resolver link, observed 2026-08-07T12:03:21.240807Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T12:03:21.240807Z digest=sha256:6ba764fdb8922785fe0176c7eda56e66b2a80e6400491032c91f28e3a5f3853e

Observation 8c1d018b-922a-4076-8883-a4599b8389ae · outbound

This paper cites Analysis of temporal-diffference learning with function approximation.

A Robust $\widetilde{\mathcal{O}}(1/\sqrt{T})$ Rate for Unprojected TD Learning with Linear Function Approximation Analysis of temporal-diffference learning with function approximation

Reference 20

Resolution
unresolved
no resolver link, observed 2026-08-07T12:03:21.356132Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T12:03:21.356132Z digest=sha256:dd00bef64bac0579e69d6c2986476b16ed30e3f3dd33aeebfe318099fffcc2d5

Observation 2ffd0b19-b5d0-4ba1-8a6a-ec3367bdd4dd · outbound

This paper cites an unresolved cited work.

A Robust $\widetilde{\mathcal{O}}(1/\sqrt{T})$ Rate for Unprojected TD Learning with Linear Function Approximation Unresolved cited work

Reference 21

Resolution
unresolved
raw_fallback, observed 2026-08-07T12:03:21.878165Z

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.

source=arxiv_source observed=2026-08-07T12:03:21.469609Z digest=sha256:d58c9a3c4fdf605f8811aeb0f89c24fa403d94f36b99bf34be31977e9f1d0474

Pith citing papers

Observation 4896404f-231f-44ae-8383-243f7c9a77c6 · inbound

Corruption-Tolerant Asynchronous Q-Learning with Near-Optimal Rates cites this paper.

Corruption-Tolerant Asynchronous Q-Learning with Near-Optimal Rates A Robust $\widetilde{\mathcal{O}}(1/\sqrt{T})$ Rate for Unprojected TD Learning with Linear Function Approximation

Reference 84

Resolution
verified exact
arxiv_id, observed 2026-06-09T03:07:01.159921Z

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.

source=pdf_text observed=2026-05-22T12:58:26.626172Z digest=sha256:35a17c8d2702f2a4b541259ee581f73a7fe8a2827b7eb672b90fd0b0cb5a5f3c

Observation 2a3fd8fd-90a7-4e5a-903a-76b475ae6caf · inbound

Fast and Robust Convergence Rate for TD(0) with Linear Function Approximation, Universal Learning Steps and I.I.D. Samples cites this paper.

Fast and Robust Convergence Rate for TD(0) with Linear Function Approximation, Universal Learning Steps and I.I.D. Samples A Robust $\widetilde{\mathcal{O}}(1/\sqrt{T})$ Rate for Unprojected TD Learning with Linear Function Approximation

Reference 9

Resolution
verified exact
local_arxiv, observed 2026-07-02T15:37:06.777104Z

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.

source=arxiv_source observed=2026-06-27T23:43:27.932309Z digest=sha256:db534965ad581714262fe18bffc00b6f066e69b21d52305ae671a1195aedb7e0

Observation 0ef1ca93-3dd2-41be-8378-60cf046f8f3e · inbound

A Diffusion Approximation for Temporal-Difference Learning with Linear Features under Markovian Noise cites this paper.

A Diffusion Approximation for Temporal-Difference Learning with Linear Features under Markovian Noise A Robust $\widetilde{\mathcal{O}}(1/\sqrt{T})$ Rate for Unprojected TD Learning with Linear Function Approximation

Reference 48

Resolution
verified exact
local_arxiv, observed 2026-07-03T23:29:02.036146Z

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.

source=arxiv_source observed=2026-06-26T22:22:51.788055Z digest=sha256:21dffcbccd68cf80773b0d61acc8cae36aa9d58486dd5bdaec0122e7aaf0c9a8