Sciweavers

134 search results - page 2 / 27
» Local Minimax Learning of Approximately Polynomial Functions
Sort
View
COLT
2010
Springer
13 years 5 months ago
Deterministic Sparse Fourier Approximation via Fooling Arithmetic Progressions
A significant Fourier transform (SFT) algorithm, given a threshold and oracle access to a function f, outputs (the frequencies and approximate values of) all the -significant Fou...
Adi Akavia
AAAI
2011
12 years 7 months ago
Value Function Approximation in Reinforcement Learning Using the Fourier Basis
We describe the Fourier Basis, a linear value function approximation scheme based on the Fourier Series. We empirically evaluate its properties, and demonstrate that it performs w...
George Konidaris, Sarah Osentoski, Philip Thomas
CAGD
2006
90views more  CAGD 2006»
13 years 7 months ago
Local hybrid approximation for scattered data fitting with bivariate splines
We suggest a local hybrid approximation scheme based on polynomials and radial basis functions, and use it to modify the scattered data fitting algorithm of [7]. Similar to that a...
Oleg Davydov, Rossana Morandi, Alessandra Sestini
CEC
2005
IEEE
14 years 1 months ago
A study on polynomial regression and Gaussian process global surrogate model in hierarchical surrogate-assisted evolutionary alg
This paper presents a study on Hierarchical Surrogate-Assisted Evolutionary Algorithm (HSAEA) using different global surrogate models for solving computationally expensive optimiza...
Zongzhao Zhou, Yew-Soon Ong, My Hanh Nguyen, Dudy ...
AUSAI
2005
Springer
14 years 1 months ago
Global Versus Local Constructive Function Approximation for On-Line Reinforcement Learning
: In order to scale to problems with large or continuous state-spaces, reinforcement learning algorithms need to be combined with function approximation techniques. The majority of...
Peter Vamplew, Robert Ollington