Testing probabilistic equivalence through reinforcement learning

DOI10.1016/j.ic.2013.02.002zbMath1358.68187OpenAlexW2003520601MaRDI QIDQ383369

Sami Zhioua, Josée Desharnais, François Laviolette

Publication date: 4 December 2013

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2013.02.002

zbMATH Keywords

verificationequivalence relationsMarkov processesdistancetestingdivergencereinforcement learningstochastic systems

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Planning and acting in partially observable stochastic domains
• Observation equivalence as a testing equivalence
• Metrics for labelled Markov processes
• Probabilistic communicating processes
• A calculus of communicating systems
• Bisimulation through probabilistic testing
• A sparse sampling algorithm for near-optimal planning in large Markov decision processes
• \({\mathcal Q}\)-learning
• Testing preorders for probabilistic processes.
• Reactive, generative, and stratified models of probabilistic processes
• Bisimulation for probabilistic transition systems: A coalgebraic approach
• Refinement-oriented probability for CSP
• Bisimulation for labelled Markov processes
• Play to Test
• A testing scenario for probabilistic processes
• Algebraic laws for nondeterminism and concurrency
• An Introduction to the Application of the Theory of Probabilistic Functions of a Markov Process to Automatic Speech Recognition
• On Choosing and Bounding Probability Metrics
• Probability Inequalities for Sums of Bounded Random Variables
• Testing Probabilistic Equivalence Through Reinforcement Learning