Pith. sign in

Paper Citation Record · LEDGER

Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis

As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2102.06548.

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

pith.paper-citation-record.v1
2102.06548 v4

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+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-07T13:32:56.972939Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-07-04T19:10:05.228039Z

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 23803ec9-8bf0-42d5-93ea-e8cd0227ca00 · inbound

A General-Purpose Theorem for High-Probability Bounds of Stochastic Approximation with Polyak Averaging cites this paper.

A General-Purpose Theorem for High-Probability Bounds of Stochastic Approximation with Polyak Averaging Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis

Reference 26

Resolution
unresolved
no resolver link, observed 2026-08-07T13:32:56.972939Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T13:32:56.972939Z digest=sha256:44a2f46c16318d495dd5c24cda4ddf40d977492399e752948d89836ca82d27a4

Observation 5cd57cd6-b470-4294-86a0-cbfe1e8326b1 · inbound

Minimax PAC Bounds for Learning in Exogenous Contextual MDPs cites this paper.

Minimax PAC Bounds for Learning in Exogenous Contextual MDPs Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis

Reference 10

Resolution
verified exact
arxiv_id, observed 2026-07-04T19:10:05.229713Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

source=pdf_text observed=2026-06-25T21:39:39.968655Z digest=sha256:b36a7657ecc4aa2dcf5d5930e2edfb9b378527c8f8cc9f956dfe1799ff71a155