REVIEW 2 cited by
Average-reward model-free reinforcement learning: a systematic review and literature mapping
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Reinforcement learning is important part of artificial intelligence. In this paper, we review model-free reinforcement learning that utilizes the average reward optimality criterion in the infinite horizon setting. Motivated by the solo survey by Mahadevan (1996a), we provide an updated review of work in this area and extend it to cover policy-iteration and function approximation methods (in addition to the value-iteration and tabular counterparts). We present a comprehensive literature mapping. We also identify and discuss opportunities for future work.
Forward citations
Cited by 2 Pith papers
-
Efficient Computation of Blackwell Optimal Policies using Rational Functions
Using symbolic comparisons of rational value functions near gamma=1, the authors obtain the first strongly polynomial algorithms for Blackwell-optimal policies in deterministic MDPs and a subexponential expected algor...
-
Near-Optimal Sample Complexity for MDPs via Anchoring
A new no-prior-knowledge model-free algorithm achieves O~( |S||A| ||h*||^2_sp / eps^2 ) sample complexity for weakly communicating average-reward MDPs, matching the lower bound up to a factor ||h*||_sp.
Discussion (0). Continue with ORCID to comment.