Nearest-Neighbor Sampling Based Conditional Independence Testing

被引:0
|
作者
Li, Shuai [1 ]
Chen, Ziqi [1 ]
Zhu, Hongtu [2 ,3 ,4 ,5 ]
Wang, Christina Dan [6 ]
Wen, Wang [7 ]
机构
[1] East China Normal Univ, Sch Stat, KLATASDS MOE, Shanghai, Peoples R China
[2] Univ N Carolina, Dept Biostat, Chapel Hill, NC USA
[3] Univ N Carolina, Dept Stat, Chapel Hill, NC USA
[4] Univ N Carolina, Dept Comp Sci, Chapel Hill, NC USA
[5] Univ N Carolina, Dept Genet, Chapel Hill, NC USA
[6] New York Univ Shanghai, Business Div, Shanghai, Peoples R China
[7] Cent South Univ, Sch Math & Stat, Changsha, Peoples R China
基金
上海市自然科学基金; 中国国家自然科学基金;
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The conditional randomization test (CRT) was recently proposed to test whether two random variables X and Y are conditionally independent given random variables Z. The CRT assumes that the conditional distribution of X given Z is known under the null hypothesis and then it is compared to the distribution of the observed samples of the original data. The aim of this paper is to develop a novel alternative of CRT by using nearest-neighbor sampling without assuming the exact form of the distribution of X given Z. Specifically, we utilize the computationally efficient 1-nearest-neighbor to approximate the conditional distribution that encodes the null hypothesis. Then, theoretically, we show that the distribution of the generated samples is very close to the true conditional distribution in terms of total variation distance. Furthermore, we take the classifier-based conditional mutual information estimator as our test statistic. The test statistic as an empirical fundamental information theoretic quantity is able to well capture the conditional-dependence feature. We show that our proposed test is computationally very fast, while controlling type I and II errors quite well. Finally, we demonstrate the efficiency of our proposed test in both synthetic and real data analyses.
引用
收藏
页码:8631 / 8639
页数:9
相关论文
共 50 条
  • [41] NEAREST-NEIGHBOR ELECTRON SCATTERING IN SILICON
    TAUB, H
    STERN, RM
    APPLIED PHYSICS LETTERS, 1966, 9 (07) : 261 - &
  • [42] NOTE ON RABINS NEAREST-NEIGHBOR ALGORITHM
    FORTUNE, S
    HOPCROFT, J
    INFORMATION PROCESSING LETTERS, 1979, 8 (01) : 20 - 23
  • [43] A simple nearest-neighbor flocking rule
    Di Franco, A
    Narendra, KS
    2005 IEEE Swarm Intelligence Symposium, 2005, : 409 - 411
  • [44] Effective Nearest-Neighbor Music Recommendations
    Ludewig, Malte
    Kamehkhosh, Iman
    Landia, Nick
    Jannach, Dietmar
    RECSYS CHALLENGE'18: PROCEEDINGS OF THE ACM RECOMMENDER SYSTEMS CHALLENGE 2018, 2018,
  • [45] Evolutionary learning of nearest-neighbor MLP
    Univ of Aizu, Aizu-Wakamatsu City, Japan
    IEEE Trans Neural Networks, 3 (762-767):
  • [46] Nearest-neighbor correlations in the Hubbard model
    Russian Federal Nuclear Center, VNIIEF, pr. Myra 37, Sarov, Nizhni Novgorod Region 607190, Russia
    Physics Letters, Section A: General, Atomic and Solid State Physics, 1998, 245 (1-2): : 153 - 157
  • [47] Nearest-neighbor recognition in phospholipid membranes
    Davidson, SMK
    Regen, SL
    CHEMICAL REVIEWS, 1997, 97 (05) : 1269 - 1279
  • [48] Nearest-neighbor distribution for singular billiards
    Bogomolny, E
    Giraud, O
    Schmit, C
    PHYSICAL REVIEW E, 2002, 65 (05)
  • [49] The Nearest-Neighbor Technique for particle identification
    Pallavicini, M
    Patrignani, C
    Pontil, M
    Verri, A
    NUCLEAR INSTRUMENTS & METHODS IN PHYSICS RESEARCH SECTION A-ACCELERATORS SPECTROMETERS DETECTORS AND ASSOCIATED EQUIPMENT, 1998, 405 (01): : 133 - 138
  • [50] Distributed nearest-neighbor Gaussian processes
    Grenier, Isabelle
    Sanso, Bruno
    COMMUNICATIONS IN STATISTICS-SIMULATION AND COMPUTATION, 2023, 52 (07) : 2886 - 2898