Rademacher Chaos Complexities for Learning the Kernel Problem

By Yiming Ying, Colin Campbell. 2010

39 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Mechanics, Control and Systems Engineering

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Bharath K. Sriperumbudur
2. Arthur Gretton
3. Kenji Fukumizu
4. Bernhard Schölkopf
5. Dino Sejdinovic
6. Krikamol Muandet
7. Kacper P. Chwialkowski
8. Nathan Kallus

In Computational Mechanics

1. Bharath K. Sriperumbudur

In Control and Systems Engineering

1. Bharath K. Sriperumbudur
2. Arthur Gretton
3. Kenji Fukumizu
4. Dino Sejdinovic

Citations in the corpus

• On the optimal estimation of probability measures in weak and strong topologies (2013, methodology): “shattered by F, which implies VC(F)≤2. If θ=δi=0 for all i∈ {1,...,d}, then F ={fσ(x,y) =e−σkx−yk 2 2: σ∈ (0,∞)}. Using the same technique as above (also see the proof of Lemma 2 in Ying and Campbell [40]), it can be shown that no two-point is shattered by F and, therefore, VC(F)=1. Proof of Theorem”