73 search results - page 8 / 15 » The Complexity of Learning Concept Classes with Polynomial G... |
134
Voted
ALT
1999
Springer
15 years 3 months ago
1999
Springer
We are concerned with the problem of sequential prediction using a givenhypothesis class of continuously-manyprediction strategies. An e ectiveperformance measure is the minimax re...
119
click to vote
JMLR
2011
14 years 6 months ago
2011
While most supervised machine learning models assume that training examples are sampled at random or adversarially, this article is concerned with models of learning from a cooper...
95
Voted
ECAI
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We consider the problem of learning a user's ordinal preferences on a multiattribute domain, assuming that her preferences are lexicographic. We introduce a general ...
103
Voted
FOCS
1991
IEEE
15 years 3 months ago
1991
IEEE
We wish to increase the power of an arbitrary algorithm designed for non-degenerate input, by allowing it to execute on all inputs. We concentrate on in nitesimal symbolic perturba...
ALT
1999
Springer
15 years 3 months ago
1999
Springer
We introduce a new model for learning in the presence of noise, which we call the Nasty Noise model. This model generalizes previously considered models of learning with noise. Th...