In computational learning theory (machine learning and theory of computation), Rademacher complexity, named after Hans Rademacher, measures richnessâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Yann Guermeur
- 2017 12th International Workshop on Selfâ€¦
- 2017

In the framework of agnostic learning, one of the main open problems of the theory of multi-category pattern classification isâ€¦Â (More)

Is this relevant?

2016

2016

- Chang Xu, Tongliang Liu, Dacheng Tao, Chao Xu
- IEEE Transactions on Image Processing
- 2016

We analyze the local Rademacher complexity of empirical risk minimization-based multi-label learning algorithms, and in doing soâ€¦Â (More)

Is this relevant?

2015

2015

- Gao Wen Wei
- 2015

Great successes of deep neural networks have been witnessed in various real applications. Many algorithmic and implementationâ€¦Â (More)

Is this relevant?

2015

2015

- Mehrnoosh Vahdat, Luca Oneto, Alessandro Ghio, Davide Anguita, Mathias Funk, Matthias Rauterberg
- 2015

In Machine Learning (ML), the learning process of an algorithm given a set of evidences is studied via complexity measures. Theâ€¦Â (More)

Is this relevant?

2013

2013

- Corinna Cortes, Marius Kloft, Mehryar Mohri
- NIPS
- 2013

We use the notion of local Rademacher complexity to design new algorithms for learning kernels. Our algorithms thereby benefitâ€¦Â (More)

Is this relevant?

Review

2009

Review

2009

- Xiaojin Zhu, Timothy T. Rogers, Bryan R. Gibson
- NIPS
- 2009

We propose to use Rademacher complexity, originally developed in computational learning theory, as a measure of human learningâ€¦Â (More)

Is this relevant?

2008

2008

- Mehryar Mohri, Afshin Rostamizadeh
- NIPS
- 2008

This paper presents the first Rademacher complexity-based error bounds for noni.i.d. settings, a generalization of similarâ€¦Â (More)

Is this relevant?

2007

2007

- Ran El-Yaniv, Dmitry Pechyony
- COLT
- 2007

We develop a technique for deriving data-dependent error bounds for transductive learning algorithms based on transductiveâ€¦Â (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- David S. Rosenberg, Peter L. Bartlett
- AISTATS
- 2007

In the multi-view approach to semisupervised learning, we choose one predictor from each of multiple hypothesis classes, and weâ€¦Â (More)

Is this relevant?

2006

2006

- Andreas Maurer
- COLT
- 2006

Bounds are given for the empirical and expected Rademacher complexity of classes of linear transformations from a Hilbert space Hâ€¦Â (More)

Is this relevant?