Efficient PAC learning for episodic tasks with acyclic state spaces

DOI10.1007/s10626-007-0014-3zbMath1137.90021OpenAlexW2025486342MaRDI QIDQ2465672

Theologos Bountourelis, Spyros A. Reveliotis

Publication date: 7 January 2008

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10626-007-0014-3

zbMATH Keywords

Markov decision processesComputational learning theoryMachine learningUncertainty managementEfficient probably approximately correct (PAC) algorithmsRanking \& selection

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Control/observation systems with incomplete information (93C41) Discrete event control/observation systems (93C65) Markov and semi-Markov decision processes (90C40)

Related Items (3)

Efficient PAC learning for episodic tasks with acyclic state spaces ⋮ Optimal node visitation in acyclic stochastic digraphs with multi-threaded traversals and internal visitation requirements ⋮ Optimal flow control in acyclic networks with uncontrollable routings and precedence constraints

Cites Work

• Near-optimal reinforcement learning in polynomial time
• Efficient PAC learning for episodic tasks with acyclic state spaces
• Probability Inequalities for Sums of Bounded Random Variables
• A Single-Sample Multiple Decision Procedure for Ranking Means of Normal Populations with known Variances
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient PAC learning for episodic tasks with acyclic state spaces