10054 search results - page 281 / 2011 » On the Complexity of Function Learning |
128
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
We analyze a simple, Bellman-error-based approach to generating basis functions for valuefunction approximation. We show that it generates orthogonal basis functions that provably...
176
click to vote
ML
2002
ACM
15 years 6 months ago
2002
ACM
In this paper, we elaborate on the well-known relationship between Gaussian Processes (GP) and Support Vector Machines (SVM) under some convex assumptions for the loss functions. ...
172
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Negation-limited circuits have been studied as a circuit model between general circuits and monotone circuits. In this paper, we consider limiting negations in formulas. The minimu...
132
click to vote
COGSCI
2004
15 years 6 months ago
2004
The fundamental relations that underlie cognitive comparisons--"same" and "different"--can be demultiple levels of abstraction, which vary in relational comple...
156
click to vote
IDEAL
2005
Springer
15 years 11 months ago
2005
Springer
The design, development, and use of complex systems models raises a unique class of challenges and potential pitfalls, many of which are commonly recurring problems. Over time, res...