176 search results - page 2 / 36 » The complexity of properly learning simple concept classes |
ICML
2009
IEEE
14 years 5 months ago
2009
IEEE
We present tight surrogate regret bounds for the class of proper (i.e., Fisher consistent) losses. The bounds generalise the margin-based bounds due to Bartlett et al. (2006). The...
ALT
1997
Springer
13 years 9 months ago
1997
Springer
Efficient learning of DFA is a challenging research problem in grammatical inference. It is known that both exact and approximate (in the PAC sense) identifiability of DFA is har...
ML
2002
ACM
13 years 4 months ago
2002
ACM
I describe a framework for interpreting Support Vector Machines (SVMs) as maximum a posteriori (MAP) solutions to inference problems with Gaussian Process priors. This probabilisti...
BMCBI
2006
13 years 4 months ago
2006
Background: Various statistical and machine learning methods have been successfully applied to the classification of DNA microarray data. Simple instance-based classifiers such as...
CN
2010
13 years 4 months ago
2010
The IETF currently discusses fast reroute mechanisms for IP networks (IP FRR). IP FRR accelerates the recovery in case of network element failures and avoids micro-loops during re...