32 search results - page 1 / 7 » Transductive Rademacher Complexities for Learning Over a Gra... |
MLG
2007
Springer
13 years 11 months ago
2007
Springer
Recent investigations [12, 2, 8, 5, 6] and [11, 9] indicate the use of a probabilistic (’learning’) perspective of tasks defined on a single graph, as opposed to the traditio...
COLT
2007
Springer
13 years 11 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
2006
Springer
13 years 8 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 ...
NECO
2010
13 years 3 months ago
2010
In this paper we develop a novel generalization bound for learning the kernel problem. First, we show that the generalization analysis of the kernel learning problem reduces to in...
JMLR
2006
13 years 4 months ago
2006
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...