COLT
2007
Springer
14 years 7 months ago
2007
Springer
In the multi-view regression problem, we have a regression problem where the input variable (which is a real vector) can be partitioned into two different views, where it is assum...
COLT
2007
Springer
14 years 7 months ago
2007
Springer
We give an algorithm for the on-line learning of permutations. The algorithm maintains its uncertainty about the target permutation as a doubly stochastic weight matrix, and makes...
COLT
2007
Springer
14 years 7 months ago
2007
Springer
The standard so-called experts algorithms are methods for utilizing a given set of “experts” to make good choices in a sequential decision-making problem. In the standard setti...
COLT
2007
Springer
14 years 7 months ago
2007
Springer
COLT
2007
Springer
14 years 7 months ago
2007
Springer
We present data-dependent error bounds for transductive learning based on transductive Rademacher complexity. For specific algorithms we provide bounds on their Rademacher complex...
COLT
2007
Springer
14 years 7 months ago
2007
Springer
In the present paper, we study the problem of aggregation under the squared loss in the model of regression with deterministic design. We obtain sharp oracle inequalities for conve...
COLT
2007
Springer
14 years 7 months ago
2007
Springer
COLT
2007
Springer
14 years 7 months ago
2007
Springer
This paper analyzes the potential advantages and theoretical challenges of “active learning” algorithms. Active learning involves sequential sampling procedures that use infor...
COLT
2007
Springer
14 years 7 months ago
2007
Springer
This paper solves an important problem left open in the literature by showing that U-shapes are unnecessary in iterative learning. A U-shape occurs when a learner first learns, t...
COLT
2007
Springer
14 years 7 months ago
2007
Springer
