1393 search results - page 38 / 279 » Machine Learning by Function Decomposition |
150
click to vote
IJCNN
2007
IEEE
15 years 7 months ago
2007
IEEE
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...
127
click to vote
ICML
2001
IEEE
16 years 2 months ago
2001
IEEE
We introduce the first algorithm for off-policy temporal-difference learning that is stable with linear function approximation. Off-policy learning is of interest because it forms...
117
click to vote
COCO
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We prove asymptotically optimal bounds on the Gaussian noise sensitivity of degree-d polynomial threshold functions. These bounds translate into optimal bounds on the Gau...
134
Voted
ML
2002
ACM
15 years 1 months ago
2002
ACM
A widely acknowledged drawback of many statistical modelling techniques, commonly used in machine learning, is that the resulting model is extremely difficult to interpret. A numb...
115
click to vote
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
A central problem in the analysis of motion capture (Mo-
Cap) data is how to decompose motion sequences into primitives.
Ideally, a description in terms of primitives should
fac...