Sciweavers

2934 search results - page 82 / 587
» Hypothesis Spaces for Learning
Sort
View
COLT
1999
Springer
15 years 8 months ago
Multiclass Learning, Boosting, and Error-Correcting Codes
We focus on methods to solve multiclass learning problems by using only simple and efficient binary learners. We investigate the approach of Dietterich and Bakiri [2] based on er...
Venkatesan Guruswami, Amit Sahai
ML
2008
ACM
156views Machine Learning» more  ML 2008»
15 years 4 months ago
On the connection between the phase transition of the covering test and the learning success rate in ILP
It is well-known that heuristic search in ILP is prone to plateau phenomena. An explanation can be given after the work of Giordana and Saitta: the ILP covering test is NP-complete...
Érick Alphonse, Aomar Osmani
ALT
2011
Springer
14 years 4 months ago
On Noise-Tolerant Learning of Sparse Parities and Related Problems
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...
Elena Grigorescu, Lev Reyzin, Santosh Vempala
GECCO
2004
Springer
15 years 9 months ago
Improving the Locality Properties of Binary Representations
Abstract. Choosing representations and operators that preserve locality between genotype and phenotype space is an important goal in EA design. In the GA literature there has been ...
Adrian Grajdeanu, Kenneth A. De Jong
ICPR
2010
IEEE
15 years 11 months ago
A Bound on the Performance of LDA in Randomly Projected Data Spaces
We consider the problem of classification in nonadaptive dimensionality reduction. Specifically, we bound the increase in classification error of Fisher’s Linear Discriminant...
Robert John Durrant, Ata Kaban