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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
This article is devoted to applications of projection operators to simulate phenomenological properties of the molecular-genetic… 
2011
2011
The article is devoted to algebraic properties of the multi-level system of molecular-genetic alphabets. It leads to help solve… 
2011
2011
Ergebnisse: Bronchiektasen, bei denen als Ursache eine zystische Fibrose (CF) ausgeschlossen wurde, bezeichnet man als Non-CF… 
2011
2011
The Maximal Discrepancy and the Rademacher Complexity are powerful statistical tools that can be exploited to obtain reliable… 
2010
2010
Rezension zu: Sandra Rademacher: Der erste Schultag. Padagogische Berufskulturen im deutschamerikanischen Vergleich. Wiesbaden… 
2009
2009
We present risk bounds for position-sensitive max-margin ranking algorithms that follow straightforwardly from a structural… 
2005
2005
In our previous experiments, greenhouse films that selectively remove far-red (FR) light from the growing environment reduced the… 
2004
2004
In this paper, we consider the space of multipliers of symmetric spaces with respect to the Rademacher systems. We obtain… 
1976
1976
Let A = Uq 1 {a(i) + PM: v = 0, 1, 2,. . . ), where q, M and the a(i) are positive integers such that a(l) 3. Later Iseki [5… 
1941
1941
1.1. The concept of an absolutely continuous function of a single real variable plays a fundamental role in a variety of one…