Sciweavers

2040 search results - page 15 / 408
» Approximate Expectation Maximization
Sort
View
NIPS
2008
15 years 20 days ago
Improving on Expectation Propagation
A series of corrections is developed for the fixed points of Expectation Propagation (EP), which is one of the most popular methods for approximate probabilistic inference. These ...
Manfred Opper, Ulrich Paquet, Ole Winther
SODA
2012
ACM
229views Algorithms» more  SODA 2012»
13 years 1 months ago
Approximation algorithms for stochastic orienteering
In the Stochastic Orienteering problem, we are given a metric, where each node also has a job located there with some deterministic reward and a random size. (Think of the jobs as...
Anupam Gupta, Ravishankar Krishnaswamy, Viswanath ...
CDC
2008
IEEE
167views Control Systems» more  CDC 2008»
15 years 5 months ago
On the approximate domain optimization of deterministic and expected value criteria
— We define the concept of approximate domain optimizer for deterministic and expected value optimization criteria. Roughly speaking, a candidate optimizer is an approximate dom...
Andrea Lecchini-Visintini, John Lygeros, Jan M. Ma...
KR
1992
Springer
15 years 3 months ago
Learning Useful Horn Approximations
While the task of answering queries from an arbitrary propositional theory is intractable in general, it can typicallybe performed e ciently if the theory is Horn. This suggests t...
Russell Greiner, Dale Schuurmans
CCIA
2005
Springer
15 years 4 months ago
Direct Policy Search Reinforcement Learning for Robot Control
— This paper proposes a high-level Reinforcement Learning (RL) control system for solving the action selection problem of an autonomous robot. Although the dominant approach, whe...
Andres El-Fakdi, Marc Carreras, Narcís Palo...