Efficient PAC learning for episodic tasks with acyclic state spaces (Q2465672): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Single-Sample Multiple Decision Procedure for Ranking Means of Normal Populations with known Variances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3046711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability Inequalities for Sums of Bounded Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal reinforcement learning in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient PAC learning for episodic tasks with acyclic state spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5713453 / rank
 
Normal rank

Latest revision as of 13:46, 27 June 2024

scientific article
Language Label Description Also known as
English
Efficient PAC learning for episodic tasks with acyclic state spaces
scientific article

    Statements

    Efficient PAC learning for episodic tasks with acyclic state spaces (English)
    0 references
    7 January 2008
    0 references
    Markov decision processes
    0 references
    Computational learning theory
    0 references
    Machine learning
    0 references
    Efficient probably approximately correct (PAC) algorithms
    0 references
    Ranking \& selection
    0 references
    Uncertainty management
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references