Skip to search formSkip to main contentSkip to account menu

Rademacher complexity

Known as: Rademacher 
In computational learning theory (machine learning and theory of computation), Rademacher complexity, named after Hans Rademacher, measures richness… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
Complexity indexComputational learning theoryKernel methodSample complexity

Broader (1)

Machine learning

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Manifold-preserving graph reduction for sparse semi-supervised learning
2011
2011
Matrix Genetics and Algebraic Properties of the Multi-Level System of Genetic Alphabets
The article is devoted to algebraic properties of the multi-level system of molecular-genetic alphabets. It leads to help solve… 
2011
2011
Spectral Distribution of Random Matrices From Binary Linear Block Codes
Let <i>C</i> be a binary linear block code of length <i>n</i>, dimension <i>k</i> and minimum Hamming distance <i>d</i> over GF(2… 
2007
2007
Rademacher Margin Complexity
where σ1, ...σn are iid Rademacher random variables. Rn(F ) characterizes the extent to which the functions in F can be best… 
2006
2006
A SELECTION THEORY FOR MULTIPLE-VALUED FUNCTIONS IN THE SENSE OF ALMGREN
A Qk(R n )-valued function is essentially a rule assigning k unordered and non necessarily distinct elements of R n to each… 
2001
2001
Rademacher penalization applied to fuzzy ARTMAP and boosted ARTMAP
We deal with the performance bounding of fuzzy ARTMAP and other ART-based neural network architectures, such as boosted ARTMAP… 
2000
2000
An Exact Black Hole Entropy Bound
We show that a Rademacher expansion can be used to establish an exact bound for the entropy of black holes within a conformal… 
1992
1992
The generalized Rademacher functions
In [A & G], the authors introuced the so-called generalized Rademacher functions and used the to prove that every continuous… 
1988
1988
A simple proof of the Rademacher theorem
1959
1959
Divergence of random power series.
Let o n (t) (n = 0, 1, 2, • • •) be the Rademacher functions, that is, let q) n (t) _ (-1) J for j/2 n < t,,, (j + 1)/2 n Given… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)