Sciweavers

1617 search results - page 58 / 324
» Using Gaussian Processes to Optimize Expensive Functions
Sort
View
SIGMOD
2005
ACM
146views Database» more  SIGMOD 2005»
14 years 7 months ago
Predicate Result Range Caching for Continuous Queries
Many analysis and monitoring applications require the repeated execution of expensive modeling functions over streams of rapidly changing data. These applications can often be exp...
Matthew Denny, Michael J. Franklin
AUSAI
2004
Springer
14 years 1 months ago
A Dynamic Allocation Method of Basis Functions in Reinforcement Learning
In this paper, we propose a dynamic allocation method of basis functions, an Allocation/Elimination Gaussian Softmax Basis Function Network (AE-GSBFN), that is used in reinforcemen...
Shingo Iida, Kiyotake Kuwayama, Masayoshi Kanoh, S...
JMLR
2010
206views more  JMLR 2010»
13 years 2 months ago
Learning Translation Invariant Kernels for Classification
Appropriate selection of the kernel function, which implicitly defines the feature space of an algorithm, has a crucial role in the success of kernel methods. In this paper, we co...
Sayed Kamaledin Ghiasi Shirazi, Reza Safabakhsh, M...
ICML
2007
IEEE
14 years 8 months ago
Bayesian actor-critic algorithms
We1 present a new actor-critic learning model in which a Bayesian class of non-parametric critics, using Gaussian process temporal difference learning is used. Such critics model ...
Mohammad Ghavamzadeh, Yaakov Engel
AAAI
2008
13 years 10 months ago
Adaptive Importance Sampling with Automatic Model Selection in Value Function Approximation
Off-policy reinforcement learning is aimed at efficiently reusing data samples gathered in the past, which is an essential problem for physically grounded AI as experiments are us...
Hirotaka Hachiya, Takayuki Akiyama, Masashi Sugiya...