539 search results - page 11 / 108 » Learning Monotonic Linear Functions |
119
Voted
COLT
2004
Springer
15 years 5 months ago
2004
Springer
We study the problem of classifying data in a given taxonomy when classifications associated with multiple and/or partial paths are allowed. We introduce an incremental algorithm u...
108
click to vote
CP
2006
Springer
15 years 5 months ago
2006
Springer
We consider probabilistic constrained linear programs with general distributions for the uncertain parameters. These problems generally involve non-convex feasible sets. We develo...
77
Voted
CRYPTO
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. We study unconditionally secure 1-out-of-2 Oblivious Transfer (1-2 OT). We first point out that a standard security requirement for 1-2 OT of bits, namely that the receiv...
108
click to vote
COLT
2000
Springer
15 years 6 months ago
2000
Springer
This paper collects together a miscellany of results originally motivated by the analysis of the generalization performance of the “maximum-margin” algorithm due to Vapnik and...
124
click to vote
ICML
2010
IEEE
15 years 2 months ago
2010
IEEE
We present the first temporal-difference learning algorithm for off-policy control with unrestricted linear function approximation whose per-time-step complexity is linear in the ...