Testing Probabilistic Equivalence Through Reinforcement Learning

DOI10.1007/11944836_23MaRDI QIDQ5385989zbMATH OpenOpenAlexFDO

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

Publication date 17 April 2008

Published in FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11944836_23

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Testing probabilistic equivalence through reinforcement learning
• A testing scenario for probabilistic processes
• scientific article; zbMATH DE number 7311343
• Approximate testing equivalence based on time, probability, and observed behavior
• scientific article; zbMATH DE number 1231682

Cited in

(3)

• One-trial correction of legacy AI systems and stochastic separation theorems
• Testing probabilistic equivalence through reinforcement learning
• Approximate testing equivalence based on time, probability, and observed behavior

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 Q5385989)