4255 search results - page 292 / 851 » On Learning Boolean Functions |
188
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
Stationarity is often an unrealistic prior assumption for Gaussian process regression. One solution is to predefine an explicit nonstationary covariance function, but such covaria...
175
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
—TD learning and its refinements are powerful tools for approximating the solution to dynamic programming problems. However, the techniques provide the approximate solution only...
183
click to vote
COLT
2001
Springer
15 years 11 months ago
2001
Springer
We investigate the use of certain data-dependent estimates of the complexity of a function class, called Rademacher and Gaussian complexities. In a decision theoretic setting, we ...
182
click to vote
PKDD
2009
Springer
16 years 1 months ago
2009
Springer
Most existing semi-supervised learning methods are based on the smoothness assumption that data points in the same high density region should have the same label. This assumption, ...
183
click to vote
AI
2008
Springer
15 years 6 months ago
2008
Springer
Preference learning is a challenging problem that involves the prediction of complex structures, such as weak or partial order relations, rather than single values. In the recent ...