Sciweavers

701 search results - page 22 / 141
» Self Bounding Learning Algorithms
Sort
View
IRMA
2000
13 years 11 months ago
Recognizing bounds of context change in on-line learning
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...
Helen Kaikova, Vagan Y. Terziyan, Borys Omelayenko
NIPS
2007
13 years 11 months ago
Stability Bounds for Non-i.i.d. Processes
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...
Mehryar Mohri, Afshin Rostamizadeh
COLT
2008
Springer
13 years 11 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
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...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
ICANN
1997
Springer
14 years 1 months ago
A Boosting Algorithm for Regression
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...
Alberto Bertoni, Paola Campadelli, M. Parodi
STOC
2001
ACM
119views Algorithms» more  STOC 2001»
14 years 10 months ago
Complex tilings
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...
Bruno Durand, Leonid A. Levin, Alexander Shen