567 search results - page 76 / 114 » Learning All Subfunctions of a Function |
COLT
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We show several PAC-style concentration bounds for learning unigrams language model. One interesting quantity is the probability of all words appearing exactly k times in...
108
click to vote
COLT
2006
Springer
15 years 2 months ago
2006
Springer
There are two main families of on-line algorithms depending on whether a relative entropy or a squared Euclidean distance is used as a regularizer. The difference between the two f...
133
Voted
KDD
2007
ACM
16 years 25 days ago
2007
ACM
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and different r...
122
Voted
COLT
2005
Springer
15 years 6 months ago
2005
Springer
We discuss a simple sparse linear problem that is hard to learn with any algorithm that uses a linear combination of the training instances as its weight vector. The hardness holds...
123
Voted
NIPS
2008
15 years 1 months ago
2008
This paper studies global ranking problem by learning to rank methods. Conventional learning to rank methods are usually designed for `local ranking', in the sense that the r...