Paper Citation Record · LEDGER

Near-Optimal Sample Complexity for MDPs via Anchoring

As of 10 August 2026, this Paper Citation Record lists 65 of 65 outbound references and 2 inbound Pith citation observations for arXiv:2502.04477.

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

pith.paper-citation-record.v1
2502.04477 v2

Coverage vector

measured 65 of 65 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-08T22:48:33.114297Z

measured 67 of 67 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-04T06:51:04.076537Z

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

65 of 65 outbound references displayed

verified exact1
verified fuzzy47
unresolved17
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation a6c0d75f-e4d1-4cff-afac-9ec6db3d2ee0 · outbound

This paper cites an unresolved cited work.

Near-Optimal Sample Complexity for MDPs via Anchoring Unresolved cited work

Reference 1

Resolution: unresolved; raw_fallback, observed 2026-08-08T22:48:35.381305Z

Source-reported events for the cited work

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

Observation f580cb8d-3ce7-47d6-8e4d-82c1326750de · outbound

This paper cites an unresolved cited work.

Near-Optimal Sample Complexity for MDPs via Anchoring Unresolved cited work

Reference 2

Resolution: unresolved; raw_fallback, observed 2026-08-08T22:48:35.366170Z

Source-reported events for the cited work

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

Observation 34ab2e25-ed2b-4733-b1cd-dac981e81cda · outbound

This paper cites G., Munos, R., and Kappen, H.

Near-Optimal Sample Complexity for MDPs via Anchoring G., Munos, R., and Kappen, H

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:35.351423Z

Source-reported events for the cited work

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

Observation 8132e9a9-7de1-479e-b587-902eb5ede860 · outbound

This paper cites Weighted sums of certain dependent random variables.

Near-Optimal Sample Complexity for MDPs via Anchoring Weighted sums of certain dependent random variables

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:35.337490Z

Source-reported events for the cited work

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

Observation f4227128-9771-420b-a431-f092f2d1e7b8 · outbound

This paper cites U., and Aggarwal, V.

Near-Optimal Sample Complexity for MDPs via Anchoring U., and Aggarwal, V

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:35.322700Z

Source-reported events for the cited work

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

Observation 5471941a-dabe-4723-9730-56588789be6e · outbound

This paper cites A M arkovian decision process.

Near-Optimal Sample Complexity for MDPs via Anchoring A M arkovian decision process

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:35.308459Z

Source-reported events for the cited work

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

Observation 8d9953e6-9138-49bf-bd63-e02467ea3586 · outbound

This paper cites an unresolved cited work.

Near-Optimal Sample Complexity for MDPs via Anchoring Unresolved cited work

Reference 7

Resolution: unresolved; raw_fallback, observed 2026-08-08T22:48:35.294417Z

Source-reported events for the cited work

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

Observation b1c8853a-bd7e-45d4-8c21-f349c5a20cf7 · outbound

This paper cites an unresolved cited work.

Near-Optimal Sample Complexity for MDPs via Anchoring Unresolved cited work

Reference 8

Resolution: unresolved; raw_fallback, observed 2026-08-08T22:48:35.281233Z

Source-reported events for the cited work

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

Observation 079d0649-fff0-47fb-924c-91ab2a79dfa8 · outbound

This paper cites What Doubling Tricks Can and Can't Do for Multi-Armed Bandits.

Near-Optimal Sample Complexity for MDPs via Anchoring What Doubling Tricks Can and Can't Do for Multi-Armed Bandits

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-08T22:48:31.870679Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ab8a314a-4571-4704-ad5e-8472e4c42875 · outbound

This paper cites Discrete dynamic programming.

Near-Optimal Sample Complexity for MDPs via Anchoring Discrete dynamic programming

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:35.265306Z

Source-reported events for the cited work

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

Observation bc3369f8-5ca6-47e8-8396-7388b88bff3f · outbound

This paper cites an unresolved cited work.

Near-Optimal Sample Complexity for MDPs via Anchoring Unresolved cited work

Reference 11

Resolution: unresolved; raw_fallback, observed 2026-08-08T22:48:35.141069Z

Source-reported events for the cited work

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

Observation 4e1ec5f7-cd78-4153-b063-010211071eb6 · outbound

This paper cites Stochastic Halpern iteration in normed spaces and applications to reinforcement learning.

Near-Optimal Sample Complexity for MDPs via Anchoring Stochastic Halpern iteration in normed spaces and applications to reinforcement learning

Reference 12

Resolution: verified exact; local_arxiv, observed 2026-08-08T22:48:33.221284Z

Source-reported events for the cited work

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

Observation 7d84cbcd-7415-4512-af74-d13c7776f005 · outbound

This paper cites Stochastic H alpern iteration with variance reduction for stochastic monotone inclusions.

Near-Optimal Sample Complexity for MDPs via Anchoring Stochastic H alpern iteration with variance reduction for stochastic monotone inclusions

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:35.043555Z

Source-reported events for the cited work

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

Observation 994e4a04-f101-452c-bcb0-7d0cc07c9f33 · outbound

This paper cites an unresolved cited work.

Near-Optimal Sample Complexity for MDPs via Anchoring Unresolved cited work

Reference 14

Resolution: unresolved; raw_fallback, observed 2026-08-08T22:48:35.028925Z

Source-reported events for the cited work

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

Observation 1a5c1a4f-ee6b-4a6c-b13e-786381d12c5d · outbound

This paper cites Average-reward model-free reinforcement learning: a systematic review and literature mapping.

Near-Optimal Sample Complexity for MDPs via Anchoring Average-reward model-free reinforcement learning: a systematic review and literature mapping

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-08T22:48:31.897502Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8a31b2dc-d673-4cbe-b1fb-54666603e240 · outbound

This paper cites Tree-based batch mode reinforcement learning.

Near-Optimal Sample Complexity for MDPs via Anchoring Tree-based batch mode reinforcement learning

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:35.015122Z

Source-reported events for the cited work

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

Observation 3bc3b9aa-0e27-406f-b71c-8920beb186ff · outbound

This paper cites Regret minimization in MDP s with options without prior knowledge.

Near-Optimal Sample Complexity for MDPs via Anchoring Regret minimization in MDP s with options without prior knowledge

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:35.000334Z

Source-reported events for the cited work

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

Observation 43b847e9-ef88-4276-9a79-78a4d5848601 · outbound

This paper cites Fixed points of nonexpanding maps.

Near-Optimal Sample Complexity for MDPs via Anchoring Fixed points of nonexpanding maps

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:34.985584Z

Source-reported events for the cited work

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

Observation 8660ebd0-bde8-4f66-8347-a587bb714912 · outbound

This paper cites an unresolved cited work.

Near-Optimal Sample Complexity for MDPs via Anchoring Unresolved cited work

Reference 19

Resolution: unresolved; raw_fallback, observed 2026-08-08T22:48:34.972046Z

Source-reported events for the cited work

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

Observation c15d6450-9dd2-4201-99a7-09a588487e6c · outbound

This paper cites and Sidford, A.

Near-Optimal Sample Complexity for MDPs via Anchoring and Sidford, A

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:34.958140Z

Source-reported events for the cited work

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

Observation 4ee15322-a920-4172-97af-f85c87a51f22 · outbound

This paper cites and Sidford, A.

Near-Optimal Sample Complexity for MDPs via Anchoring and Sidford, A

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:34.944742Z

Source-reported events for the cited work

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

Observation 81b6d8ee-d219-4423-9eba-73ba8387d9bc · outbound

This paper cites Feasible Q -learning for average reward reinforcement learning.

Near-Optimal Sample Complexity for MDPs via Anchoring Feasible Q -learning for average reward reinforcement learning

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:34.931061Z

Source-reported events for the cited work

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

Observation 0a4f39db-4299-4eea-b331-fb249c65830a · outbound

This paper cites Truncated variance reduced value iteration.

Near-Optimal Sample Complexity for MDPs via Anchoring Truncated variance reduced value iteration

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:34.917313Z

Source-reported events for the cited work

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

Observation 7e47a3ba-f557-421c-acfe-ccc5761b3685 · outbound

This paper cites and Zhang, T.

Near-Optimal Sample Complexity for MDPs via Anchoring and Zhang, T

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:34.798170Z

Source-reported events for the cited work

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

Observation aefbacb3-3aee-4b3b-a896-8069f2aa383a · outbound

This paper cites An -best-arm identification algorithm for fixed-confidence and beyond.

Near-Optimal Sample Complexity for MDPs via Anchoring An -best-arm identification algorithm for fixed-confidence and beyond

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:34.653622Z

Source-reported events for the cited work

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

Observation 97798eca-1f4e-44f7-938f-a5c9d30cf669 · outbound

This paper cites and Jamieson, K.

Near-Optimal Sample Complexity for MDPs via Anchoring and Jamieson, K

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:34.632874Z

Source-reported events for the cited work

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

Observation 9c44ef31-2546-4bb7-9763-ba3ad9274521 · outbound

This paper cites and Singh, S.

Near-Optimal Sample Complexity for MDPs via Anchoring and Singh, S

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:34.619684Z

Source-reported events for the cited work

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

Observation 5966d6d3-b39a-47f9-84a2-7b36710a261d · outbound

This paper cites Accelerated proximal point method for maximally monotone operators.

Near-Optimal Sample Complexity for MDPs via Anchoring Accelerated proximal point method for maximally monotone operators

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:34.604718Z

Source-reported events for the cited work

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

Observation 8e19db17-a48f-4f7d-8968-1d960b533fb2 · outbound

This paper cites Y., and Mannor, S.

Near-Optimal Sample Complexity for MDPs via Anchoring Y., and Mannor, S

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:34.590069Z

Source-reported events for the cited work

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

Observation ae9d1a2d-246b-4274-83e5-dce8ac801723 · outbound

This paper cites Y., Srikant, R., and Mannor, S.

Near-Optimal Sample Complexity for MDPs via Anchoring Y., Srikant, R., and Mannor, S

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:34.576590Z

Source-reported events for the cited work

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

Observation a5f05752-a821-416e-a600-24d01b6ff205 · outbound

This paper cites and Ryu, E.

Near-Optimal Sample Complexity for MDPs via Anchoring and Ryu, E

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:34.562153Z

Source-reported events for the cited work

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

Observation 68678cd1-5010-4abf-9825-204bdcf66f00 · outbound

This paper cites and Ryu, E.

Near-Optimal Sample Complexity for MDPs via Anchoring and Ryu, E

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:34.547674Z

Source-reported events for the cited work

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

Observation 5ea594d2-ff32-4602-b069-f2c62a3b3ad2 · outbound

This paper cites Breaking the sample size barrier in model-based reinforcement learning with a generative model.

Near-Optimal Sample Complexity for MDPs via Anchoring Breaking the sample size barrier in model-based reinforcement learning with a generative model

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:34.506560Z

Source-reported events for the cited work

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

Observation 246097ab-b289-4951-86d7-c878ef346b83 · outbound

This paper cites Stochastic first-order methods for average-reward M arkov decision processes.

Near-Optimal Sample Complexity for MDPs via Anchoring Stochastic first-order methods for average-reward M arkov decision processes

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:34.384186Z

Source-reported events for the cited work

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

Observation 67877b08-3ef0-4f46-a86b-7cf26beb410a · outbound

This paper cites On the convergence rate of the H alpern-iteration.

Near-Optimal Sample Complexity for MDPs via Anchoring On the convergence rate of the H alpern-iteration

Reference 35

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:34.339419Z

Source-reported events for the cited work

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

Observation 9ee31ff6-ffcf-4c41-999b-b86b80114a7c · outbound

This paper cites Average reward reinforcement learning: Foundations, algorithms, and empirical results.

Near-Optimal Sample Complexity for MDPs via Anchoring Average reward reinforcement learning: Foundations, algorithms, and empirical results

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:34.325611Z

Source-reported events for the cited work

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

Observation 7d047367-15e1-4d05-a53d-154aaae69599 · outbound

This paper cites Finding all -good arms in stochastic bandits.

Near-Optimal Sample Complexity for MDPs via Anchoring Finding all -good arms in stochastic bandits

Reference 37

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:34.311312Z

Source-reported events for the cited work

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

Observation b1a61167-9a7b-47a2-811a-24713a39dd31 · outbound

This paper cites A., and et al.

Near-Optimal Sample Complexity for MDPs via Anchoring A., and et al

Reference 38

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:34.296661Z

Source-reported events for the cited work

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

Observation 3ced112a-25b0-4238-967a-97e59a574c06 · outbound

This paper cites and Szepesv \'a ri, C.

Near-Optimal Sample Complexity for MDPs via Anchoring and Szepesv \'a ri, C

Reference 39

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:34.284077Z

Source-reported events for the cited work

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

Observation ee982dfd-3408-430c-b656-ae1a0c6d73a5 · outbound

This paper cites and Srikant, R.

Near-Optimal Sample Complexity for MDPs via Anchoring and Srikant, R

Reference 40

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:34.270618Z

Source-reported events for the cited work

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

Observation f30b2363-3cca-4118-8b1e-2d82de96dd01 · outbound

This paper cites and Okolo, N.

Near-Optimal Sample Complexity for MDPs via Anchoring and Okolo, N

Reference 41

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:34.251721Z

Source-reported events for the cited work

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

Observation c79f08b4-a558-4c76-ab8f-b6a0451e358b · outbound

This paper cites M., Liu, J., Scheinberg, K., and Tak \'a c , M.

Near-Optimal Sample Complexity for MDPs via Anchoring M., Liu, J., Scheinberg, K., and Tak \'a c , M

Reference 42

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:34.236817Z

Source-reported events for the cited work

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

Observation 7f37755b-22d8-443e-9284-ade197858d02 · outbound

This paper cites and Ryu, E.

Near-Optimal Sample Complexity for MDPs via Anchoring and Ryu, E

Reference 43

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:34.208132Z

Source-reported events for the cited work

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

Observation df731c54-283e-4cb8-a503-e51459b80af9 · outbound

This paper cites an unresolved cited work.

Near-Optimal Sample Complexity for MDPs via Anchoring Unresolved cited work

Reference 44

Resolution: unresolved; raw_fallback, observed 2026-08-08T22:48:34.108545Z

Source-reported events for the cited work

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

Observation 6c8ed0f4-ec9e-40c0-a5b5-40130bdec4b8 · outbound

This paper cites Strong convergence theorems for resolvents of accretive operators in B anach spaces.

Near-Optimal Sample Complexity for MDPs via Anchoring Strong convergence theorems for resolvents of accretive operators in B anach spaces

Reference 45

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:33.999717Z

Source-reported events for the cited work

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

Observation 7fab3d07-0926-4b1f-8507-88f7db287c0f · outbound

This paper cites and Mansour, Y.

Near-Optimal Sample Complexity for MDPs via Anchoring and Mansour, Y

Reference 46

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:33.934187Z

Source-reported events for the cited work

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

Observation 312fa99d-b052-4dd4-a9ad-f6e3ac60ac59 · outbound

This paper cites and Shtern, S.

Near-Optimal Sample Complexity for MDPs via Anchoring and Shtern, S

Reference 47

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:33.920700Z

Source-reported events for the cited work

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

Observation 1c0aeceb-2f32-4a56-8a46-c5f6ab9b45b8 · outbound

This paper cites Near-optimal time and sample complexities for solving M arkov decision processes with a generative model.

Near-Optimal Sample Complexity for MDPs via Anchoring Near-optimal time and sample complexities for solving M arkov decision processes with a generative model

Reference 48

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:33.906432Z

Source-reported events for the cited work

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

Observation c4dbc32f-8889-4c84-b184-281d760b7b39 · outbound

This paper cites Variance reduced value iteration and faster algorithms for solving M arkov decision processes.

Near-Optimal Sample Complexity for MDPs via Anchoring Variance reduced value iteration and faster algorithms for solving M arkov decision processes

Reference 49

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:33.891913Z

Source-reported events for the cited work

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

Observation 1148d948-2309-453f-a4fd-c04a3f99b1d1 · outbound

This paper cites an unresolved cited work.

Near-Optimal Sample Complexity for MDPs via Anchoring Unresolved cited work

Reference 50

Resolution: unresolved; raw_fallback, observed 2026-08-08T22:48:33.877940Z

Source-reported events for the cited work

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

Observation bf4e78f9-d24d-4f6a-a270-022d544ba479 · outbound

This paper cites an unresolved cited work.

Near-Optimal Sample Complexity for MDPs via Anchoring Unresolved cited work

Reference 51

Resolution: unresolved; raw_fallback, observed 2026-08-08T22:48:33.839562Z

Source-reported events for the cited work

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

Observation 9cf865e6-99bd-4526-8fb5-490dc7fcc371 · outbound

This paper cites Algorithms for Reinforcement Learning.

Near-Optimal Sample Complexity for MDPs via Anchoring Algorithms for Reinforcement Learning

Reference 52

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:33.701272Z

Source-reported events for the cited work

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

Observation c79fe039-f5f9-4024-8dc4-f355a07aea7b · outbound

This paper cites Finding good policies in average-reward M arkov decision processes without prior knowledge.

Near-Optimal Sample Complexity for MDPs via Anchoring Finding good policies in average-reward M arkov decision processes without prior knowledge

Reference 53

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:33.591673Z

Source-reported events for the cited work

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

Observation a7e16fd6-1b54-4c91-a3da-ba2c5e5aec17 · outbound

This paper cites Variance-reduced $Q$-learning is minimax optimal.

Near-Optimal Sample Complexity for MDPs via Anchoring Variance-reduced $Q$-learning is minimax optimal

Reference 54

Resolution: unresolved; no resolver link, observed 2026-08-08T22:48:32.814848Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 807d7a90-8441-4ab6-af08-1f3a2e150258 · outbound

This paper cites an unresolved cited work.

Near-Optimal Sample Complexity for MDPs via Anchoring Unresolved cited work

Reference 55

Resolution: unresolved; raw_fallback, observed 2026-08-08T22:48:33.576996Z

Source-reported events for the cited work

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

Observation 32ab1a26-20b5-443f-9542-807e6181f9e3 · outbound

This paper cites Near Sample-Optimal Reduction-based Policy Learning for Average Reward MDP.

Near-Optimal Sample Complexity for MDPs via Anchoring Near Sample-Optimal Reduction-based Policy Learning for Average Reward MDP

Reference 56

Resolution: unresolved; no resolver link, observed 2026-08-08T22:48:32.824182Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c5337e60-d0f6-445d-9e53-ee7c5761380f · outbound

This paper cites Primal-Dual $\pi$ Learning: Sample Complexity and Sublinear Run Time for Ergodic Markov Decision Problems.

Near-Optimal Sample Complexity for MDPs via Anchoring Primal-Dual $\pi$ Learning: Sample Complexity and Sublinear Run Time for Ergodic Markov Decision Problems

Reference 57

Resolution: unresolved; no resolver link, observed 2026-08-08T22:48:32.829460Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 086120f1-6b5a-43c6-8f19-87d59acf8650 · outbound

This paper cites Optimal sample complexity for average reward M arkov decision processes.

Near-Optimal Sample Complexity for MDPs via Anchoring Optimal sample complexity for average reward M arkov decision processes

Reference 58

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:33.562637Z

Source-reported events for the cited work

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

Observation c3b98127-31c4-4daf-a83b-0494e20a430b · outbound

This paper cites J., Luo, H., Sharma, H., and Jain, R.

Near-Optimal Sample Complexity for MDPs via Anchoring J., Luo, H., Sharma, H., and Jain, R

Reference 59

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:33.547358Z

Source-reported events for the cited work

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

Observation 3f56888e-d312-472d-b92b-47e14efd51e5 · outbound

This paper cites Approximation of fixed points of nonexpansive mappings.

Near-Optimal Sample Complexity for MDPs via Anchoring Approximation of fixed points of nonexpansive mappings

Reference 60

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:33.519795Z

Source-reported events for the cited work

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

Observation f13a70e5-2694-4ef6-a9cd-5043d6e698a2 · outbound

This paper cites Iterative algorithms for nonlinear operators.

Near-Optimal Sample Complexity for MDPs via Anchoring Iterative algorithms for nonlinear operators

Reference 61

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:33.353677Z

Source-reported events for the cited work

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

Observation 0f84857f-5ec0-46da-ab79-1cd7eb8ea5a7 · outbound

This paper cites and Ryu, E.

Near-Optimal Sample Complexity for MDPs via Anchoring and Ryu, E

Reference 62

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:33.294665Z

Source-reported events for the cited work

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

Observation 0a693ff1-51e2-4bad-a79c-5b7160dde0a8 · outbound

This paper cites and Xie, Q.

Near-Optimal Sample Complexity for MDPs via Anchoring and Xie, Q

Reference 63

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:33.279188Z

Source-reported events for the cited work

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

Observation 75878761-0f78-4812-83da-89c6fd3bee47 · outbound

This paper cites and Chen, Y.

Near-Optimal Sample Complexity for MDPs via Anchoring and Chen, Y

Reference 64

Resolution: verified fuzzy; raw_fallback, observed 2026-08-08T22:48:33.263816Z

Source-reported events for the cited work

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

Observation 0fe317f3-ab06-4ec0-9f6a-226958058625 · outbound

This paper cites write newline.

Near-Optimal Sample Complexity for MDPs via Anchoring write newline

Reference 65

Resolution: unresolved; no resolver link, observed 2026-08-08T22:48:33.114297Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

Observation 57ea9f20-2673-44da-aa4a-4938303e4ca3 · inbound

Auto-exploration for online reinforcement learning cites this paper.

Auto-exploration for online reinforcement learning Near-Optimal Sample Complexity for MDPs via Anchoring

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-03T18:18:58.439629Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fd92dba0-5cbd-4100-8480-4818740c509a · inbound

Auto-exploration for online reinforcement learning cites this paper.

Auto-exploration for online reinforcement learning Near-Optimal Sample Complexity for MDPs via Anchoring

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-04T06:51:04.076537Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.