4263 search results - page 220 / 853 » Learning without Coding |
105
click to vote
SIAMCO
2000
15 years 1 months ago
2000
It is shown here that stability of the stochastic approximation algorithm is implied by the asymptotic stability of the origin for an associated ODE. This in turn implies convergen...
138
click to vote
TCS
2011
14 years 9 months ago
2011
An active learner has a collection of data points, each with a label that is initially hidden but can be obtained at some cost. Without spending too much, it wishes to find a cla...
165
click to vote
ICANN
2011
Springer
14 years 5 months ago
2011
Springer
Abstract. In many supervised learning tasks it can be costly or infeasible to obtain objective, reliable labels. We may, however, be able to obtain a large number of subjective, po...
227
Voted
CP
2009
Springer
16 years 2 months ago
2009
Springer
In this work, we improve on existing work that studied the relationship between the proof system of modern SAT solvers and general resolution. Previous contributions such as those ...
105
click to vote
ECIR
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We present a new learning to rank framework for estimating context-sensitive term weights without use of feedback. Specifically, knowledge of effective term weights on ...