Sciweavers

4255 search results - page 308 / 851
» On Learning Boolean Functions
Sort
View
ML
1998
ACM
136views Machine Learning» more  ML 1998»
15 years 6 months ago
Co-Evolution in the Successful Learning of Backgammon Strategy
Following Tesauro’s work on TD-Gammon, we used a 4000 parameter feed-forward neural network to develop a competitive backgammon evaluation function. Play proceeds by a roll of t...
Jordan B. Pollack, Alan D. Blair
TIT
1998
70views more  TIT 1998»
15 years 6 months ago
The Importance of Convexity in Learning with Squared Loss
We show that if the closureof a function class F under the metric induced by some probability distribution is not convex, then the sample complexity for agnostically learning F wi...
Wee Sun Lee, Peter L. Bartlett, Robert C. Williams...
CORR
2012
Springer
214views Education» more  CORR 2012»
14 years 2 months ago
Stochastic Low-Rank Kernel Learning for Regression
We present a novel approach to learn a kernelbased regression function. It is based on the use of conical combinations of data-based parameterized kernels and on a new stochastic ...
Pierre Machart, Thomas Peel, Liva Ralaivola, Sandr...
IJCAI
1997
15 years 8 months ago
Is Nonparametric Learning Practical in Very High Dimensional Spaces?
Many of the challenges faced by the £eld of Computational Intelligence in building intelligent agents, involve determining mappings between numerous and varied sensor inputs and ...
Gregory Z. Grudic, Peter D. Lawrence
ICML
2009
IEEE
16 years 7 months ago
Structure learning of Bayesian networks using constraints
This paper addresses exact learning of Bayesian network structure from data and expert's knowledge based on score functions that are decomposable. First, it describes useful ...
Cassio Polpo de Campos, Zhi Zeng, Qiang Ji