1957 search results - page 27 / 392 » Approximate algorithms for neural-Bayesian approaches |
138
click to vote
ICML
2009
IEEE
15 years 11 months ago
2009
IEEE
We propose a deterministic method to evaluate the integral of a positive function based on soft-binning functions that smoothly cut the integral into smaller integrals that are ea...
130
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
Approximation of the permanent of a matrix with nonnegative entries is a well studied problem. The most successful approach to date for general matrices uses Markov chains to appr...
140
click to vote
COMPGEOM
1993
ACM
15 years 8 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
137
click to vote
AAAI
2010
15 years 5 months ago
2010
This paper introduces a principled approach for the design of a scalable general reinforcement learning agent. This approach is based on a direct approximation of AIXI, a Bayesian...
121
click to vote
ECAI
2008
Springer
15 years 5 months ago
2008
Springer
In this paper, we propose a policy gradient reinforcement learning algorithm to address transition-independent Dec-POMDPs. This approach aims at implicitly exploiting the locality...