Appendix for based Test of Independence for Cluster correlated Data Contents
–Neural Information Processing Systems
In this section, we present some preliminary results that will be useful in proving Theorem 3.2, Theorem 3.3 and Proposition 3.4. We draw upon existing theory on properties of random kernel matrices and extend these properties to cluster-correlated data. Specifically, we show the convergence of eigenvalues and eigenvectors of an empirical kernel matrix based on clustered data. Let (X,F,P) be a probability space and H be a Hilbert space over (X,F,P) with a symmetric kernel function k: X X R. Let H be a compact operator on H, defined by Hg(x) = Z Equivalently, Hn can be viewed as an n nreal matrix whose (i,j)-th entry is {Hn}i,j = 1 n k(Xi,Xj). This is the empirical kernel matrix scaled by a factor of 1/n. Here we restrict our discussion to a reproducing kernel Hilbert space (RKHS) H, where the kernel function k is positive semi-definite. We also assume that the operator H is Hilbert-Schmidt, with E[k2(X,X0)] < . Let λ(T) denote the spectrum of a compact, symmetric operator T. Then λ(H) and λ(Hn) are the sets of eigenvalues for H and Hn, respectively.
Neural Information Processing Systems
Apr-25-2026, 21:59:29 GMT
- Country:
- North America > United States (0.93)
- Genre:
- Research Report
- Strength High (1.00)
- Experimental Study (1.00)
- Research Report
- Industry:
- Health & Medicine (1.00)
- Technology: