Pith. sign in

REVIEW 4 major objections 4 minor 51 references

Permutation-Free High-Order Interaction Tests

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

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

Pith's one-line read The paper claims that kernel high-order interaction tests can be made permutation-free through V-statistics and cross-centring, with null statistics that follow a standard normal distribution.

desk verdict The permutation-free construction and the empirical work are genuinely useful, but the central N(0,1) claim for d>2 is asserted rather than proved, so the paper needs major theoretical revisions before acceptance. read the letter →

arxiv 2506.05963 v1 pith:HNDBM6AX submitted 2025-06-06 stat.ME stat.ML

Zhaolu Liu , Robert L. Peach , Mauricio Barahona This is my paper · ORCID
classification stat.MEstat.ML MSC 62G1062H1562G20
keywords permutation-freehypothesistestskernelmeanembeddingshigh-orderinteractionsjointindependenceLancasterinteractionStreitbergV-statisticscross-centring
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 introduces three permutation-free kernel tests—xdHSIC for joint independence, xLI for Lancaster (singleton) factorisations, and xSI for general two-block factorisations—that replace the usual 100–1000 permutation null with a single statistic claimed to converge to N(0,1) under the null. It argues that this removes the dominant computational bottleneck of kernel interaction tests while keeping the flexibility of reproducing kernel Hilbert space embeddings. The practical gain is that testing joint independence or complete factorisation of d variables scales as O(d $n^{2}$), with measured speedups of over 100-fold, making high-order interaction screening feasible where permutation schemes become infeasible. The central technical move is to split the sample in half and use only the off-diagonal cross-block kernel information, with a cross-centring that makes the statistic non-degenerate and self-normalizing.

What carries the argument

The load-bearing mechanism is cross-centring combined with V-statistics under data splitting. For 2n i.i.d. samples, the kernel matrix K is centred only across the two halves as K = C_u K C_l, where C_u and C_l subtract the mean of the upper and lower half respectively; this makes the cross-centred kernel asymptotically equivalent to the usual centred kernel while leaving the statistic with a non-degenerate limiting variance. The test statistics are quadratic forms 1^T (Hadamard product of cross-centred kernel blocks) 1 over the cross half-block, normalised by the empirical standard deviation of the per-row contributions. This self-normalised ratio is what converts the degenerate null of a V-statistic into a standard normal pivot, so a single computation replaces the permutation distribution.

What would settle it

Generate i.i.d. data under a d=4 joint-independence null, compute xdHSIC over 10,000 replications at n=200 and n=500, and compare the empirical distribution with N(0,1) using a Q-Q plot and a Kolmogorov-Smirnov test; if the tails are heavier or the variance is not 1, the consistency claim for $s_I^{2}$ is falsified. The analogous check can be run for xLI and xSI under a null subhypothesis such as P1234 = P12 P34.

Watch

Extended reading notes

Core claim

The central claim is that, for any d, joint independence and partial-factorisation hypotheses can be tested by V-statistics built from Hadamard products of cross-centred kernel matrices on two disjoint halves of the sample. With this sample split, each statistic takes the form $\sqrt$(n) times an unnormalised cross-block sum divided by an empirical standard deviation, and the paper claims this ratio converges to N(0,1) under the corresponding null: joint independence for xdHSIC, each singleton-factorisation subhypothesis for xLI, and each two-block partition for xSI. xSI vanishes if and only if the joint distribution factorises into any two blocks, and combining xLI with xSI covers all 2^(d-1)-1 bipartitions needed for the complete factorisation test. The same construction specialised to d=2 yields a simpler pairwise independence statistic that the paper reports to have higher power than the existing permutation-free xHSIC.

Load-bearing premise

The treatment assumes, without proof, that the empirical variance estimators $s_I^{2}$, $s_L^{2}$, and $s_S^{2}$ consistently estimate the asymptotic variance of the cross-block V-statistics for d>2, so that the normalised statistics actually converge to N(0,1).

Editorial extensions

If this is right

  • xdHSIC, xLI, and xSI each reject their subhypotheses by comparing a single statistic with N(0,1), so p-values become deterministic and the computation is p-fold faster than using p permutations.
  • All three tests run in O(d n^2), and the xLI+xSI strategy keeps complexity quadratic in n regardless of d, whereas the permutation-based Streitberg test scales combinatorially with d.
  • For d=2, the V-statistic and cross-centring formulation gives a pairwise independence statistic that is simpler and reported to be more powerful than the earlier permutation-free xHSIC.
  • In score-based causal discovery, xdHSIC recovers the correct DAG with fewer samples than permutation-based dHSIC, and in the XOR-based feature selection example only xSI+xLI selects the ground-truth feature set.
  • On S&P 500 daily returns, the method screens 2- to 5-way interactions within and across sectors, finding systematically higher within-sector high-order interactions, especially for Utilities and Energy.

Reading between the lines

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

  • An extension the paper leaves implicit is that the fixed N(0,1) null makes whole-family multiple-testing control over the exponential number of partitions straightforward: all subtests share one critical value, so composite rejection can be computed without generating a permutation null for each partition.
  • The data-splitting construction suggests a direct route to stationary time series and network data by replacing the two independent halves with two blocks separated by a gap; the paper notes permutation-based versions for such data exist but leaves the permutation-free version open.
  • Because the null pivot is a standard normal, formal power analysis could be derived analytically from the mean shift of the cross-block sum under contiguous alternatives; the paper does not provide such a power formula.
  • Combining cross-centring with low-rank kernel approximations such as random Fourier features or the Nystroem method should reduce the O(d n^2) cost to roughly O(d n m), which would make interaction screening feasible on very large feature sets.
Share X Bluesky LinkedIn Reddit HN

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 proposes three permutation-free kernel tests for high-order interactions: xdHSIC for joint independence, xLI for Lancaster factorisations, and xSI for Streitberg/complete factorisations. The statistics are formed by splitting the sample, cross-centring kernel matrices, and using V-statistic-type bilinear forms; the authors claim that each normalised statistic has a standard normal null distribution, so a single computation replaces p permutations. The paper reports O(dn^2) complexity, presents synthetic and real-data experiments (causal discovery, feature selection, stock returns), and provides code.

Significance. If the normality claim were established, the paper would make a useful contribution: it would extend permutation-free testing beyond pairwise independence to d>2, make high-order interaction testing practical in combinatorial searches, and the d=2 V-statistic reformulation xHSICV is a clean simplification. The empirical evaluation is broad, and public code is a strength. However, the central theoretical claim is not proved for d>2, and the variance estimators are incompletely specified; until that is fixed, the methodological contribution is not established.

major comments (4)
  1. [Section 3.1, Definition 3.1 and Hypothesis 3.2] The central claim that xdHSIC is asymptotically standard normal under H0 for d>2 is asserted, not proved. The citation to Shekhar et al. (2023) after Hypothesis 3.2 covers the pairwise cross U-statistic, whereas xdHSIC is a d-dimensional cross-block V-statistic with a different variance estimator s_I^2. No theorem states the limiting distribution for d>2, and Appendix A.1 only verifies the O(dn^2) complexity; it does not establish consistency of s_I^2 or asymptotic normality. Since the permutation-free property is exactly this null distribution, the missing derivation is load-bearing.
  2. [Definitions 3.7 and 3.10] The displayed definitions of s_L^2 and s_S^2 contain unreadable placeholder tokens rather than complete expressions, so the normalised statistics xLI and xSI cannot be checked from the manuscript. No consistency proof for either variance estimator is provided; the remarks in Sections 3.2.1 and 3.2.2 only assert the N(0,1) null. This must be repaired and accompanied by a proof.
  3. [Lemma 3.5 and Section 3.2] Lemma 3.5 establishes asymptotic equivalence of a single cross-centred kernel to the original kernel. The Lancaster and Streitberg statistics, however, are built from Hadamard products of separately cross-centred kernels, e.g. \overline{K^m} \odot \bigodot_{i\ne m}\overline{K^i} in Definition 3.7. Equivalence of the individual factors does not imply equivalence of their Hadamard product, and no argument reduces the null distribution of such products to the pairwise xHSIC framework. Appendix A.3 and A.4 merely assert that the products can be viewed as single kernels; this addresses complexity, not distributional convergence.
  4. [Propositions 3.8, 3.11, and Table 1] These statements conflict. Proposition 3.8 claims xLI for all H_pi_L is O(dn^2), while Table 1 reports O(d^2 n^2); Proposition 3.11 claims xSI is O(dn^2), while Table 1 reports O(2^d d n^2) for xSI+xLI. Since xLI runs d singleton subtests and xSI covers the non-singleton bipartitions, the all-subtests complexities in the table are the relevant ones, and the propositions should be corrected to state per-subtest complexity.
minor comments (4)
  1. [Definitions 3.1, 3.7, 3.10] The normalised statistics are written with a denominator s_I, s_L, or s_S even though the displayed objects are s_I^2, s_L^2, s_S^2; please clarify that the denominator is the square root of the displayed variance estimator.
  2. [Appendix B] The displayed implications use corrupted arrow tokens (e.g., '/Leftr⫯g⊸tl⫯ne⇒') and need to be typeset correctly.
  3. [Section 5.1] The sentence 'xSI+xLI can be computed in less that 1 second' contains a typo; it should read 'less than'.
  4. [Appendix C] The claim that xHSICV has 'higher power' than xHSIC is based on a single simulation (Fig. 9); please qualify this as an empirical observation for the considered setting.

Circularity Check

0 steps flagged · score 2.0 of 10

No significant circularity: the tests do not fit parameters to their own predictions, and the heavy reliance on prior work is external or mathematical, not a re-labeling of the target result.

full rationale

The paper's central claim is that xdHSIC, xLI, and xSI converge to a standard normal under the respective null hypotheses, enabling a permutation-free test. This claim is not obtained by fitting a parameter to a dataset and then predicting a closely related quantity; the statistics are direct functions of the data and the kernels. The construction is anchored to an external result: 'The construction of xdHSIC ensures it follows N(0, 1) under the null (Shekhar et al., 2023).' The authors' own prior work (Liu et al., 2023b) is cited for the Lancaster and Streitberg vanishing properties and for the partition-lattice facts that justify the composite hypotheses. These are published mathematical results, not fitted values, and they do not by themselves assert the d>2 normality of the new statistics, so they are not used as a circular substitute for the derivation. The main weakness is that the d>2 normality is asserted rather than proved: the text says 'all with a fixed null distribution (standardised to N(0, 1))' in the Remark after Definition 3.7, and Appendix A proves only the equivalence of the cross-centred kernel and the O(dn^2) complexity, not the distributional convergence for the Hadamard-product statistics. This is a missing proof, which is a correctness and rigor concern, not a circularity: the paper does not define the statistic in terms of the claimed normal limit, nor does it rename a fitted input as a prediction. The garbled placeholders in the displayed formulas for s_L^2 and s_S^2 are manuscript defects and do not constitute a circular step. Overall, no load-bearing step reduces by construction to its own inputs, so the paper is not circular beyond a minor reliance on self-citation for background mathematical facts.

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

The central claim rests on standard RKHS embeddings, the i.i.d. sampling assumption, the unproven kernel equivalence lemma, and the validity of the composite-subtest rejection rule. No parameters are fitted to data; the median heuristic for bandwidth is standard and not part of the derivation.

assumptions (4)
  • domain assumption Samples are i.i.d.
    The data-splitting construction and null distribution rely on i.i.d. samples; the authors note this limitation in Section 6.
  • standard math Kernels are characteristic so that kernel mean embeddings are injective.
    Section 2.2 invokes characteristic kernels (Gretton et al. 2007, Muandet et al. 2017) to ensure that a zero norm of the signed measure implies the measure is zero.
  • ad hoc to paper Cross-centred kernel is asymptotically equivalent to the original kernel (Lemma 3.5).
    Lemma 3.5 is stated without a complete proof; Appendix A.2 gives a sketch relying on both half-means converging to the same embedding mean. This equivalence underpins the xLI and xSI statistics.
  • domain assumption Rejecting a composite factorisation null if all subtests reject at level alpha is valid and less conservative than Bonferroni.
    Section 3.2.1 and Appendix B cite Rubenstein et al. (2016) for this multiple testing claim; the paper does not prove it in this context.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Permutation-Free High-Order Interaction Tests." pith.science (2026). https://pith.science/paper/HNDBM6AX

@misc{pith2026250605963,
  author       = {Pith},
  title        = {Pith review of: Permutation-Free High-Order Interaction Tests},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/HNDBM6AX}},
  note         = {Machine review of arXiv:2506.05963}
}
abstract

Kernel-based hypothesis tests offer a flexible, non-parametric tool to detect high-order interactions in multivariate data, beyond pairwise relationships. Yet the scalability of such tests is limited by the computationally demanding permutation schemes used to generate null approximations. Here we introduce a family of permutation-free high-order tests for joint independence and partial factorisations of $d$ variables. Our tests eliminate the need for permutation-based approximations by leveraging V-statistics and a novel cross-centring technique to yield test statistics with a standard normal limiting distribution under the null. We present implementations of the tests and showcase their efficacy and scalability through synthetic datasets. We also show applications inspired by causal discovery and feature selection, which highlight both the importance of high-order interactions in data and the need for efficient computational methods.

Figures

Figures reproduced from arXiv: 2506.05963 by the authors.

Figure 1
Figure 1. Generalisations of pairwise dependence to high-order interactions. All three measures of statistical interaction (joint independence, Lancaster, Streitberg) are the same for d = 2. Joint independence captures less information for d ≥ 3. Only Streitberg interaction considers all factorisations for d ≥ 4. If P123 can be factorised into any of P1P23,P2P13,P3P12 or P1P2P3, then ∆3 LP = 0 (see Appendix B). Lancaster (196… view at source ↗
Figure 2
Figure 2. Joint independence test. (a)-(c) Sampling from a d = 4 variable MVG (covariance matrix, inset of (a)), we compare dHSIC (with p = 100 permutations) and xdHSIC: (a) statisti￾cal power as a function of the number of samples, n; (b) trade-off between power and computational time (circle diameter propor￾tional to sample size n); (c) CPU time as n increases. (d) CPU time for MVGs of the same form as in (a) but with incre… view at source ↗
Figure 3
Figure 3. a, we consider data from a MVG with d = 5 vari￾ables and covariance matrix such that P1P2345 (see inset). As expected, xdHSIC fails to detect this partial (singleton) factorisation, which is correctly detected by both xLI and xSI+xLI. Figure 3b shows that, when analyse data from a MVG that is factorisable as P12P345 (no singletons), only xSI+xLI succeeds in detecting this interaction. a b c d [PITH_FULL_IMAGE:figur… view at source ↗
Figures from the paper (9 more)
Figure 5
Figure 5. Figure 5: V-structure detection. Type-II errors of xLI, LI and KCI for detecting the conditional dependence as the noise dimen￾sions vary in dataset (a) A and (b) B from Sejdinovic et al. (2013a). DAG Causal Structural Learning An alternative route for causal learning is provide…
Figure 6
Figure 6. Figure 6: DAG causal discovery. (a) Accuracies of the correct DAG being detected among all fully connected DAGs of four nodes and (b) the distributions of the SHD of the detected DAG using xdHSIC and dHSIC out of 100 experiments. 5.3. Application to Feature Selection Feature sel…
Figure 7
Figure 7. Figure 7: Stock interactions in S&P500. Utilities and Energy show high 3-, 4– and 5-way interactions, likely due to regulation-driven redundancy. In contrast, Information Technology, Health Care, and Consumer Discretionary exhibit lower high-order interactions, suggesting strong…
Figure 8
Figure 8. Figure 8: Structural causal models with diverse nonlinear forms and kernel functions. We constructed three V-structures using (a) sinc (b) log, and (c) polynomial nonlinear forms (see inset). C. Definition of the xHSIC pairwise test using V-statistics We formulate the correspond…
Figure 9
Figure 9. Figure 9: Experiments of pairwise independence tests: xHSICV follows a standard normal distribution with two independent t￾distributions; controls the type-I error rate with the same data from t-distributions, and outperforms both HSIC (Gretton et al., 2007) and xHSIC (Shekhar e…
Figure 10
Figure 10. Figure 10: Null distributions of permutation-free test statistics. All three test statistics introduced in this paper follow a standard normal distribution N (0, 1) under their respective nulls [PITH_FULL_IMAGE:figures/full_fig_p015_10.png]
Figure 11
Figure 11. Figure 11: Controlled type-I error of permutation-free test statistics. All three test statistics introduced in this paper have a valid level of type-I error for α = 0.05, indicated by the dashed line. E. Further details of datasets used in Section 5 The code to implement the pe…
Figure 12
Figure 12. Figure 12: Fully connected DAG of 4 nodes. We use DAG 1 as the ground truth causal structure to simulate the data. In this example we simulate the data from DAG 1 and compare all the possible fully connected DAGs shown in [PITH_FULL_IMAGE:figures/full_fig_p016_12.png]
Figure 13
Figure 13. Figure 13: High-order interactions percentages in between stocks in S&P500. Heatmap of the percentages shown in [PITH_FULL_IMAGE:figures/full_fig_p017_13.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

51 extracted references · 44 canonical work pages

  1. [1]

    Ali, M. M. and Giaccotto, C. The identical distribution hypothesis for stock market prices—location-and scale-shift alternatives. Journal of the American Statistical Association, 77 0 (377): 0 19--28, 1982

    work page 1982

  2. [2]

    L., Petri, G., and Expert, P

    Arnaudon, A., Peach, R. L., Petri, G., and Expert, P. Connecting hodge and sakaguchi-kuramoto through a mathematical framework for coupled oscillators on simplicial complexes. Communications Physics, 5 0 (1): 0 211, 2022

    work page 2022

  3. [3]

    Networks beyond pairwise interactions: structure and dynamics

    Battiston, F., Cencetti, G., Iacopini, I., Latora, V., Lucas, M., Patania, A., Young, J.-G., and Petri, G. Networks beyond pairwise interactions: structure and dynamics. Physics Reports, 874: 0 1--92, 2020

    work page 2020

  4. [4]

    The physics of higher-order interactions in complex systems

    Battiston, F., Amico, E., Barrat, A., Bianconi, G., Ferraz de Arruda, G., Franceschiello, B., Iacopini, I., K \'e fi, S., Latora, V., Moreno, Y., et al. The physics of higher-order interactions in complex systems. Nature Physics, 17 0 (10): 0 1093--1098, 2021

    work page 2021

  5. [5]

    R., Gleich, D

    Benson, A. R., Gleich, D. F., and Leskovec, J. Higher-order organization of complex networks. Science, 353 0 (6295): 0 163--166, 2016

    work page 2016

  6. [6]

    A., and Schaub, M

    Bick, C., Gross, E., Harrington, H. A., and Schaub, M. T. What are higher-order networks? SIAM Review, 65 0 (3): 0 686--731, 2023

    work page 2023

  7. [7]

    J., Arbel, M., and Gretton, A

    Bi \'n kowski, M., Sutherland, D. J., Arbel, M., and Gretton, A. Demystifying mmd gans. arXiv preprint arXiv:1801.01401, 2018

    arXiv 2018

  8. [8]

    Dependence and dependence structures: estimation and visualization using the unifying concept of distance multivariance

    B \"o ttcher, B. Dependence and dependence structures: estimation and visualization using the unifying concept of distance multivariance. Open Statistics, 1 0 (1): 0 1--48, 2020

    work page 2020

Show all 51 references
  1. [9]

    and Zhang, X

    Chakraborty, S. and Zhang, X. Distance metrics for measuring joint dependence with application to causal inference. Journal of the American Statistical Association, 2019

    2019

  2. [10]

    and Gretton, A

    Chwialkowski, K. and Gretton, A. A kernel independence test for random processes. In International Conference on Machine Learning, pp.\ 1422--1430. PMLR, 2014

    2014

  3. [11]

    Unifying feature-based explanations with functional anova and cooperative game theory

    Fumagalli, F., Muschalik, M., H \"u llermeier, E., Hammer, B., and Herbinger, J. Unifying feature-based explanations with functional anova and cooperative game theory. arXiv preprint arXiv:2412.17152, 2024

    2024 arXiv

  4. [12]

    A kernel statistical test of independence

    Gretton, A., Fukumizu, K., Teo, C., Song, L., Sch \"o lkopf, B., and Smola, A. A kernel statistical test of independence. Advances in neural information processing systems, 20, 2007

    2007

  5. [13]

    J., and Allesina, S

    Grilli, J., Barab \'a s, G., Michalska-Smith, M. J., and Allesina, S. Higher-order interactions stabilize dynamics in competitive network models. Nature, 548 0 (7666): 0 210--213, 2017

    2017

  6. [14]

    and Oja, E

    Hyv \"a rinen, A. and Oja, E. Independent component analysis: algorithms and applications. Neural networks, 13 0 (4-5): 0 411--430, 2000

    2000

  7. [15]

    and Ramdas, A

    Kim, I. and Ramdas, A. Dimension-agnostic inference using cross u-statistics. Bernoulli, 30 0 (1): 0 683--711, 2024

    2024

  8. [16]

    The Chi-Squared Distribution

    Lancaster, H. The Chi-Squared Distribution. Wiley, 1969

    1969

  9. [17]

    u gelgen, J., Park, J., Sch \

    Laumann, F., Von K \"u gelgen, J., Park, J., Sch \"o lkopf, B., and Barahona, M. Kernel-based independence tests for causal structure learning on functional data. Entropy, 25 0 (12): 0 1597, 2023

    2023

  10. [18]

    L., Laumann, F., Vallejo Mengod, S., and Barahona, M

    Liu, Z., Peach, R. L., Laumann, F., Vallejo Mengod, S., and Barahona, M. Kernel-based joint independence tests for multivariate stationary and non-stationary time series. Royal Society Open Science, 10 0 (11): 0 230857, 2023 a

    2023

  11. [19]

    L., Mediano, P

    Liu, Z., Peach, R. L., Mediano, P. A., and Barahona, M. Interaction measures, partition lattices and kernel tests for high-order interactions. Advances in Neural Processing Systems, 36, 2023 b

    2023

  12. [20]

    Liu, Z., Barahona, M., and Peach, R. L. Information-theoretic measures on lattices for high-order interactions. AISTATS - Proceedings of The 28th International Conference on Artificial Intelligence and Statistics, PMLR, 2025

    2025

  13. [21]

    Learning transferable features with deep adaptation networks

    Long, M., Cao, Y., Wang, J., and Jordan, M. Learning transferable features with deep adaptation networks. In International conference on machine learning, pp.\ 97--105. PMLR, 2015

    2015

  14. [22]

    I., and Yosef, N

    Lopez, R., Regier, J., Jordan, M. I., and Yosef, N. Information constraints on auto-encoding variational bayes. Advances in neural information processing systems, 31, 2018

    2018

  15. [23]

    E., Peach, R., Mallas, E.-J., Rhodes, E., Laumann, F., Boyden, E

    Luff, C. E., Peach, R., Mallas, E.-J., Rhodes, E., Laumann, F., Boyden, E. S., Sharp, D. J., Barahona, M., and Grossman, N. The neuron mixer and its impact on human brain dynamics. Cell Reports, 43 0 (6), 2024

    2024

  16. [24]

    Lundberg, S. M. and Lee, S.-I. A unified approach to interpreting model predictions. Advances in Neural Information Processing Systems, 30, 2017

    2017

  17. [25]

    Kernel mean embedding of distributions: A review and beyond

    Muandet, K., Fukumizu, K., Sriperumbudur, B., and Sch\" o lkopf, B. Kernel mean embedding of distributions: A review and beyond. Found. Trends Mach. Learn., 10 0 (1–2): 0 1–141, June 2017. ISSN 1935-8237. doi:10.1561/2200000060. URL https://doi.org/10.1561/2200000060

    2017 doi

  18. [26]

    shapiq: Shapley interactions for machine learning

    Muschalik, M., Baniecki, H., Fumagalli, F., Kolpaczki, P., Hammer, B., and H \"u llermeier, E. shapiq: Shapley interactions for machine learning. Advances in Neural Information Processing Systems, 37: 0 130324--130357, 2024

    2024

  19. [27]

    Scikit-learn: Machine learning in P ython

    Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Prettenhofer, P., Weiss, R., Dubourg, V., Vanderplas, J., Passos, A., Cournapeau, D., Brucher, M., Perrot, M., and Duchesnay, E. Scikit-learn: Machine learning in P ython. Journal of ...

    2011

  20. [28]

    M., Janzing, D., and Sch\" o lkopf, B

    Peters, J., Mooij, J. M., Janzing, D., and Sch\" o lkopf, B. Causal discovery with continuous additive noise models. J. Mach. Learn. Res., 15 0 (1): 0 2009–2053, January 2014. ISSN 1532-4435

    2009

  21. [29]

    u hlmann, P., Sch \

    Pfister, N., B \"u hlmann, P., Sch \"o lkopf, B., and Peters, J. Kernel-based tests for joint independence. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 80 0 (1): 0 5--31, 2018

    2018

  22. [30]

    Copula-based kernel dependency measures

    P\' o czos, B., Ghahramani, Z., and Schneider, J. Copula-based kernel dependency measures. In Proceedings of the 29th International Coference on International Conference on Machine Learning, ICML'12, pp.\ 1635–1642, Madison, WI, USA, 2012. Omnipress. ISBN 9781450312851

    2012

  23. [31]

    Consistency of permutation tests of independence using distance covariance, hsic and dhsic

    Rindt, D., Sejdinovic, D., and Steinsaltz, D. Consistency of permutation tests of independence using distance covariance, hsic and dhsic. Stat, 10 0 (1): 0 e364, 2021

    2021

  24. [32]

    E., Mediano, P

    Rosas, F. E., Mediano, P. A., Rassouli, B., and Barrett, A. B. An operational information decomposition via synergistic disclosure. Journal of Physics A: Mathematical and Theoretical, 53 0 (48): 0 485001, 2020

    2020

  25. [33]

    E., Mediano, P

    Rosas, F. E., Mediano, P. A., Luppi, A. I., Varley, T. F., Lizier, J. T., Stramaglia, S., Jensen, H. J., and Marinazzo, D. Disentangling high-order mechanisms and high-order behaviours in complex systems. Nature Physics, 18 0 (5): 0 476--477, 2022

    2022

  26. [34]

    E., Gutknecht, A., Mediano, P

    Rosas, F. E., Gutknecht, A., Mediano, P. A., and Gastpar, M. Characterising high-order interdependence via entropic conjugation. arXiv preprint arXiv:2410.10485, 2024

    2024 arXiv

  27. [35]

    K., Chwialkowski, K

    Rubenstein, P. K., Chwialkowski, K. P., and Gretton, A. A kernel test for three-variable interactions with random processes. arXiv preprint arXiv:1603.00929, 2016

    2016 arXiv

  28. [36]

    Higher-order organization of multivariate time series

    Santoro, A., Battiston, F., Petri, G., and Amico, E. Higher-order organization of multivariate time series. Nature Physics, 19 0 (2): 0 221--229, 2023

    2023

  29. [37]

    Higher-order connectomics of human brain function reveals local topological signatures of task decoding, individual identification, and behavior

    Santoro, A., Battiston, F., Lucas, M., Petri, G., and Amico, E. Higher-order connectomics of human brain function reveals local topological signatures of task decoding, individual identification, and behavior. Nature Communications, 15 0 (1): 0 10244, 2024

    2024

  30. [38]

    T., Benson, A

    Schaub, M. T., Benson, A. R., Horn, P., Lippner, G., and Jadbabaie, A. Random walks on simplicial complexes and the normalized hodge 1-laplacian. SIAM Review, 62 0 (2): 0 353--391, 2020

    2020

  31. [39]

    J., Bialek, W., et al

    Schneidman, E., Still, S., Berry, M. J., Bialek, W., et al. Network information and connected correlations. Physical review letters, 91 0 (23): 0 238701, 2003

    2003

  32. [40]

    A kernel test for three-variable interactions

    Sejdinovic, D., Gretton, A., and Bergsma, W. A kernel test for three-variable interactions. Advances in Neural Information Processing Systems, 26, 2013 a

    2013

  33. [41]

    Equivalence of distance-based and rkhs-based statistics in hypothesis testing

    Sejdinovic, D., Sriperumbudur, B., Gretton, A., and Fukumizu, K. Equivalence of distance-based and rkhs-based statistics in hypothesis testing. The annals of statistics, pp.\ 2263--2291, 2013 b

    2013

  34. [42]

    A permutation-free kernel two-sample test

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

    2022

  35. [43]

    A permutation-free kernel independence test

    Shekhar, S., Kim, I., and Ramdas, A. A permutation-free kernel independence test. Journal of Machine Learning Research, 24 0 (369): 0 1--68, 2023

    2023

  36. [44]

    Sloane, N. J. et al. The on-line encyclopedia of integer sequences, sequence a000296. Published electronically at https://oeis. org, 2018

    2018

  37. [45]

    Feature selection via dependence maximization

    Song, L., Smola, A., Gretton, A., Bedo, J., and Borgwardt, K. Feature selection via dependence maximization. Journal of Machine Learning Research, 13 0 (5), 2012

    2012

  38. [46]

    Lancaster interactions revisited

    Streitberg, B. Lancaster interactions revisited. The Annals of Statistics, pp.\ 1878--1885, 1990

    1990

  39. [47]

    The low-rank hypothesis of complex systems

    Thibeault, V., Allard, A., and Desrosiers, P. The low-rank hypothesis of complex systems. Nature Physics, 20 0 (2): 0 294--302, 2024

    2024

  40. [48]

    Young, J.-G., Petri, G., and Peixoto, T. P. Hypergraph reconstruction from network data. Communications Physics, 4 0 (1): 0 1--11, 2021

    2021

  41. [49]

    Kernel-based conditional independence test and application in causal discovery

    Zhang, K., Peters, J., Janzing, D., and Sch\" o lkopf, B. Kernel-based conditional independence test and application in causal discovery. In Proceedings of the Twenty-Seventh Conference on Uncertainty in Artificial Intelligence, UAI'11, pp.\ 804–813, Arlington, Virginia, USA, ...

    2011

  42. [50]

    Large-scale kernel methods for independence testing

    Zhang, Q., Filippi, S., Gretton, A., and Sejdinovic, D. Large-scale kernel methods for independence testing. Statistics and Computing, 28: 0 113--130, 2018

    2018

  43. [51]

    write newline

    " write newline "" before.all 'output.state := FUNCTION n.dashify 't := "" t empty not t #1 #1 substring "-" = t #1 #2 substring "--" = not "--" * t #2 global.max substring 't := t #1 #1 substring "-" = "-" * t #2 global.max substring 't := while if t #1 #1 substring * t #2 gl...

Pith tools

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