113
Voted
ECAI
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Machine learning approaches in natural language processing often require a large annotated corpus. We present a complementary approach that utilizes expert knowledge to o...
99
Voted
COLT
2006
Springer
15 years 4 months ago
2006
Springer
We design algorithms for two online variance minimization problems. Specifically, in every trial t our algorithms get a covariance matrix Ct and try to select a parameter vector wt...
88
Voted
COLT
2006
Springer
15 years 4 months ago
2006
Springer
86
Voted
COLT
2006
Springer
15 years 4 months ago
2006
Springer
178
Voted
COLT
2006
Springer
15 years 4 months ago
2006
Springer
120
Voted
COLT
2006
Springer
15 years 4 months ago
2006
Springer
We describe a novel framework for the design and analysis of online learning algorithms based on the notion of duality in constrained optimization. We cast a sub-family of universa...
91
Voted
COLT
2006
Springer
15 years 4 months ago
2006
Springer
We are interested in supervised ranking with the following twist: our goal is to design algorithms that perform especially well near the top of the ranked list, and are only requir...
96
Voted
COLT
2006
Springer
15 years 4 months ago
2006
Springer
111
Voted
COLT
2006
Springer
15 years 4 months ago
2006
Springer
We study Mercer's theorem and feature maps for several positive definite kernels that are widely used in practice. The smoothing properties of these kernels will also be explo...
84
Voted
COLT
2006
Springer
15 years 4 months ago
2006
Springer
Bounds are given for the empirical and expected Rademacher complexity of classes of linear transformations from a Hilbert space H to a ...nite dimensional space. The results imply ...