Sciweavers

598 search results - page 20 / 120
» Learning Generative Models with the Up-Propagation Algorithm
Sort
View
CAV
2010
Springer
251views Hardware» more  CAV 2010»
13 years 11 months ago
Automated Assume-Guarantee Reasoning through Implicit Learning
Abstract. We propose a purely implicit solution to the contextual assumption generation problem in assume-guarantee reasoning. Instead of improving the L∗ algorithm — a learnin...
Yu-Fang Chen, Edmund M. Clarke, Azadeh Farzan, Min...
ML
2002
ACM
143views Machine Learning» more  ML 2002»
13 years 7 months ago
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
Michael J. Kearns, Yishay Mansour, Andrew Y. Ng
ICML
2001
IEEE
14 years 8 months ago
Using EM to Learn 3D Models of Indoor Environments with Mobile Robots
This paper describes an algorithm for generating compact 3D models of indoor environments with mobile robots. Our algorithm employs the expectation maximization algorithm to fit a...
Yufeng Liu, Rosemary Emery, Deepayan Chakrabarti, ...
COLT
1995
Springer
13 years 11 months ago
On the Learnability and Usage of Acyclic Probabilistic Finite Automata
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
Dana Ron, Yoram Singer, Naftali Tishby
COLT
1994
Springer
13 years 11 months ago
Learning Probabilistic Automata with Variable Memory Length
We propose and analyze a distribution learning algorithm for variable memory length Markov processes. These processes can be described by a subclass of probabilistic nite automata...
Dana Ron, Yoram Singer, Naftali Tishby