4 search results - page 1 / 1 » Rademacher Complexity Bounds for Non-I.I.D. Processes |
NIPS
2008
13 years 6 months ago
2008
This paper presents the first Rademacher complexity-based error bounds for noni.i.d. settings, a generalization of similar existing bounds derived for the i.i.d. case. Our bounds ...
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...
ICML
2007
IEEE
14 years 5 months ago
2007
IEEE
We propose a formulation of the Decision Tree learning algorithm in the Compression settings and derive tight generalization error bounds. In particular, we propose Sample Compres...
PR
2011
12 years 7 months ago
2011
The existing Multi-View Learning (MVL) learns how to process patterns with multiple information sources. In generalization this MVL is proven to have a significant advantage over...