1106 search results - page 47 / 222 » On regularization algorithms in learning theory |
131
Voted
SIGECOM
2004
ACM
15 years 10 months ago
2004
ACM
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that l...
116
Voted
ATAL
2009
Springer
15 years 11 months ago
2009
Springer
Reinforcement learning algorithms that use eligibility traces, such as Sarsa(λ), have been empirically shown to be effective in learning good estimated-state-based policies in pa...
144
click to vote
SDM
2007
SIAM
15 years 6 months ago
2007
SIAM
We study the joint feature selection problem when learning multiple related classification or regression tasks. By imposing an automatic relevance determination prior on the hypo...
163
click to vote
IJCAI
1993
15 years 6 months ago
1993
This paper introduces a new concept, a decision tree (or list) over tree patterns, which is a natural extension of a decision tree (or decision list), for dealing with tree struct...
146
click to vote
IJCAI
2003
15 years 6 months ago
2003
Refinement operators for theories avoid the problems related to the myopia of many relational learning algorithms based on the operators that refine single clauses. However, the n...