Testing probabilistic equivalence through reinforcement learning

DOI10.1016/J.IC.2013.02.002zbMATH Open1358.68187OpenAlexW2003520601MaRDI QIDQ383369FDOQ383369

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

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

Recommendations

• Testing Probabilistic Equivalence Through Reinforcement Learning
• Real-reward testing for probabilistic processes
• Real-reward testing for probabilistic processes (extended abstract)
• Probabilistic bisimilarity as testing equivalence
• Probability matching and reinforcement learning
• Testing theories with learnable and predictive representations
• Approximating Markovian testing equivalence
• Approximate testing equivalence based on time, probability, and observed behavior

zbMATH Keywords

verificationdistancetestingMarkov processesdivergencereinforcement learningstochastic systemsequivalence relations

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• One-trial correction of legacy AI systems and stochastic separation theorems
• Testing Probabilistic Equivalence Through Reinforcement Learning

This page was built for publication: Testing probabilistic equivalence through reinforcement learning

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