Sciweavers

272 search results - page 46 / 55
» Parallel Reinforcement Learning with Linear Function Approxi...
Sort
View
MLG
2007
Springer
14 years 2 months ago
A Universal Kernel for Learning Regular Languages
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
Leonid Kontorovich
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
14 years 26 days ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
NIPS
2008
13 years 10 months ago
An Extended Level Method for Efficient Multiple Kernel Learning
We consider the problem of multiple kernel learning (MKL), which can be formulated as a convex-concave problem. In the past, two efficient methods, i.e., Semi-Infinite Linear Prog...
Zenglin Xu, Rong Jin, Irwin King, Michael R. Lyu
BC
2006
124views more  BC 2006»
13 years 8 months ago
Motor-maps, navigation and implicit space representation in the hippocampus
Abstract Multiple sensory-motor maps located in the brainstem and the cortex are involved in spatial orientation. Guiding movements of eyes, head, neck and arms they provide an app...
Alexander Kaske, Gösta Winberg, Joakim Cö...
IJCNN
2007
IEEE
14 years 3 months ago
Agnostic Learning versus Prior Knowledge in the Design of Kernel Machines
Abstract— The optimal model parameters of a kernel machine are typically given by the solution of a convex optimisation problem with a single global optimum. Obtaining the best p...
Gavin C. Cawley, Nicola L. C. Talbot