2750 search results - page 36 / 550 » The complexity of learning SUBSEQ(A) |
164
click to vote
COLT
2001
Springer
15 years 10 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 ...
153
click to vote
ICML
2006
IEEE
16 years 6 months ago
2006
IEEE
We state and analyze the first active learning algorithm which works in the presence of arbitrary forms of noise. The algorithm, A2 (for Agnostic Active), relies only upon the ass...
156
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
A learning problem might have several measures of complexity (e.g., norm and dimensionality) that affect the generalization error. What is the interaction between these complexiti...
154
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Statistical learning theory chiefly studies restricted hypothesis classes, particularly those with finite Vapnik-Chervonenkis (VC) dimension. The fundamental quantity of interest i...
191
Voted
ICTAI
2008
IEEE
16 years 15 days ago
2008
IEEE
Unlike simple questions, complex questions cannot be answered by simply extracting named entities. These questions require inferencing and synthesizing information from multiple d...