Sciweavers

845 search results - page 7 / 169
» Complexity Dimensions and Learnability
Sort
View
DAGM
2006
Springer
13 years 11 months ago
Model Selection in Kernel Methods Based on a Spectral Analysis of Label Information
Abstract. We propose a novel method for addressing the model selection problem in the context of kernel methods. In contrast to existing methods which rely on hold-out testing or t...
Mikio L. Braun, Tilman Lange, Joachim M. Buhmann
ML
2007
ACM
108views Machine Learning» more  ML 2007»
13 years 6 months ago
Unconditional lower bounds for learning intersections of halfspaces
We prove new lower bounds for learning intersections of halfspaces, one of the most important concept classes in computational learning theory. Our main result is that any statist...
Adam R. Klivans, Alexander A. Sherstov
LATA
2010
Springer
14 years 13 days ago
Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach
Abstract. Kanazawa ([1]) has studied the learnability of several parameterized families of classes of categorial grammars. These classes were shown to be learnable from text, in th...
Christophe Costa Florêncio, Henning Fernau
CSL
2003
Springer
14 years 17 days ago
The Arithmetical Complexity of Dimension and Randomness
Constructive dimension and constructive strong dimension are effectivizations of the Hausdorff and packing dimensions, respectively. Each infinite binary sequence A is assigned...
John M. Hitchcock, Jack H. Lutz, Sebastiaan Terwij...
MFCS
2005
Springer
14 years 25 days ago
Dimension Is Compression
Abstract. Effective fractal dimension was defined by Lutz (2003) in order to quantitatively analyze the structure of complexity classes. Interesting connections of effective dim...
María López-Valdés, Elvira Ma...