Large-scale kernel methods for independence testing

From MaRDI portal
Publication:1702289

DOI10.1007/S11222-016-9721-7zbMATH Open1384.62154arXiv1606.07892OpenAlexW2463154922MaRDI QIDQ1702289FDOQ1702289


Authors: Qinyi Zhang, S. Filippi, Arthur Gretton, Dino Sejdinovic Edit this on Wikidata


Publication date: 28 February 2018

Published in: Statistics and Computing (Search for Journal in Brave)

Abstract: Representations of probability measures in reproducing kernel Hilbert spaces provide a flexible framework for fully nonparametric hypothesis tests of independence, which can capture any type of departure from independence, including nonlinear associations and multivariate interactions. However, these approaches come with an at least quadratic computational cost in the number of observations, which can be prohibitive in many applications. Arguably, it is exactly in such large-scale datasets that capturing any type of dependence is of interest, so striking a favourable tradeoff between computational efficiency and test performance for kernel independence tests would have a direct impact on their applicability in practice. In this contribution, we provide an extensive study of the use of large-scale kernel approximations in the context of independence testing, contrasting block-based, Nystrom and random Fourier feature approaches. Through a variety of synthetic data experiments, it is demonstrated that our novel large scale methods give comparable performance with existing methods whilst using significantly less computation time and memory.


Full work available at URL: https://arxiv.org/abs/1606.07892




Recommendations




Cites Work


Cited In (17)

Uses Software





This page was built for publication: Large-scale kernel methods for independence testing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1702289)