mlsanityData to 14 Oct 2026

LOTTERY: Learning from Reference-Only Samples in Two-Sample Testing under Size Asymmetry

arXiv 2606.08460 ↗First posted 7 Jun 2026stat.ML cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Data-adaptive two-sample testing assesses if two samples come from the same distribution, using a discrepancy learned from the data (e.g., via kernel-based feature representations). Such methods typically rely on data splitting to decouple learning from testing and control type I error. However, this paradigm is ill-suited to few-shot settings with severe sample-size imbalance: abundant reference samples are available, while only a handful of query samples arrive. In this paper, we show how this imbalance can be leveraged constructively. Using abundant reference data, we learn reference-dependent representations that summarize salient structure of the reference distribution and provide informative signals for detecting departures. We incorporate a collection of representation families that capture both global and local structure, and adaptively weight them using only reference samples via an uncertainty-guided principle. Theoretically, we establish permutation-based type I error control and show consistency of the aggregated test: as the sample sizes grow, the test power converges to one whenever the representation set contains at least one consistent representation. Empirically, our aggregation achieves strong performance across a range of benchmarks while retaining type I error control.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 27 of its 48 references that are in the map. First posted on arXiv 7 Jun 2026.

Builds on

27 of 48 references.

References · 27

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
  3. 2013Intriguing properties of neural networkscited by 5,155
  4. 2016Understanding deep learning requires rethinking generalizationcited by 1,674
  5. 2017Multi-Task Learning Using Uncertainty to Weigh Losses for Scene Geometry and Semanticscited by 1,358
  6. 2020A Unifying Review of Deep and Shallow Anomaly Detectioncited by 425
  7. 2016Revisiting Classifier Two-Sample Testscited by 268
  8. 2021SSD: A Unified Framework for Self-Supervised Outlier Detectioncited by 264
  9. 2018Failing Loudly: An Empirical Study of Methods for Detecting Dataset Shiftcited by 243
  10. 2017On the (Statistical) Detection of Adversarial Examplescited by 180
  11. 2020Learning Deep Kernels for Non-Parametric Two-Sample Testscited by 130
  12. 2020Explainable Deep One-Class Classificationcited by 127
15 more
  1. 2020DROCC: Deep Robust One-Class Classificationcited by 121
  2. 2016Generative Models and Model Criticism via Optimized Maximum Mean Discrepancycited by 100
  3. 2021MMD Aggregated Two-Sample Testcited by 75
  4. 2021Deep One-Class Classification via Interpolated Gaussian Descriptorcited by 67
  5. 2016Interpretable Distribution Features with Maximum Testing Powercited by 63
  6. 2020Maximum Mean Discrepancy Test is Aware of Adversarial Attackscited by 44
  7. 2016Classification accuracy as a proxy for two sample testingcited by 42
  8. 2023MMD-FUSE: Learning and Combining Kernels for Two-Sample Testing Without Data Splittingcited by 33
  9. 2021A Witness Two-Sample Testcited by 23
  10. 2024Detecting Machine-Generated Texts by Multi-Population Aware Optimization for Maximum Mean Discrepancycited by 20
  11. 2022CADet: Fully Self-Supervised Out-Of-Distribution Detection With Contrastive Learningcited by 11
  12. 2024A Unified Data Representation Learning for Non-parametric Two-sample Testingcited by 6
  13. 2025DUAL: Learning Diverse Kernels for Aggregated Two-sample and Independence Testingcited by 6
  14. 2025H2ST: Hierarchical Two-Sample Tests for Continual Out-of-Distribution Detectioncited by 4
  15. 2025Anchor-based Maximum Discrepancy for Relative Similarity Testingcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.