Discussion of ‘Multi-scale Fisher’s independence test for multivariate dependence’
关于《多元依赖的多尺度 Fisher 独立性检验》的讨论AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:材料讨论一般多元独立性检验,没有因果、网络干扰或其他所列领域的直接证据。
关于《多元依赖的多尺度 Fisher 独立性检验》的讨论AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
We read with interest the work of Gorsky & Ma (2022) on statistical dependence testing using a multi-scale Fisher’s independence test, MultiFIT. The procedure consists of first transforming the data to map to the unit ball, then performing univariate Fisher’s exact tests of independence on a collection of |$2 \times 2$| contingency tables, and finally correcting for the use of multiple testing. The collection is obtained using a divide-and-conquer approach with a coarse-to-fine procedure: the unit ball is partitioned into cuboids, and |$2 \times 2$| contingency tables of counts of samples in the cuboids are tested; the cuboids with small associated |$p$|-values are then further partitioned at finer resolutions and tested again. This approach has a number of advantages; chief among them are that the test is multivariate, the computational cost is in general |${O}(n\log n)$| as a function of the sample size |$n$|, and the test threshold is exact at any sample size, not an asymptotic limit. The problem of computationally efficient, linear-time dependence testing is important to address, and a number of approaches have been proposed in the machine learning and statistics literature. In the present discussion, we will provide brief descriptions of some of these approaches, enumerating their advantages and disadvantages in comparison with MultiFIT. We will evaluate the performance in terms of power of all tests on both synthetic and real-world data. We begin by placing the statistics against which Gorsky & Ma (2022) compared, namely the Brownian distance covariance and its generalizations (Székely & Rizzo, 2009; Lyons, 2013), within the broader framework of kernel-based independence testing. Sejdinovic et al. (2013, Theorem 24) established that the generalized distance covariance is an instance of a Hilbert–Schmidt independence criterion, HSIC (Gretton et al., 2005), which is the Hilbert–Schmidt norm of a covariance operator between features of |$X$| and features of |$Y$| in respective reproducing kernel Hilbert spaces. When these reproducing kernel Hilbert spaces are sufficiently rich, i.e., characteristic (Sriperumbudur et al., 2010), then the HSIC is zero if and only if |$X$| and |$Y$| are independent (Gretton, 2015; Szabó & Sriperumbudur, 2018). This is always the case for exponentiated quadratic kernels, and it is also true for the family of distance-induced kernels that define the Brownian distance covariance, subject to appropriate moment conditions (Sejdinovic et al., 2013, Proposition 29 and Remark 31). Statistical tests of independence using the HSIC have been proposed by Gretton et al. (2007), Chwialkowski & Gretton (2014) and Chwialkowski et al. (2014), with computational cost |${O}(n^2)$|. In the next section, we describe approaches developed from these kernel statistics to yield greater computational efficiency and improved power.