mlsanityData to 7 Oct 2026

Variable Selection for Kernel Two-Sample Tests

arXiv 2302.07415 ↗First posted 15 Feb 2023stat.ML stat.APcited by 7

Not on the map. Why?

Abstract (arXiv)

We consider the variable selection problem for two-sample tests, aiming to select the most informative variables to determine whether two collections of samples follow the same distribution. To address this, we propose a novel framework based on the kernel maximum mean discrepancy (MMD). Our approach seeks a subset of variables with a pre-specified size that maximizes the variance-regularized kernel MMD statistic. We focus on three commonly used types of kernels: linear, quadratic, and Gaussian. From a computational perspective, we derive mixed-integer programming formulations and propose exact and approximation algorithms with performance guarantees to solve these formulations. From a statistical viewpoint, we derive the rate of testing power of our framework under appropriate conditions. These results show that the sample size requirements for the three kernels depend crucially on the number of selected variables, rather than the data dimension. Experimental results on synthetic and real datasets demonstrate the superior performance of our method, compared to other variable selection frameworks, particularly in high-dimensional settings.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 29 of its 85 references that are in the map. First posted on arXiv 15 Feb 2023.

Builds on

29 of 85 references.

References · 29

  1. 2021Convex optimizationcited by 2,479
  2. 2016Kernel Mean Embedding of Distributions: A Review and Beyondcited by 360
  3. 2016Distributionally Robust Stochastic Optimization with Wasserstein Distancecited by 182
  4. 2020Learning Deep Kernels for Non-Parametric Two-Sample Testscited by 129
  5. 2016Generative Models and Model Criticism via Optimized Maximum Mean Discrepancycited by 99
  6. 2021MMD Aggregated Two-Sample Testcited by 74
  7. 2016Interpretable Distribution Features with Maximum Testing Powercited by 63
  8. 2015Fast Two-Sample Testing with Analytic Representations of Probability Measurescited by 53
  9. 2022Efficient Aggregated Kernel Tests using Incomplete U-statisticscited by 27
  10. 2019Two-sample Testing Using Deep Learningcited by 26
  11. 2019Classification Logit Two-sample Testing by Neural Networkscited by 25
  12. 2021A Witness Two-Sample Testcited by 20
17 more
  1. 2022AutoML Two-Sample Testcited by 19
  2. 2017Sparse Classification: a scalable discrete optimization perspectivecited by 18
  3. 2020Two-sample Test using Projected Wasserstein Distancecited by 17
  4. 2021Grouped Variable Selection with Discrete Optimization: Computational and Statistical Perspectivescited by 12
  5. 2020Solving Large-Scale Sparse PCA to Certifiable (Near) Optimalitycited by 11
  6. 2015NP-Hardness and Inapproximability of Sparse PCAcited by 8
  7. 2018Using L1-relaxation and integer programming to obtain dual bounds for sparse PCAcited by 8
  8. 2020Exact and Approximation Algorithms for Sparse PCAcited by 8
  9. 2020Solving sparse principal component analysis with global supportcited by 8
  10. 2021Kernel Two-Sample Tests for Manifold Datacited by 7
  11. 2015Principal Differences Analysis: Interpretable Characterization of Differences between Distributionscited by 6
  12. 2021Beyond Symmetry: Best Submatrix Selection for the Sparse Truncated SVDcited by 6
  13. 2022Kernel Robust Hypothesis Testingcited by 6
  14. 2022A Manifold Two-Sample Test Study: Integral Probability Metric with Neural Networkscited by 5
  15. 2022On the Exactness of Dantzig-Wolfe Relaxation for Rank Constrained Optimization Problemscited by 3
  16. 2020Best Principal Submatrix Selection for the Maximum Entropy Sampling Problem: Scalable Algorithms and Performance Guaranteescited by 2
  17. 2022D-optimal Data Fusion: Exact and Approximation Algorithmscited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 3; 2025: 1; 2026: 2.

7 papers.