Research map / Reinforcement learning / MDPs and planning
Scalable Methods for Computing State Similarity in Deterministic Markov Decision Processes
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Add Gaussian noise to GridWorld state representations | Neural bisimulation metric approximant · GridWorld and continuous GridWorld variant | metric approximation performance | No clear effect |
Closest papers by meaning
- A Generalized Bisimulation Metric of State Similarity between Markov Decision Processes: From Theoretical Propositions to Applications (NeurIPS 2025 · similarity 0.94)
- Distances for Markov chains from sample streams (NeurIPS 2025 · similarity 0.89)
- Bisimulation Metrics are Optimal Transport Distances, and Can be Computed Efficiently (NeurIPS 2024 · similarity 0.87)
- Finding good policies in average-reward Markov Decision Processes without prior knowledge (NeurIPS 2024 · similarity 0.86)
- The Number of Trials Matters in Infinite-Horizon General-Utility Markov Decision Processes (ICML 2025 · similarity 0.86)
- Online Markov Decision Processes Configuration with Continuous Decision Space (AAAI 2024 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.