Pith. sign in

REVIEW 4 major objections 4 minor 67 references

MATES: Multi-view Aggregated Two-Sample Test

T0 review · 4 major / 4 minor · reviewed 2026-08-11 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read MATES aggregates multiple moment-specific similarity graphs into a single chi-square statistic that detects higher-order distributional differences where twelve existing tests remain at the nominal level.

desk verdict A useful multi-view graph-based two-sample test with a clean chi-square null, but the heavy-tail robustness claim is not backed by the default moment-power views and the core proof sits in an unavailable supplement. read the letter →

arxiv 2412.16684 v1 pith:NFU6OMCI submitted 2024-12-21 stat.ME math.STstat.TH

Zexi Cai , Wenbo Fei , Doudou Zhou This is my paper · ORCID
classification stat.MEmath.STstat.TH MSC 62G1062G2062H15
keywords two-sampletestgraph-basedmethodhigher-ordermomentsmulti-viewaggregationdistribution-freechi-squarelimitingdistributionhigh-dimensionaldata
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper proposes MATES, a two-sample test that builds one weighted similarity graph for each "view" of the data—commonly the first, second, third, and fourth moments—and combines the within-sample edge-weight sums from all views into a single Mahalanobis statistic. The aim is to detect distributional differences that leave means and covariances unchanged, such as differences in skewness or kurtosis, which the paper argues are invisible to most nonparametric tests in high dimensions. The central theoretical claim is that this statistic has a distribution-free limiting $\chi^2_{2S}$ distribution under the null, so a practitioner can control type-I error with an analytic p-value rather than permutation. In the paper's motivating example, MATES reaches power 0.91 where twelve established tests remain near the 0.05 nominal level, and on S&P100 returns around the ChatGPT release it is the only method considered that rejects at level 0.01.

What carries the argument

The central object is the multi-view weighted similarity graph $W^{(s)}$, a matrix of edge weights on the pooled sample's k-nearest-neighbor or minimum-spanning-tree graph built from the sth dissimilarity measure, such as $D^{(s)}_{ij}=\sum_r |Z_{ir}^s - Z_{jr}^s|$. The machinery is the permutation-null moment calculus of Theorem 1, which gives closed-form means and covariances of within-sample weight sums in terms of aggregate weight sums; Theorem 2's decomposition into "within" and "difference" components, which isolates conditions for invertibility; and the Lindeberg-type hub conditions of Theorem 4 that yield the $\chi^2_{2S}$ limit.

What would settle it

The decisive check is to simulate from a null distribution with infinite fourth moment, such as $t_3$, and attempt the four-view MATES: each pairwise fourth-moment dissimilarity is infinite, so the statistic is undefined. A separate check for the distribution-free claim is a size simulation under the Theorem 4 conditions, for example i.i.d. normal data with $k=\lfloor N^{0.8}\rfloor$; the empirical rejection rate must track the nominal level as $N$ grows.

Watch

Extended reading notes

Core claim

The paper introduces MATES, a two-sample test built from S weighted similarity graphs on the pooled sample, one graph per "view" of the data. For each view s, the statistic collects $U_x^{(s)}$ and $U_y^{(s)}$, the sums of edge weights among observations within the first and second samples, centered by their permutation expectations. The aggregate statistic $T_S = v_S^\top \Sigma_S^{-1} v_S$ is a Mahalanobis combination of all views. The central discovery is that, under the permutation null, this statistic has a closed-form covariance (Theorem 1), splits into orthogonal within-sample and between-sample components (Theorem 2), is well defined exactly when the views' graph structures are linearly independent (Theorem 3), and converges to a $\chi^2_{2S}$ distribution (Theorem 4), giving a distribution-free analytic p-value.

Load-bearing premise

Each moment view is computed from absolute differences of the data raised to that power, so the method assumes the underlying distributions have finite moments up to the highest view used; with heavy-tailed data such as $t$ distributions on fewer than four degrees of freedom, the fourth-moment view is undefined.

Editorial extensions

If this is right

  • A p-value can be read from a $\chi^2_{2S}$ table, bypassing permutation or bootstrap, as long as the graph conditions hold.
  • MATES detects alternatives where two distributions share mean and covariance but differ in skewness or kurtosis; in the motivating example its power is 0.91 while twelve existing tests sit near 0.05.
  • Views are not limited to Euclidean moments: different Wasserstein orders for distributional data, cosine distance for images or networks, and rank or kernel weights can be mixed into the same statistic.
  • Views that are linearly redundant make the covariance matrix singular, so the framework supplies a check: drop redundant views before computing the test.
  • On S&P100 returns around the ChatGPT release, MATES rejects at level 0.01 while no comparator does, with the fourth-moment view alone giving a p-value of 0.004.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Going beyond the paper: the moment-based views require finite sth moments, so for heavy-tailed data such as $t$ distributions with fewer than four degrees of freedom, the fourth-moment graph cannot be built; the advertised ability to handle heavy-tailed data therefore holds only when the chosen views are finite.
  • Going beyond the paper: the same aggregation logic could be applied to change-point detection, classification, and clustering, where a shift or separation may appear only in variance or tail behavior.
  • Going beyond the paper: a practical pre-check for the chi-square limit is to inspect per-vertex degrees in each view and drop views with hubs; failure to control size in hub-heavy graphs would point directly at Condition (3) of Theorem 4.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 4 minor

Summary. The paper introduces MATES, a graph-based two-sample test that aggregates multiple dissimilarity views, each constructed from a moment of the data. The test statistic is a Mahalanobis-type combination of within-sample edge-count deviations across views, and the paper provides closed-form permutation-null moments and covariances (Theorem 1), a necessary and sufficient condition for the statistic to be well-defined (Theorem 3), and a claimed asymptotic chi-square null distribution with 2S degrees of freedom (Theorem 4). The method is evaluated in extensive simulations against 12 existing tests and in an S&P100 data application. The abstract and introduction advertise the distribution-free limiting distribution as enabling direct type-I error control, and the empirical results show high power in higher-moment alternatives.

Significance. If the asymptotic result is correct, MATES is a valuable addition to the nonparametric two-sample testing toolbox, providing a flexible multi-view framework with analytic p-values and strong empirical power for higher-order moment differences. The paper's closed-form moment formulas and careful simulation comparisons are strengths, as is the inclusion of a real data example. However, the central theoretical guarantee is not fully verifiable from the manuscript alone, and the default moment-based views conflict with the claimed robustness to heavy-tailed distributions.

major comments (4)
  1. [Section 4, Theorem 4] The proof of Theorem 4 is deferred to Supplementary S.2.4, which was not available for review. Because the distribution-free chi-square limit is the basis for the paper's headline claim of straightforward type-I error control, this unverifiable proof is a load-bearing gap. The authors should either provide the supplement with the full proof or justify the conditions directly in the main text.
  2. [Section 3, default configuration] The default configuration uses S=4 views with D^(s)_ij = Σ_r |Z_ir^s − Z_jr^s| and k=⌊N^0.8⌋. For a heavy-tailed null such as t_4, the fourth-moment view has infinite expected dissimilarity and the k-NNG will be dominated by extreme observations. This contradicts the claim in Section 2 that graph-based methods offer robustness to heavy-tailed distributions. The null simulations in Table 3 only include t_15 (setting (d)), which has a finite fourth moment, so the heavy-tail robustness claim is not demonstrated. The authors should either restrict the robustness claim to distributions with finite moments of order 2S, or modify the default view construction to be robust to infinite moments.
  3. [Section 4, Lemma 1] The sufficient conditions (1') and (2') for Theorem 4 are not verified for the specific k-NNG with k=floor(N^0.8) and exponential kernel weights used in the simulations. Condition (1') requires no dominating vertex, and condition (2') restricts the number of squares in the aggregated graph, but the paper does not show that the default graph satisfies these conditions. Without such verification, the empirical type-I error rates in Table 3 do not establish the validity of the asymptotic approximation for the recommended configuration.
  4. [Section 5] In the S&P100 application, the single-view p-values in Figure 1 are obtained from the asymptotic chi-square_2 approximation, but the sample sizes are only m=34 and n=32, and no evidence is given that the conditions of Theorem 4 hold for this data set. A permutation-based calibration for the single-view or aggregated statistic would strengthen the real-data conclusion.
minor comments (4)
  1. [Section 2, Similarity Measures] The notation in D^(s)_ij = Σ_r |Z^s_ir − Z^s_jr| is ambiguous: it is unclear whether Z^s_ir means the s-th power of the r-th coordinate or the r-th coordinate of the s-th view; please clarify.
  2. [Section 3, Table 2] The simulation settings table lists 't-distributions' for null setting (d) but does not specify the degrees of freedom in the table; the text later gives t_15. Please unify this information.
  3. [Section 4, Theorem 3] The phrase 'the S matrices cW^{(1)}, ..., cW^{(S)} are linearly independent' would be more precise if the ambient space (symmetric N×N matrices with zero diagonal) were specified.
  4. [General] The paper does not discuss the computational complexity of the proposed method; adding a brief statement would help practitioners assess its scalability.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the chi-square null limit is derived from explicit graph conditions, and the moment-view power demonstrations are validation rather than fitted predictions.

full rationale

The derivation chain is self-contained. TS is defined from the weighted multi-view graphs W(s), and Theorem 1 derives exact permutation-null moments and covariances; Theorem 2 provides an orthogonal decomposition; Theorem 3 gives explicit linear-independence conditions for the Mahalanobis combination to be well-defined; Theorem 4 states a chi-square_{2S} limit under five explicit conditions, with Lemma 1 giving sufficient graph conditions. None of these steps defines the conclusion into the premise: the null moments are computed combinatorially under label permutations, and the limit theorem is stated with assumptions that can fail rather than being assumed. The moment-based views are a design choice, and showing high power on distributions that differ in the targeted moments is standard validation, not a fitted prediction. The median-heuristic bandwidth is data-dependent but not tuned to outcomes. Self-citations to Zhou and Chen (2023) are used for an optional edge-weight scheme and for contextual statements that conditions are standard; the central limit theorem is stated with a proof in the supplement, so the self-citation is not load-bearing. Any concern that the default fourth-moment view is ill-defined for t_4-type heavy tails is a scope and robustness issue about Theorem 4's conditions, not a circularity.

Assumptions & free parameters 3 free parameters · 4 assumptions · 0 invented entities

The central claim rests on standard permutation-null theory plus four domain assumptions: symmetry, moment existence, regularity conditions for the chi-square limit, and positive definiteness of the covariance matrices. The three free parameters are heuristic tuning choices, not fitted to data in the reported experiments. No new physical or conceptual entities are introduced.

free parameters (3)
  • Number of views S = 4
    Section 3 fixes S=4, using Manhattan distances based on the first through fourth moments. This is a hand-chosen hyperparameter balancing coverage and computation.
  • k for k-NNG = floor(N^0.8)
    Section 3 states this choice 'leads to good power performance in general'. It is a heuristic, not derived from theory.
  • Bandwidth sigma^(s) for kernel weights = median pairwise dissimilarity per view
    Section 3 uses the median heuristic, a common default in kernel methods. It is a data-dependent choice but not fitted to the test outcome.
assumptions (4)
  • domain assumption The weight matrices W^(s) are symmetric or are replaced by their symmetrized version.
    Section 4, before Theorem 1, assumes symmetry and states that symmetrization does not change the test statistic. This is a mild but necessary restriction.
  • domain assumption The sth moments of the underlying distributions exist and are finite for each view used.
    The dissimilarity D^(s)_ij = sum_r |Z_ir^s - Z_jr^s| requires finite sth moments. This is not stated explicitly and conflicts with the claimed robustness to heavy tails.
  • domain assumption Conditions (1)-(5) of Theorem 4 hold for the graph configuration used.
    These conditions are stated as assumptions for the chi-square limit. The paper provides sufficient conditions in Lemma 1 but does not verify them for the exact k-NNG, k = floor(N^0.8), kernel-weighted setup used in the simulations.
  • domain assumption The covariance matrices Sigma_w and Sigma_diff are positive definite, equivalently the views are linearly independent as specified in Theorem 3.
    The test statistic is undefined if these matrices are singular. The paper advises removing redundant views but gives no automatic procedure to check this in practice.

how reviews work

0 comments
Cite this review

Pith. "Pith review of MATES: Multi-view Aggregated Two-Sample Test." pith.science (2026). https://pith.science/paper/NFU6OMCI

@misc{pith2026241216684,
  author       = {Pith},
  title        = {Pith review of: MATES: Multi-view Aggregated Two-Sample Test},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/NFU6OMCI}},
  note         = {Machine review of arXiv:2412.16684}
}
read the original abstract

The two-sample test is a fundamental problem in statistics with a wide range of applications. In the realm of high-dimensional data, nonparametric methods have gained prominence due to their flexibility and minimal distributional assumptions. However, many existing methods tend to be more effective when the two distributions differ primarily in their first and/or second moments. In many real-world scenarios, distributional differences may arise in higher-order moments, rendering traditional methods less powerful. To address this limitation, we propose a novel framework to aggregate information from multiple moments to build a test statistic. Each moment is regarded as one view of the data and contributes to the detection of some specific type of discrepancy, thus allowing the test statistic to capture more complex distributional differences. The novel multi-view aggregated two-sample test (MATES) leverages a graph-based approach, where the test statistic is constructed from the weighted similarity graphs of the pooled sample. Under mild conditions on the multi-view weighted similarity graphs, we establish theoretical properties of MATES, including a distribution-free limiting distribution under the null hypothesis, which enables straightforward type-I error control. Extensive simulation studies demonstrate that MATES effectively distinguishes subtle differences between distributions. We further validate the method on the S&P100 data, showcasing its power in detecting complex distributional variations.

Figures

Figures reproduced from arXiv: 2412.16684 by the authors.

Figure 1
Figure 1. Scatterplots of observed and permuted (U (s) w , U(s) diff) with 1000 permutations for the S&P100 data. correspond to the observed test statistic, while the gray and blue dots represent 1000 permuted samples. The p-values associated with each view are obtained in the following way. First, the single-view test statistic based on the sth moment can be represented by T ′ s = u T sΣ −1 u us, where us = (U (s) x − µ (s) … view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

67 extracted references · 54 canonical work pages

  1. [1]

    Anderson, T. W. and Darling, D. A. (1952). Asymptotic theory of certain ``goodness of fit" criteria based on stochastic processes. The Annals of Mathematical Statistics , 23(2):193--212

    work page 1952

  2. [2]

    A Robust Framework for Graph-based Two-Sample Tests Using Weights

    Bai, Y. and Chu, L. (2023). A robust framework for graph-based two-sample tests using weights. arXiv preprint arXiv:2307.12325

    work page Pith review arXiv 2023

  3. [3]

    Bartlett, M. S. (1937). Properties of sufficiency and statistical tests. Proceedings of the Royal Society of London. Series A-Mathematical and Physical Sciences , 160(901):268--282

    1937

  4. [4]

    Baumgartner, W., Wei , P., and Schindler, H. (1998). A nonparametric test for the general two-sample problem. Biometrics , 54(3):1129--1135

    work page 1998

  5. [5]

    and Ghosh, A

    Biswas, M. and Ghosh, A. K. (2014). A nonparametric two-sample test applicable to high dimensional data. Journal of Multivariate Analysis , 123:160--171

    work page 2014

  6. [6]

    and Munzel, U

    Brunner, E. and Munzel, U. (2000). The nonparametric B ehrens- F isher problem: asymptotic theory and a small-sample approximation. Biometrical Journal: Journal of Mathematical Methods in Biosciences , 42(1):17--25

    work page 2000

  7. [7]

    Cai, T., Liu, W., and Xia, Y. (2013). Two-sample covariance matrix testing and support recovery in high-dimensional and sparse settings. Journal of the American Statistical Association , 108(501):265--277

    work page 2013

  8. [8]

    Cai, T., Liu, W., and Xia, Y. (2014). Two-sample test of high dimensional means under dependence. Journal of the Royal Statistical Society Series B: Statistical Methodology , 76(2):349--372

    work page 2014

Show all 67 references
  1. [9]

    and Zhang, X

    Chakraborty, S. and Zhang, X. (2021). A new framework for distance and kernel-based metrics in high dimensions. Electronic Journal of Statistics , 15(2):5455--5522

    2021

  2. [10]

    Chang, J., Zhou, W., Zhou, W.-X., and Wang, L. (2017). Comparing large covariance matrices under weak conditions on the dependence structure and its application to gene clustering. Biometrics , 73(1):31--41

    2017

  3. [11]

    and Bhattacharya, B

    Chatterjee, A. and Bhattacharya, B. B. (2024). Boosting the power of kernel two-sample tests. Biometrika , page asae048

    2024

  4. [12]

    and Friedman, J

    Chen, H. and Friedman, J. H. (2017). A new graph-based two-sample test for multivariate and object data. Journal of the American Statistical Association , 112(517):397--409

    2017

  5. [13]

    and Zhang, N

    Chen, H. and Zhang, N. R. (2013). Graph-based tests for two-sample comparisons of categorical data. Statistica Sinica , 23:1479--1503

    2013

  6. [14]

    Chen, J., Tang, G., Zhou, G., and Zhu, W. (2023). ChatGPT , stock market predictability and links to the macroeconomy. Available at SSRN 4660148

    2023

  7. [15]

    Chen, S. X. and Qin, Y.-L. (2010). A two-sample test for high-dimensional data with applications to gene-set testing. The Annals of Statistics , 38(2):808

    2010

  8. [16]

    X., Zhang, L.-X., and Zhong, P.-S

    Chen, S. X., Zhang, L.-X., and Zhong, P.-S. (2010). Tests for high-dimensional covariance matrices. Journal of the American Statistical Association , 105(490):810--819

    2010

  9. [17]

    and Chen, H

    Chu, L. and Chen, H. (2019). Asymptotic distribution-free change-point detection for multivariate and non-Euclidean data. The Annals of Statistics , 47(1):382--414

    2019

  10. [18]

    Cram \'e r, H. (1928). On the composition of elementary errors. Scandinavian Actuarial Journal , 1928(1):13--74

    1928

  11. [19]

    and Savel'ev, S

    De Clerk, L. and Savel'ev, S. (2022). An investigation of higher order moments of empirical financial data and their implications to risk. Heliyon , 8(2)

    2022

  12. [20]

    and Sen, B

    Deb, N. and Sen, B. (2023). Multivariate rank-based distribution-free nonparametric testing using measure transportation. Journal of the American Statistical Association , 118(541):192--207

    2023

  13. [21]

    Friedman, J. H. and Rafsky, L. C. (1979). Multivariate generalizations of the W ald- W olfowitz and S mirnov two-sample tests. The Annals of Statistics , 7(4):697--717

    1979

  14. [22]

    J., Scholkopf, B., and Smola, A

    Gretton, A., Borgwardt, K., Rasch, M. J., Scholkopf, B., and Smola, A. J. (2008). A kernel method for the two-sample problem. arXiv preprint arXiv:0805.2368

    2008 arXiv

  15. [23]

    M., Rasch, M

    Gretton, A., Borgwardt, K. M., Rasch, M. J., Sch \"o lkopf, B., and Smola, A. (2012a). A kernel two-sample test. The Journal of Machine Learning Research , 13(1):723--773

    2012

  16. [24]

    Gretton, A., Fukumizu, K., Harchaoui, Z., and Sriperumbudur, B. K. (2009). A fast, consistent kernel two-sample test. In NIPS , volume 23, pages 673--681

    2009

  17. [25]

    Gretton, A., Sejdinovic, D., Strathmann, H., Balakrishnan, S., Pontil, M., Fukumizu, K., and Sriperumbudur, B. K. (2012b). Optimal kernel choice for large-scale two-sample tests. In Advances in Neural Information Processing Systems , pages 1205--1213

    2012

  18. [26]

    S., and Neeman, A

    Hall, P., Marron, J. S., and Neeman, A. (2005). Geometric representation of high dimension, low sample size data. Journal of the Royal Statistical Society Series B: Statistical Methodology , 67(3):427--444

    2005

  19. [27]

    Hediger, S., Michel, L., and N \"a f, J. (2022). On the use of random forest for two-sample testing. Computational Statistics & Data Analysis , 170:107435

    2022

  20. [28]

    Henze, N. (1988). A multivariate two-sample test based on the number of nearest neighbor type coincidences. The Annals of Statistics , 16(2):772--783

    1988

  21. [29]

    P., M \"o tt \"o nen, J., and Oja, H

    Hettmansperger, T. P., M \"o tt \"o nen, J., and Oja, H. (1998). Affine invariant multivariate rank tests for several samples. Statistica Sinica , 8:785--800

    1998

  22. [30]

    Hotelling, H. (1931). The generalization of S tudent's ratio. The Annals of Mathematical Statistics , 2(3):360--378

    1931

  23. [31]

    Jiang, Y., Wang, X., Wen, C., Jiang, Y., and Zhang, H. (2024). Nonparametric two-sample tests of high dimensional mean vectors via random integration. Journal of the American Statistical Association , 119(545):701--714

    2024

  24. [32]

    Khashanah, K., Simaan, M., and Simaan, Y. (2022). Do we need higher-order comoments to enhance mean-variance portfolios? E vidence from a simplified jump process. International Review of Financial Analysis , 81:102068

    2022

  25. [33]

    Kim, I., Ramdas, A., Singh, A., and Wasserman, L. (2021). Classification accuracy as a proxy for two-sample testing. The Annals of Statistics , 49(1):411--434

    2021

  26. [34]

    Kirchler, M., Khorasani, S., Kloft, M., and Lippert, C. (2020). Two-sample testing using deep learning. In International Conference on Artificial Intelligence and Statistics , pages 1387--1398. PMLR

    2020

  27. [35]

    Kolmogorov, A. N. (1933). Sulla determinazione empirica di una legge didistribuzione. Giorn Dell'inst Ital Degli Att , 4:89--91

    1933

  28. [36]

    and Litzenberger, R

    Kraus, A. and Litzenberger, R. H. (1976). Skewness preference and the valuation of risk assets. Journal of Finance , 31(4):1085--1100

    1976

  29. [37]

    and Vrins, F

    Lassance, N. and Vrins, F. (2021). Portfolio selection with parsimonious higher comoments estimation. Journal of Banking & Finance , 126:106115

    2021

  30. [38]

    Lefort, B., Benhamou, E., Ohana, J.-J., Saltiel, D., Guez, B., and Challet, D. (2024). Can ChatGPT compute trustworthy sentiment scores from bloomberg market wraps? arXiv preprint arXiv:2401.05447

    2024 arXiv

  31. [39]

    Levene, H. (1960). Robust tests for the equality of variances. In Contributions to Probability and Statistics , pages 278--292. Stanford University Press

    1960

  32. [40]

    Li, J. (2018). Asymptotic normality of interpoint distances for high-dimensional data with applications to the two-sample problem. Biometrika , 105(3):529--546

    2018

  33. [41]

    and Chen, S

    Li, J. and Chen, S. X. (2012). Two sample tests for high-dimensional covariance matrices. The Annals of Statistics , 40(2):908--940

    2012

  34. [42]

    and Qin, Y

    Li, W. and Qin, Y. (2014). Hypothesis testing for high-dimensional covariance matrices. Journal of Multivariate Analysis , 128:108--119

    2014

  35. [43]

    Liu, F., Xu, W., Lu, J., Zhang, G., Gretton, A., and Sutherland, D. J. (2020). Learning deep kernels for non-parametric two-sample tests. In International Conference on Machine Learning , pages 6316--6326. PMLR

    2020

  36. [44]

    and Oquab, M

    Lopez-Paz, D. and Oquab, M. (2016). Revisiting classifier two-sample tests. arXiv preprint arXiv:1610.06545

    2016 arXiv

  37. [45]

    Makigusa, N. (2024). Two-sample test based on maximum variance discrepancy. Communications in Statistics-Theory and Methods , 53(15):5421--5438

    2024

  38. [46]

    Mann, H. B. and Whitney, D. R. (1947). On a test of whether one of two random variables is stochastically larger than the other. The Annals of Mathematical Statistics , 18(1):50--60

    1947

  39. [47]

    Markowitz, H. (1952). Portfolio selection. The Journal of Finance , 7(1):77--91

    1952

  40. [48]

    Pan, W., Tian, Y., Wang, X., and Zhang, H. (2018). Ball divergence: nonparametric two sample test. Annals of Statistics , 46(3):1109

    2018

  41. [49]

    J., Poczos, B., Singh, A., and Wasserman, L

    Ramdas, A., Reddi, S. J., Poczos, B., Singh, A., and Wasserman, L. (2015). Adaptivity and computation-statistics tradeoffs for kernel and distance based high dimensional two sample testing. arXiv preprint arXiv:1508.00655

    2015 arXiv

  42. [50]

    Rosenbaum, P. R. (2005). An exact distribution-free test comparing two multivariate distributions based on adjacency. Journal of the Royal Statistical Society: Series B (Statistical Methodology) , 67(4):515--530

    2005

  43. [51]

    Schilling, M. F. (1986). Multivariate two-sample tests based on nearest neighbors. Journal of the American Statistical Association , 81(395):799--806

    1986

  44. [52]

    Schrab, A., Kim, I., Albert, M., Laurent, B., Guedj, B., and Gretton, A. (2023). MMD aggregated two-sample test. Journal of Machine Learning Research , 24(194):1--81

    2023

  45. [53]

    Scott, R. C. and Horvath, P. A. (1980). On the direction of preference for moments of higher order than the variance. Journal of Finance , 35(4):915--919

    1980

  46. [54]

    Shekhar, S., Kim, I., and Ramdas, A. (2022). A permutation-free kernel two-sample test. Advances in Neural Information Processing Systems , 35:18168--18180

    2022

  47. [55]

    and Chen, H

    Song, H. and Chen, H. (2023). Generalized kernel two-sample tests. Biometrika , 111(3):755--770

    2023

  48. [56]

    S., Yanagihara, H., and Kubokawa, T

    Srivastava, M. S., Yanagihara, H., and Kubokawa, T. (2014). Tests for covariance matrices in high dimension with less sample size. Journal of Multivariate Analysis , 130:289--309

    2014

  49. [57]

    Sz \'e kely, G. J. and Rizzo, M. L. (2013). Energy statistics: A class of statistics based on distances. Journal of Statistical Planning and Inference , 143(8):1249--1272

    2013

  50. [58]

    B., and Ma, T

    Wang, M., Cohen, S. B., and Ma, T. (2024). Modeling news interactions and influence for financial market prediction. arXiv preprint arXiv:2410.10614

    2024 arXiv

  51. [59]

    Welch, B. L. (1947). The generalization of ` S tudent's' problem when several different population variances are involved. Biometrika , 34(1-2):28--35

    1947

  52. [60]

    Xu, G., Lin, L., Wei, P., and Pan, W. (2016). An adaptive two-sample test for high-dimensional means. Biometrika , 103(3):609--624

    2016

  53. [61]

    and Zhang, X

    Yan, J. and Zhang, X. (2023). Kernel two-sample tests in high dimensions: interplay between moment discrepancy and dimension-and-sample orders. Biometrika , 110(2):411--430

    2023

  54. [62]

    and Wang, H

    Zhang, H. and Wang, H. (2021). A more powerful test of equality of high-dimensional two-sample means. Computational Statistics & Data Analysis , 164:107318

    2021

  55. [63]

    Zhang, J.-T., Guo, J., Zhou, B., and Cheng, M.-Y. (2020). A simple two-sample test in high dimensions based on L ^2 -norm. Journal of the American Statistical Association , 115(530):1011--1027

    2020

  56. [64]

    and Chen, H

    Zhou, D. and Chen, H. (2023). A new ranking scheme for modern data and its application to two-sample hypothesis testing. In The Thirty Sixth Annual Conference on Learning Theory , pages 3615--3668. PMLR

    2023

  57. [65]

    and Shao, X

    Zhu, C. and Shao, X. (2021). Interpoint distance based two sample tests in high dimension. Bernoulli , 27(2):1189--1211

    2021

  58. [66]

    and Chen, H

    Zhu, Y. and Chen, H. (2023). Robust graphs for graph-based methods. arXiv preprint arXiv:2307.15205

    2023

  59. [67]

    and Chen, H

    Zhu, Y. and Chen, H. (2024). Limiting distributions of graph-based test statistics on sparse and dense graphs. Bernoulli , 30(1):770--796

    2024

Pith tools

Reviewed August 11, 2026 · model on record in the stance chip above.