Sciweavers

3250 search results - page 86 / 650
» Parameterized Learning Complexity
Sort
View
71
Voted
DAGM
2007
Springer
15 years 6 months ago
The Minimum Volume Ellipsoid Metric
We propose an unsupervised “local learning” algorithm for learning a metric in the input space. Geometrically, for a given query point, the algorithm finds the minimum volume ...
Karim T. Abou-Moustafa, Frank P. Ferrie
IJCAI
2003
15 years 2 months ago
Covariant Policy Search
We investigate the problem of non-covariant behavior of policy gradient reinforcement learning algorithms. The policy gradient approach is amenable to analysis by information geom...
J. Andrew Bagnell, Jeff G. Schneider
105
Voted
IJCAI
2007
15 years 2 months ago
Deictic Option Schemas
Deictic representation is a representational paradigm, based on selective attention and pointers, that allows an agent to learn and reason about rich complex environments. In this...
Balaraman Ravindran, Andrew G. Barto, Vimal Mathew
94
Voted
ISBI
2008
IEEE
15 years 7 months ago
On the non-uniform complexity of brain connectivity
A stratification and manifold learning approach for analyzing High Angular Resolution Diffusion Imaging (HARDI) data is introduced in this paper. HARDI data provides highdimensio...
Gloria Haro, Christophe Lenglet, Guillermo Sapiro,...
104
Voted
IJCNN
2008
IEEE
15 years 7 months ago
Building meta-learning algorithms basing on search controlled by machine complexity
Abstract— Meta-learning helps us find solutions to computational intelligence (CI) challenges in automated way. Metalearning algorithm presented in this paper is universal and m...
Norbert Jankowski, Krzysztof Grabczewski