148 search results - page 14 / 30 » Bounds for Linear Multi-Task Learning |
SIAMCOMP
2000
13 years 7 months ago
2000
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we prove for the first time that the learning complexity of Rocchio’s algorithm is O(d+d2 (log d+log n)) over the discretized vector space {0, . . . , n − 1}d ,...
ALT
2008
Springer
14 years 4 months ago
2008
Springer
In this paper we discuss boosting algorithms that maximize the soft margin of the produced linear combination of base hypotheses. LPBoost is the most straightforward boosting algor...
AI
1998
Springer
13 years 7 months ago
1998
Springer
The absolute loss is the absolute difference between the desired and predicted outcome. This paper demonstrates worst-case upper bounds on the absolute loss for the Perceptron le...
STOC
2012
ACM
11 years 10 months ago
2012
ACM
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...