701 search results - page 22 / 141 » Self Bounding Learning Algorithms |
IRMA
2000
15 years 1 months ago
2000
The on-line algorithms in machine learning are intended to discover unknown function of the domain based on incremental observing of it instance by instance. These algorithms have...
91
Voted
NIPS
2007
15 years 1 months ago
2007
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
123
Voted
COLT
2008
Springer
15 years 2 months ago
2008
Springer
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
110
click to vote
ICANN
1997
Springer
15 years 4 months ago
1997
Springer
A new boosting algorithm ADABOOST-R for regression problems is presented and upper bound on the error is obtained. Experimental results to compare ADABOOST-R and other learning alg...
85
Voted
STOC
2001
ACM
16 years 23 days ago
2001
ACM
Two infinite families of self-similar tilings are described which have apparently not been reported before. Each tiling is based on a single prototile that is a segment of a regul...