Equivalence notions and model minimization in Markov decision processes
From MaRDI portal
Publication:814474
Recommendations
Cites work
- Abstraction and approximate decision-theoretic planning.
- Algebraic laws for nondeterminism and concurrency
- Bisimulation through probabilistic testing
- Finite Continuous Time Markov Chains
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 3148886 (Why is no real title available?)
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 1315585 (Why is no real title available?)
- scientific article; zbMATH DE number 1142329 (Why is no real title available?)
- scientific article; zbMATH DE number 3248552 (Why is no real title available?)
- Minimal state graph generation
- Modeling a dynamic and uncertain world. I: Symbolic and probabilistic reasoning about change
- Optimal control of diffusion processes with reflection
- State of the Art—A Survey of Partially Observable Markov Decision Processes: Theory, Models, and Algorithms
- Stochastic dynamic programming with factored representations
Cited in
(27)- Algebraic results and bottom-up algorithm for policies generalization in reinforcement learning using concept lattices
- Abstraction and approximate decision-theoretic planning.
- The complexity of graph-based reductions for reachability in Markov decision processes
- Planning in hybrid relational MDPs
- Relevant states and memory in Markov chain bootstrapping and simulation
- Exact finite approximations of average-cost countable Markov decision processes
- Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey
- Model refinement using bisimulation quotients
- Extreme state aggregation beyond Markov decision processes
- Pseudometrics for State Aggregation in Average Reward Markov Decision Processes
- Adaptive aggregation for reinforcement learning in average reward Markov decision processes
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
- Exploiting symmetries for single- and multi-agent partially observable stochastic domains
- Regret bounds for restless Markov bandits
- scientific article; zbMATH DE number 2086977 (Why is no real title available?)
- scientific article; zbMATH DE number 7625165 (Why is no real title available?)
- scientific article; zbMATH DE number 7306889 (Why is no real title available?)
- Approximate equivalence of Markov decision processes.
- A sufficient statistic for influence in structured multiagent environments
- Robust Control for Dynamical Systems with Non-Gaussian Noise via Formal Abstractions
- A taxonomy for similarity metrics between Markov decision processes
- Mixed nondeterministic-probabilistic automata: blending graphical probabilistic models with nondeterminism
- Planning in artificial intelligence
- Structure in machine learning
- Causally deterministic Markov decision processes
- \textit{Explain it as simple as possible, but no simpler} -- explanation via model simplification for addressing inferential gap
- Algebraic decompositions of DP problems with linear dynamics
This page was built for publication: Equivalence notions and model minimization in Markov decision processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q814474)
