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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68T05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C40 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6332712 / rank
 
Normal rank
Property / zbMATH Keywords
 
sample complexity
Property / zbMATH Keywords: sample complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
Markov decision processes
Property / zbMATH Keywords: Markov decision processes / rank
 
Normal rank
Property / zbMATH Keywords
 
reinforcement learning
Property / zbMATH Keywords: reinforcement learning / rank
 
Normal rank
Property / zbMATH Keywords
 
learning theory
Property / zbMATH Keywords: learning theory / rank
 
Normal rank

Revision as of 16:08, 29 June 2023

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