Sciweavers

1701 search results - page 274 / 341
» Learning Mappings with Neural Network
Sort
View
COLT
2001
Springer
15 years 9 months ago
Rademacher and Gaussian Complexities: Risk Bounds and Structural Results
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 ...
Peter L. Bartlett, Shahar Mendelson
MICAI
2000
Springer
15 years 8 months ago
Verification of Correct Pronunciation of Mexican Spanish Using Speech Technology
This paper presents a new method for the verification of the correct pronunciation of spoken words. This process is based on speech recognition technology. It can be particularly ...
Ingrid Kirschning, Nancy Aguas
EMNLP
2006
15 years 5 months ago
Loss Minimization in Parse Reranking
We propose a general method for reranker construction which targets choosing the candidate with the least expected loss, rather than the most probable candidate. Different approac...
Ivan Titov, James Henderson
ISIWI
2000
15 years 5 months ago
Automatic Document Classification - A thorough Evaluation of various Methods
(Automatic) document classification is generally defined as content-based assignment of one or more predefined categories to documents. Usually, machine learning, statistical patt...
Christoph Goller, J. Löning, T. Will, W. Wolf...
JMLR
2002
135views more  JMLR 2002»
15 years 4 months ago
Covering Number Bounds of Certain Regularized Linear Function Classes
Recently, sample complexity bounds have been derived for problems involving linear functions such as neural networks and support vector machines. In many of these theoretical stud...
Tong Zhang