Sciweavers

10054 search results - page 124 / 2011
» On the Complexity of Function Learning
Sort
View
CEC
2005
IEEE
15 years 6 months ago
XCS with computed prediction for the learning of Boolean functions
Computed prediction represents a major shift in learning classifier system research. XCS with computed prediction, based on linear approximators, has been applied so far to functi...
Pier Luca Lanzi, Daniele Loiacono, Stewart W. Wils...
95
Voted
CORR
2010
Springer
92views Education» more  CORR 2010»
15 years 19 days ago
Hardness Results for Agnostically Learning Low-Degree Polynomial Threshold Functions
Hardness results for maximum agreement problems have close connections to hardness results for proper learning in computational learning theory. In this paper we prove two hardnes...
Ilias Diakonikolas, Ryan O'Donnell, Rocco A. Serve...
95
Voted
ICPR
2000
IEEE
16 years 1 months ago
On Gaussian Radial Basis Function Approximations: Interpretation, Extensions, and Learning Strategies
In this paper we focus on an interpretation of Gaussian radial basis functions (GRBF) which motivates extensions and learning strategies. Specifically, we show that GRBF regressio...
Mário A. T. Figueiredo
95
Voted
ICML
2000
IEEE
16 years 1 months ago
Learning Subjective Functions with Large Margins
In manyoptimization and decision problems the objective function can be expressed as a linear combinationof competingcriteria, the weights of whichspecify the relative importanceo...
Claude-Nicolas Fiechter, Seth Rogers
97
Voted
ILP
2001
Springer
15 years 5 months ago
Learning Functions from Imperfect Positive Data
The Bayesian framework of learning from positive noise-free examples derived by Muggleton [12] is extended to learning functional hypotheses from positive examples containing norma...
Filip Zelezný