539 search results - page 29 / 108 » Learning Monotonic Linear Functions |
KDD
2008
ACM
14 years 8 months ago
2008
ACM
Classic mixture models assume that the prevalence of the various mixture components is fixed and does not vary over time. This presents problems for applications where the goal is...
SAGT
2009
Springer
14 years 2 months ago
2009
Springer
Congestion games—in which players strategically choose from a set of “resources” and derive utilities that depend on the congestion on each resource— are important in a wid...
NIPS
2007
13 years 9 months ago
2007
We present a novel linear clustering framework (DIFFRAC) which relies on a linear discriminative cost function and a convex relaxation of a combinatorial optimization problem. The...
COLT
2006
Springer
13 years 9 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...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we prove for the first time that the learning complexity of Rocchio’s algorithm is O(d+d2 (log d+log n)) over the discretized vector space {0, . . . , n − 1}d ,...