417 search results - page 11 / 84 » Generalization Bounds for Some Ordinal Regression Algorithms |
NIPS
2007
13 years 8 months ago
2007
When we have several related tasks, solving them simultaneously is shown to be more effective than solving them individually. This approach is called multi-task learning (MTL) and...
KDD
2004
ACM
14 years 7 months ago
2004
ACM
Reluctance of data owners to share their possibly confidential or proprietary data with others who own related databases is a serious impediment to conducting a mutually beneficia...
IPL
2008
13 years 7 months ago
2008
We define and solve a simple extension of the ski-rental problem [4]. In the classical version, the algorithm needs to decide when to switch from renting to buying. In our version...
CONSTRAINTS
2010
13 years 7 months ago
2010
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
NIPS
2008
13 years 8 months ago
2008
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...