10054 search results - page 73 / 2011 » On the Complexity of Function Learning |
COLT
2008
Springer
13 years 11 months ago
2008
Springer
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
COLT
2006
Springer
14 years 1 months ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
CORR
2012
Springer
12 years 5 months ago
2012
Springer
The key limiting factor in graphical model inference and learning is the complexity of the partition function. We thus ask the question: what are the most general conditions under...
COLT
2004
Springer
14 years 3 months ago
2004
Springer
ARTMED
2006
13 years 10 months ago
2006
Objective: Knowledge acquisition and maintenance in medical domains with a large application domain ontology is a difficult task. To reduce knowledge elicitation costs, semiautoma...