New framework compares credal sets for hypothesis testing with epistemic uncertainty.
problem Comparing distributions with partial ignorance and epistemic uncertainty.
method Credal two-sample testing framework for convex sets of probability measures.
result Direct integration of epistemic uncertainty in hypothesis testing.
The paper analyzes a neural network two-sample test using kernel analysis.
problem Determining if two datasets come from the same distribution.
method Time-analysis on a neural tangent kernel (NTK) two-sample test, extending to realistic neural network dynamics.
result Training times needed to detect deviations are well-separated in null and alternative hypothesis scenarios.
Kernel method tests if two sets of data are from the same distribution.
problem Two-sample hypothesis testing for high dimensional data with small samples.
method One-class set classification using Set Kernel and one-class SVM.
result The method achieves zero type-I and type-II error on all cancer gene expression data sets.
hyppo simplifies multivariate hypothesis testing in Python.
problem Inconsistent multivariate hypothesis testing interfaces in Python.
method Unified library for multivariate testing procedures.
result Easy-to-use and flexible for future extensions.
Improves two-sample hypothesis testing using kernel divergences and scoring rules.
problem Two-sample hypothesis testing in machine learning.
method Proposes Kernel Scoring Rules and Divergences, including the Maximum Mean Discrepancy.
result Kernel Score provides more information about embedded distributions than Maximum Mean Discrepancy.
Efficiently tests two distributions with few label queries.
problem Two-sample test with limited label information.
method Three-stage framework: classifier training, bimodal query, FR test.
result Significantly reduces Type II error compared to uniform querying.
A test for comparing large random graphs based on network statistics.
problem Comparing friendship networks on Facebook and LinkedIn.
method General principle for two-sample hypothesis testing based on concentration of network statistics.
result A consistent two-sample test that is minimax optimal for certain network statistics.
Study evaluates ML methods for two-sample testing with right-censored data.
problem Evaluating ML methods for two-sample testing with right-censored data.
method Developed and compared several ML-based methods with classical tests.
result Proposed methods outperform classical tests in terms of statistical power.
Optimal tests for goodness of fit and two-sample problems using MMD and KSD.
problem Asymptotically optimal tests for goodness of fit and two-sample problems.
method Maximum Mean Discrepancy (MMD) and Kernel Stein Discrepancy (KSD) based tests.
result Optimal tests achieve the maximum exponential decay rate under specific conditions.
A new classification method using hypothesis testing.
problem Statistical significance in classification problems.
method Formulate classification as a two-sample testing problem; calculate distances and perform tests.
result Outperforms state-of-the-art classifiers and controls false discovery rate.
Sequential tests for two-sample and independence testing using betting strategies.
problem Testing sequential data for two-sample and independence without kernel selection issues.
method Prediction-based betting strategies that adaptively determine distribution and joint distribution.
result Prediction-based tests outperform kernel-based approaches in high-dimensional or structured data settings.
Kernel tests for set-valued data improve hypothesis testing accuracy.
problem Testing distributions of sets with varying sizes, noise, and nuisance variability.
method Interpreting sets as samples from latent distributions and using kernel methods for testing.
result Kernel tests outperform traditional methods in synthetic and real-world experiments.
A test for comparing function samples using MMD.
problem Testing if two functional data samples come from the same distribution.
method Maximum Mean Discrepancy (MMD) for functional data, with theoretical scaling analysis.
result The proposed test is effective and robust to functional reconstructions.
A family of maximum mean discrepancy (MMD) kernel two-sample tests is introduced. Members of the test family are called Block-tests or B-tests, since the test statistic is an average over MMDs computed on subsets of the samples. The choice of block size allows control over the tradeoff between test power and computatio…
New method connects distance and kernel tests for better data structure.
problem Connecting distance and kernel methods for hypothesis testing.
method Proposes a new bijective transformation between metrics and kernels.
result Distance methods can be exactly the same as kernel methods for sample statistics and p-value.
A graph-based method for two-sample testing across connected nodes.
problem Identifying nodes where two probability distributions differ significantly.
method Collaborative non-parametric two-sample testing (CTST) framework.
result CTST outperforms independent node tests by leveraging graph structure.
Deep neural nets optimize kernel parameters for non-parametric two-sample tests.
problem Determining if two samples come from the same distribution.
method Deep kernels trained to maximize test power, adapting to distribution smoothness and shape.
result Deep kernels outperform simpler kernels in high dimensions and complex data.
Develops hypothesis tests for conditional distributions using learning-theoretic bounds.
problem Testing differences in conditional distributions and functionals.
method Transforming learning-theoretic bounds into hypothesis tests for conditional expectations.
result Establishes comprehensive foundation for conditional testing, including theoretical guarantees and practical implementations.
New kernel tests detect differences between distributions exponentially quickly.
problem Characterize the asymptotic performance of kernel two-sample tests.
method Established exponentially consistent kernel two-sample tests for unknown distributions.
result Exponential decay rate of type-II error probability is optimal and independent of kernels.
Optimal tests for nonparametric one- and two-sample testing are derived using MMD and KSD.
problem Developing optimal tests for nonparametric one- and two-sample testing.
method Using Sanov's theorem and Maximum Mean Discrepancy (MMD), the optimal error exponents are derived for one-sample tests. For two-sample tests, the quadratic-time Kernel Stein Discrepancy (KSD) is shown to achieve the optimal type-II error exponent.
result Achievement of optimal error exponents for nonparametric one- and two-sample testing in the universal setting.
Proposes counterfactual explanations for deep two-sample tests on high-dimensional data.
problem Limited interpretability of deep two-sample tests on high-dimensional data.
method Combines diffusion autoencoder and pretrained deep two-sample test model to generate counterfactuals.
result Counterfactual transformations increase p-values, indicating closer distribution similarity.
A new test detects differences between two distributions without flow.
problem Detecting differences between two distributions without flow.
method Zero-flow discrepancy (ZFD) and zero-flow two-sample test (ZF2ST).
result ZF2ST can detect strong differences in structured distributions.
Study on kernel tests for high-dimensional data, focusing on MMD and CLT.
problem Asymptotic behavior of kernel two-sample tests in high dimensions and large samples.
method Maximum mean discrepancy (MMD) with isotropic kernels, deriving asymptotic expansions and CLT.
result Interplay between moment discrepancy and dimension-and-sample orders in kernel tests.
New graph tests improve on existing methods for comparing large graphs.
problem Comparing large graphs from different sources.
method Proposed new tests based on asymptotic distributions.
result New tests are computationally less expensive and more reliable.
C2ST uses classifiers to test if two datasets are from the same distribution.
problem Assessing if two datasets are from the same distribution.
method Construct a dataset by pairing examples from each dataset with positive or negative labels, then classify and evaluate accuracy.
result C2ST learns a suitable representation, has a simple null distribution, and can interpret differences between datasets.
We consider training a deep neural network to generate samples from an unknown distribution given i.i.d. data. We frame learning as an optimization minimizing a two-sample test statistic---informally speaking, a good generator network produces samples that cause a two-sample test to fail to reject the null hypothesis. …
Develops a new test for comparing two groups' densities, showing minimax optimality.
problem Comparing probability densities between two groups.
method Probabilistic tensor product smoothing spline framework for joint density modeling; penalized likelihood ratio test for interaction testing.
result Proposed test is minimax optimal and outperforms conventional approaches.
A permutation-based SW test achieves minimax-optimal power for two-sample testing.
problem Nonparametric two-sample testing using the sliced Wasserstein distance.
method Proposes a permutation-based SW test and analyzes its performance.
result Achieves minimax separation rate n−1/2 over multinomial and bounded-support alternatives. Unified framework for optimal kernel tests across MMD, HSIC, and KSD.
problem Optimal testing in kernel-based hypothesis testing frameworks.
method Unified derivation of minimax rates, adaptive kernel selection methods.
result Unified power results across MMD, HSIC, and KSD.
We propose a new algorithmic framework for sequential hypothesis testing with i.i.d. data, which includes A/B testing, nonparametric two-sample testing, and independence testing as special cases. It is novel in several ways: (a) it takes linear time and constant space to compute on the fly, (b) it has the same power gu…
Efficiently tests two distributions using Nyström approximation of MMD.
problem Testing whether two sets of data are from the same distribution in large-scale scenarios.
method Nyström approximation of maximum mean discrepancy (MMD) for scalable testing.
result Finite-sample bound on power of the test for sufficiently separated distributions.
A new test assesses text similarity between two groups of documents.
problem Comparing similarity between two groups of documents.
method Neural network-based language models estimate entropy, and a test statistic derived from an estimation-and-inference framework is used.
result The proposed test maintains the nominal Type one error rate while offering greater power compared to existing methods.
A new witness two-sample test improves data efficiency and power.
problem Nonparametric two-sample testing.
method Optimizes kernel and defines weights and basis points using training data.
result The new test is consistent, has well-controlled type-I error, and has comparable or higher power.
A wild bootstrap method for nonparametric hypothesis tests based on kernel distribution embeddings is proposed. This bootstrap method is used to construct provably consistent tests that apply to random processes, for which the naive permutation-based bootstrap fails. It applies to a large group of kernel tests based on…
Develops a test for comparing linear models without assuming sparsity.
problem Testing equality of regression slopes in high-dimensional models.
method TIERS framework, self-normalization, ADDS estimator, plug-in approach.
result Robust test for equality of regression slopes under weak conditions.
A new test for comparing distributions is proposed, balancing optimality and efficiency.
problem Comparing distributions defined over non-Euclidean domains.
method Spectral-regularized two-sample test based on random Fourier features.
result The proposed test is minimax optimal under certain conditions.
New gossip algorithms improve robustness of rank-based statistics in decentralized systems.
problem Ensuring robustness in decentralized AI and edge intelligence systems, especially in the presence of corrupted or adversarial data.
method Developed asynchronous gossip algorithms for computing rank-based statistics.
result First convergence rate bound for asynchronous gossip-based rank estimation.
Develops a fast, accurate method for comparing networks.
problem Comparing networks with repeated observations and varying sizes/sparsity.
method A novel two-sample hypothesis testing method with theoretical guarantees.
result Outperforms existing tools in speed and accuracy, power-optimal.
New Physics Learning Machine compares generative models for scientific research.
problem Evaluating the fidelity of generative models in high-energy physics.
method Two-sample hypothesis testing using machine learning.
result The New Physics Learning Machine outperforms alternative approaches in classification-based tests.
Framework for online hypothesis testing across various data types.
problem Testing various nonparametric hypotheses in data streams.
method Unified framework using operators on data distributions, leveraging ML models.
result Efficient, adaptive, and error-controlled sequential tests.
Study evaluates two-sample tests for validating generative models in high dimensions.
problem Validating the performance and efficiency of non-parametric two-sample tests for high-dimensional generative models.
method Proposes and evaluates the sliced Wasserstein distance, mean of Kolmogorov-Smirnov statistics, and novel sliced Kolmogorov-Smirnov statistic.
result One-dimensional-based tests provide comparable sensitivity to other multivariate metrics but with lower computational cost.
We consider the hypothesis testing problem of detecting a shift between the means of two multivariate normal distributions in the high-dimensional setting, allowing for the data dimension p to exceed the sample size n. Specifically, we propose a new test statistic for the two-sample test of means that integrates a rand…
The paper solves hypothesis testing for small graphs in high-dimensional networks.
problem Testing between two populations of inhomogeneous random graphs with small sample sizes.
method Minimax testing perspective, deriving separation rates for various distance functions.
result The problem is generally not solvable for small sample sizes, but solvable for certain distances.
Study uses robust signature moments to characterize laws of stochastic processes.
problem Characterize laws of stochastic processes.
method Robust signature moments and maximum mean discrepancy metric.
result Derive a metric for laws of stochastic processes and kernelize it.
Robust tests control type I error under data corruption.
problem Effective hypothesis testing under data corruption.
method General permutation tests using kernel MMD and HSIC metrics.
result Robust tests are minimax optimal and outperform private tests.
Entropy regularized OT test assesses independence between samples.
problem Testing independence between two samples.
method Entropy regularized optimal transport.
result Non-asymptotic bounds for test statistic established.
sig-MMD tests compare path distributions using kernel methods.
problem Comparing path distributions in stochastic processes.
method Signature kernel for path space valued distributions.
result sig-MMD can lead to Type 2 errors in limited data settings.
AutoML simplifies two-sample tests for detecting distribution shifts.
problem Detecting distribution shifts between datasets.
method Uses mean discrepancy of a witness function with squared loss minimization.
result AutoML simplifies and improves two-sample testing performance.