Rademacher complexity

Known as: Rademacher

In computational learning theory (machine learning and theory of computation), Rademacher complexity, named after Hans Rademacher, measures richness…

Papers overview

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

2018

This paper contributes to the generalization of Rademacher's differentiability result for Lipschitz functions when the domain is…

2014

2011

The article is devoted to algebraic properties of the multi-level system of molecular-genetic alphabets. It leads to help solve…

2006

A Qk(R n )-valued function is essentially a rule assigning k unordered and non necessarily distinct elements of R n to each…

2002

Three studies were conducted to evaluate the effect of post-infection sprays of prohexadione-calcium on the severity of naturally…

2001

We deal with the performance bounding of fuzzy ARTMAP and other ART-based neural network architectures, such as boosted ARTMAP…

2000

We show that a Rademacher expansion can be used to establish an exact bound for the entropy of black holes within a conformal…

1992

In [A & G], the authors introuced the so-called generalized Rademacher functions and used the to prove that every continuous…

1984

A method is described for the derivation of fault signatures for the detection of stuck-at faults in single-output combinational…

1959

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…