Towards min max generalization in reinforcement learning

DOI10.1007/978-3-642-19890-8_5MaRDI QIDQ3006026zbMATH OpenOpenAlexFDO

Authors R. Fonteneau, Louis Wehenkel, D. Ernst, Susan A. Murphy

Publication date 10 June 2011

Published in Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL https://orbi.uliege.be/handle/2268/99584

zbMATH Keywords

deterministic Lipschitz continuous environments over continuous state spacesfinite action spacesfinite optimization horizonmin max problem

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Minimax problems in mathematical programming (90C47)

Recommendations

• Min max generalization for deterministic batch mode reinforcement learning: relaxation schemes
• Reinforcement learning in robust Markov decision processes
• Efficient reinforcement learning in deterministic systems with value function generalization
• Bayesian Reinforcement Learning with Exploration
• A generalization error for Q-learning

Cites work

• 10.1162/1532443041827907
• Bias and variance approximation in value function estimates
• Computational geometry. Algorithms and applications.
• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
• scientific article; zbMATH DE number 5957269 (Why is no real title available?)
• scientific article; zbMATH DE number 1321699 (Why is no real title available?)
• scientific article; zbMATH DE number 1342066 (Why is no real title available?)
• scientific article; zbMATH DE number 1022658 (Why is no real title available?)
• Kernel-based reinforcement learning
• Optimal Dynamic Treatment Regimes
• Percentile Optimization for Markov Decision Processes with Parameter Uncertainty
• Performance guarantees for individualized treatment rules
• Towards min max generalization in reinforcement learning
• Value function based reinforcement learning in changing Markovian environments

Cited in

(6)

• Algebraic results and bottom-up algorithm for policies generalization in reinforcement learning using concept lattices
• Min max generalization for deterministic batch mode reinforcement learning: relaxation schemes
• Towards min max generalization in reinforcement learning
• Batch mode reinforcement learning based on the synthesis of artificial trajectories
• Efficient reinforcement learning in deterministic systems with value function generalization
• A Survey of Zero-shot Generalisation in Deep Reinforcement Learning

This page was built for publication: Towards min max generalization in reinforcement learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3006026)