Pith. Sign in

RECORD

A general framework for the analysis of kernel-based tests

Statistics Theory · Submitted 31 Aug 2022

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim Therefore, our framework leads to a much simpler and clean analysis of kernel tests, only requiring mild regularity conditions.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID2209.00124 (version 1)
Pith IDXLN5GD52, Pith's permanent record of this paper and its review
CitationNicol\'as Rivera, Tamara Fern\'andez. "A general framework for the analysis of kernel-based tests." arXiv:2209.00124 (2022). https://pith.science/paper/XLN5GD52
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 4,966 input tokens.

What the abstract itself states, as probabilities: claims first 0.07 · states limitation 0.78 · human participants 0.03 · controlled comparison 0.03 · randomized assignment 0.01 · states quantitative result 0.05 · compares with prior results 0.89 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

Kernel-based tests provide a simple yet effective framework that use the theory of reproducing kernel Hilbert spaces to design non-parametric testing procedures. In this paper we propose new theoretical tools that can be used to study the asymptotic behaviour of kernel-based tests in several data scenarios, and in many different testing problems. Unlike current approaches, our methods avoid using lengthy $U$ and $V$ statistics expansions and limit theorems, that commonly appear in the literature, and works directly with random functionals on Hilbert spaces. Therefore, our framework leads to a much simpler and clean analysis of kernel tests, only requiring mild regularity conditions. Furthermore, we show that, in general, our analysis cannot be improved by proving that the regularity conditions required by our methods are both sufficient and necessary. To illustrate the effectiveness of our approach we present a new kernel-test for the conditional independence testing problem, as well as new analyses for already known kernel-based tests.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 Kernel-based tests provide a simple yet effective framework that use the theory of reproducing kernel Hilbert spaces to design non-parametric testing procedures. background 1.00 0.05 0.04 asserted 1.00
s1 In this paper we propose new theoretical tools that can be used to study the asymptotic behaviour of kernel-based tests in several data scenarios, and in many different testing problems. contribution 1.00 0.93 0.20 asserted 0.87
s2 Unlike current approaches, our methods avoid using lengthy $U$ and $V$ statistics expansions and limit theorems, that commonly appear in the literature, and works directly with random functionals on Hilbert spaces. method 0.72 0.84 0.12 asserted 1.00
s3 Therefore, our framework leads to a much simpler and clean analysis of kernel tests, only requiring mild regularity conditions. interpretation 0.55 0.87 0.36 asserted 1.00
s4 Furthermore, we show that, in general, our analysis cannot be improved by proving that the regularity conditions required by our methods are both sufficient and necessary. result 0.70 0.83 0.18 asserted 1.00
s5 To illustrate the effectiveness of our approach we present a new kernel-test for the conditional independence testing problem, as well as new analyses for already known kernel-based tests. contribution 0.98 0.94 0.10 asserted 1.00

What kind of paper the classifier reports this is: method or tool 0.74 · evidence from proof or derivation 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

Kernel-based tests provide a simple yet effective framework that use the theory of reproducing kernel Hilbert spaces to design non-parametric testing procedures. In this paper we propose new theoretical tools that can be used to study the asymptotic behaviour of kernel-based tests in several data scenarios, and in many different testing problems. Unlike current approaches, our methods avoid using lengthy $U$ and $V$ statistics expansions and limit theorems, that commonly appear in the literature, and works directly with random functionals on Hilbert spaces. Therefore, our framework leads to a much simpler and clean analysis of kernel tests, only requiring mild regularity conditions. Furthermore, we show that, in general, our analysis cannot be improved by proving that the regularity conditions required by our methods are both sufficient and necessary. To illustrate the effectiveness of our approach we present a new kernel-test for the conditional independence testing problem, as well as new analyses for already known kernel-based tests.

Human review
How the literature uses it

1 arXiv paper cite this in 1 sentence

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

What it cites · 2 sentences without a confident label

Builds on 1 paper
  • The third application is a novel test for conditional independent testing that kernelises the very recently proposed Weighted Generalised Covariance Measure [ref] which is a weighted generalisation of the introduced Generalised Covariance Measure [ref] .

    The Weighted Generalised Covariance Measure · Introduction · 0.95

Uses the method or tool of 1 paper
  • Our first experiment considers $d = 1$, and in such case we consider the weight function $ω(z)=sign(z)$ (as it was used in the experiments of [ref] ).

    The Weighted Generalised Covariance Measure · Experiments · 0.92

Compares with 1 paper
  • The above conditions are slightly stronger than the corresponding conditions of [ref] , but they allow us to avoid splitting the data as in [ref] (e.g. use half of the data to estimate $f$ and $g$, and the other half in the testing procedure).

    The Weighted Generalised Covariance Measure · A test based on the Kernelised GCM · 0.99

Cites as background 6 papers

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.