10054 search results - page 63 / 2011 » On the Complexity of Function Learning |
87
Voted
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
We present two novel perturbation-based linkage learning algorithms that extend LINC [5]; a version of LINC optimised for decomposition tasks (oLINC) and a hierarchical version of...
148
click to vote
STOC
2012
ACM
13 years 2 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
ALT
1999
Springer
15 years 4 months ago
1999
Springer
We introduce a new model for learning in the presence of noise, which we call the Nasty Noise model. This model generalizes previously considered models of learning with noise. Th...
99
Voted
BMCBI
2006
15 years 15 days ago
2006
Background: Retinal photoreceptors are highly specialised cells, which detect light and are central to mammalian vision. Many retinal diseases occur as a result of inherited dysfu...
116
Voted
NIPS
2001
15 years 1 months ago
2001
Classical statistical learning theory studies the generalisation performance of machine learning algorithms rather indirectly. One of the main detours is that algorithms are studi...