Kernel conditional tests from learning-theoretic bounds
Pierre-François Massiani, Christian Fiedler, Lukas Haverbeck, Friedrich Solowjow, Sebastian Trimpe
TL;DR
This work develops a general framework for hypothesis testing on conditional distributions that yields finite-sample, covariate-specific guarantees by converting learning-confidence bounds into statistical tests. It instantiates the framework with kernel ridge regression (KRR) to obtain time-uniform, vector-valued bounds that extend to infinite-dimensional outputs via uniform-block-diagonal kernels (UBD) and kernel mean embeddings. A key contribution is a principled link between estimation accuracy and conditional testing, enabling conditional two-sample tests for functionals of conditional distributions through representation maps and KMEs. To enhance practical applicability, the authors introduce bootstrapping schemes for testing thresholds and demonstrate the approach on process-monitoring and dynamical-system comparison tasks, showing localized power and robustness to online sampling. Overall, the paper provides a comprehensive theory-to-practice pipeline for conditional testing with strong guarantees and broad applicability in non-iid, online settings.
Abstract
We propose a framework for hypothesis testing on conditional probability distributions, which we then use to construct statistical tests of functionals of conditional distributions. These tests identify the inputs where the functionals differ with high probability, and include tests of conditional moments or two-sample tests. Our key idea is to transform confidence bounds of a learning method into a test of conditional expectations. We instantiate this principle for kernel ridge regression (KRR) with subgaussian noise. An intermediate data embedding then enables more general tests -- including conditional two-sample tests -- via kernel mean embeddings of distributions. To have guarantees in this setting, we generalize existing pointwise-in-time or time-uniform confidence bounds for KRR to previously-inaccessible yet essential cases such as infinite-dimensional outputs with non-trace-class kernels. These bounds also circumvent the need for independent data, allowing for instance online sampling. To make our tests readily applicable in practice, we introduce bootstrapping schemes leveraging the parametric form of testing thresholds identified in theory to avoid tuning inaccessible parameters. We illustrate the tests on examples, including one in process monitoring and comparison of dynamical systems. Overall, our results establish a comprehensive foundation for conditional testing on functionals, from theoretical guarantees to an algorithmic implementation, and advance the state of the art on confidence bounds for vector-valued least squares estimation.
