417 search results - page 5 / 84 » Generalization Bounds for Some Ordinal Regression Algorithms |
BIRTHDAY
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. A formula ψ(Y ) is a selector for a formula ϕ(Y ) in a structure M if there exists a unique Y that satisfies ψ in M and this Y also satisfies ϕ. A formula ψ(X, Y )...
JMLR
2002
13 years 7 months ago
2002
We define notions of stability for learning algorithms and show how to use these notions to derive generalization error bounds based on the empirical error and the leave-one-out e...
ECAI
2010
Springer
13 years 8 months ago
2010
Springer
We study the problem of fairly dividing a set of goods amongst a group of agents, when those agents have preferences that are ordinal relations over alternative bundles of goods (r...
COLT
2005
Springer
14 years 26 days ago
2005
Springer
Abstract. We derive upper and lower bounds for some statistical estimation problems. The upper bounds are established for the Gibbs algorithm. The lower bounds, applicable for all ...
UAI
2003
13 years 8 months ago
2003
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...