Minimax PAC bounds on the sample complexity of reinforcement learning with a generative model (Q399890): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2120678009 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1206.6461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neuro-Dynamic Programming: An Overview and Recent Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4257216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prediction, Learning, and Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093383 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A guided tour of Chernoff bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2896090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PAC Bounds for Discounted MDPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4315289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the loss from approximate optimal-value functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The variance of discounted Markov decision processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2880979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Reinforcement Learning / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:50, 8 July 2024

scientific article
Language Label Description Also known as
English
Minimax PAC bounds on the sample complexity of reinforcement learning with a generative model
scientific article

    Statements

    Minimax PAC bounds on the sample complexity of reinforcement learning with a generative model (English)
    0 references
    0 references
    0 references
    20 August 2014
    0 references
    sample complexity
    0 references
    Markov decision processes
    0 references
    reinforcement learning
    0 references
    learning theory
    0 references

    Identifiers