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 条
  • [31] Multi-hypothesis nearest-neighbor classifier based on class-conditional weighted distance metric
    Jiao, Lianmeng
    Pan, Quan
    Feng, Xiaoxue
    NEUROCOMPUTING, 2015, 151 : 1468 - 1476
  • [32] A SoPC architecture for nearest-neighbor based learning and recognition
    An, Fengwei
    Chen, Lei
    Mattausch, Hans Jurgen
    2014 INTERNATIONAL SYMPOSIUM ON INTELLIGENT SIGNAL PROCESSING AND COMMUNICATION SYSTEMS (ISPACS), 2014, : 147 - 152
  • [33] Derivation of nearest-neighbor properties from oligomers: Consequences of nearest-neighbor absences and treatment of ends.
    Gray, DM
    BIOPHYSICAL JOURNAL, 1997, 72 (02) : WP412 - WP412
  • [34] A nearest-neighbor divide-and-conquer approach for adaptive random testing
    Huang, Rubing
    Sun, Weifeng
    Chen, Haibo
    Cui, Chenhui
    Yang, Ning
    SCIENCE OF COMPUTER PROGRAMMING, 2022, 215
  • [35] Nearest-neighbor variance estimation (NNVE): Robust covariance estimation via nearest-neighbor cleaning - Comment
    Soofi, ES
    Dadpay, A
    JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 2002, 97 (460) : 1012 - 1014
  • [36] A nearest-neighbor divide-and-conquer approach for adaptive random testing
    Huang, Rubing
    Sun, Weifeng
    Chen, Haibo
    Cui, Chenhui
    Yang, Ning
    Science of Computer Programming, 2022, 215
  • [37] Prototype optimization for nearest-neighbor classification
    Huang, YS
    Chiang, CC
    Shieh, JW
    Grimson, E
    PATTERN RECOGNITION, 2002, 35 (06) : 1237 - 1245
  • [38] Limitations of nearest-neighbor quantum networks
    Hahn, F.
    Dahlberg, A.
    Eisert, J.
    Pappa, A.
    PHYSICAL REVIEW A, 2022, 106 (01)
  • [39] EXPERIMENT WITH EDITED NEAREST-NEIGHBOR RULE
    TOMEK, I
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1976, 6 (06): : 448 - 452
  • [40] Stereo matching as a nearest-neighbor problem
    Tomasi, C
    Manduchi, R
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1998, 20 (03) : 333 - 340