New insights into CI tests reveal key factors for practical performance.
problem Understanding and improving CI tests in practical applications.
method Investigation of the Kernel-based Conditional Independence (KCI) test and analysis of its practical behavior.
result Errors in conditional mean embedding estimates and appropriate conditioning kernel selection are crucial for CI tests.
Hypothesis testing for graphs has been an important tool in applied research fields for more than two decades, and still remains a challenging problem as one often needs to draw inference from few replicates of large graphs. Recent studies in statistics and learning theory have provided some theoretical insights about …
Automated vehicles need efficient testing, which this method addresses.
problem Current testing practices are insufficient for automated vehicles.
method Gaussian Process Classification to identify performance boundaries.
result It is feasible to test for challenging scenarios more efficiently.
Gaussian kernel tests are optimal against smooth alternatives.
problem Understanding the statistical properties of nonparametric tests using Gaussian kernels.
method Analysis of Gaussian kernel-based goodness-of-fit, homogeneity, and independence tests.
result Gaussian kernel tests are minimax optimal against smooth alternatives in all three settings.
Improved A/B testing by leveraging system similarities.
problem Traditional A/B testing ignores potential system similarities.
method Off-policy estimation to exploit system propensities.
result Improved A/B testing estimators achieve better accuracy.
New method combines Bloom filters and belief propagation for efficient group testing.
problem Optimizing group testing for COVID-19 samples under practical constraints.
method Combining Bloom filters with belief propagation for scalability and accuracy.
result Strong empirical performance without mixing more than a chosen number of patients.
Proposes practical kernel tests for f-divergences with theoretical guarantees.
problem Two-sample testing and machine unlearning evaluation.
method Regularized f-divergence kernel tests, adaptive to hyperparameters. result Different f-divergences highlight localized differences. 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.
In several realistic situations, an interactive learning agent can practice and refine its strategy before going on to be evaluated. For instance, consider a student preparing for a series of tests. She would typically take a few practice tests to know which areas she needs to improve upon. Based of the scores she obta…
Testing (conditional) independence of multivariate random variables is a task central to statistical inference and modelling in general - though unfortunately one for which to date there does not exist a practicable workflow. State-of-art workflows suffer from the need for heuristic or subjective manual choices, high c…
Develops a statistical test for IV, improving feature selection reliability.
problem Lack of statistical justification in conventional IV-based feature selection.
method Establishes connection with Jeffreys divergence and proposes a nonparametric hypothesis test.
result The J-Divergence test provides rigorous guarantees and is more reliable than traditional IV thresholds.
This paper introduces differentially private permutation tests for hypothesis testing.
problem Privacy concerns in sensitive data analysis.
method Differentially private permutation tests for kernel methods.
result Proposes dpMMD and dpHSIC for two-sample and independence testing, achieving optimal power.
Private two-sample tests under LDP achieve minimax rates for multinomial and continuous data.
problem Achieving statistical utility while maintaining privacy in two-sample testing.
method Private permutation tests for multinomial data and adaptive tests for continuous data.
result Minimax optimal tests for private two-sample testing under LDP.
Estimates peeking effects in p-values to correct bias.
problem Data peeking biases reported p-values downward.
method Develops mechanisms to estimate running extrema of test statistics.
result Corrects bias in p-values due to peeking.
We present a new, practical algorithm to test whether a knot complement contains a closed essential surface. This property has important theoretical and algorithmic consequences; however, systematically testing it has until now been infeasibly slow, and current techniques only apply to specific families of knots. As a …
A new method reduces computational costs for testing RF variable importance measures.
problem Testing variable importance measures from random forests is computationally expensive and challenging.
method Sequential permutation testing and sequential p-value estimation to reduce computational costs.
result Theoretical properties of sequential tests are confirmed, maintaining type-I error and high power.
Improves A/B testing for long-term outcomes in dynamic systems.
problem Estimating long-term effects from short-term A/B testing data.
method Develops optimal inference techniques and localized information sharing methods.
result New estimator reduces variance linearly with test arms and matches lower bounds.
The Normal Means problem plays a fundamental role in many areas of modern high-dimensional statistics, both in theory and practice. And the Empirical Bayes (EB) approach to solving this problem has been shown to be highly effective, again both in theory and practice. However, almost all EB treatments of the Normal Mean…
This paper focusses on "safe" screening techniques for the LASSO problem. Motivated by the need for low-complexity algorithms, we propose a new approach, dubbed "joint" screening test, allowing to screen a set of atoms by carrying out one single test. The approach is particularized to two different sets of atoms, respe…
We review the main "omnibus procedures" for goodness-of-fit testing for copulas: tests based on the empirical copula process, on probability integral transformations, on Kendall's dependence function, etc, and some corresponding reductions of dimension techniques. The problems of finding asymptotic distribution-free te…
Continuous integration is an indispensable step of modern software engineering practices to systematically manage the life cycles of system development. Developing a machine learning model is no difference - it is an engineering process with a life cycle, including design, implementation, tuning, testing, and deploymen…
Current clinical practice to monitor patients' health follows either regular or heuristic-based lab test (e.g. blood test) scheduling. Such practice not only gives rise to redundant measurements accruing cost, but may even lead to unnecessary patient discomfort. From the computational perspective, heuristic-based test …
Detects dense subhypergraphs in heterogeneous random hypergraphs.
problem Testing for the existence of a dense subhypergraph in heterogeneous random hypergraphs.
method Established detection boundaries and constructed asymptotically powerful and adaptive tests.
result Developed tests for distinguishing between null and alternative hypotheses.
The paper improves A/B testing for non-Gaussian data, ensuring reliable results with large sample sizes.
problem Inaccurate A/B testing results due to non-normal data and unequal sample sizes.
method Derives explicit formulas for minimum sample size and introduces an Edgeworth-based correction.
result Corrected method improves reliability of A/B testing in real-world conditions.
The paper improves confidence intervals for test error using cross-validation.
problem Improving confidence intervals for test error in machine learning.
method Develops central limit theorems and consistent estimators for cross-validation.
result Provides asymptotically-exact confidence intervals and hypothesis tests.
Develops a new method for neural network significance testing without strict constraints.
problem Testing neural networks without bounded weights or specific architectural constraints.
method Uses Rademacher complexity bounds, weakened Sobolev space membership conditions, and a modified sieve space construction.
result Achieves optimal convergence rates and valid asymptotic distributions for test statistics.
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.
Paper proposes a robust hypothesis testing method using Sinkhorn distance.
problem Hypothesis testing for small samples.
method Data-driven approach using Sinkhorn uncertainty sets.
result The method provides a more flexible detector compared to Wasserstein robust test.
New estimate reduces overfitting risk in machine learning models.
problem Error rate on test data may not reflect true population error due to adaptive data analysis practices.
method Introduces Rip van Winkle's Razor, a simple estimate of overfit to test data based on information content.
result Shows non-vacuous estimate of deviation in many modern settings.
The statistical analysis of discrete data has been the subject of extensive statistical research dating back to the work of Pearson. In this survey we review some recently developed methods for testing hypotheses about high-dimensional multinomials. Traditional tests like the χ2 test and the likelihood ratio test ca…
New group testing method uses Belief Propagation for accurate screening.
problem Efficiently identifying infected samples in large groups with minimal tests.
method Belief Propagation algorithm for inference in group testing schemes.
result Significantly increased accuracy of infection identification with fewer tests.
Paper proposes a framework to detect distribution shifts using embedding space geometry.
problem Detecting distribution shifts in candidate datasets to improve model generalizability.
method Non-parametric framework using embedding space geometry for two tests: robustness boundary and in-distribution/out-of-distribution classification.
result Both tests successfully detect distribution shifts in various scenarios for both synthetic and real-world datasets.
Tests for equivariance in non-parametric regression models.
problem Detecting false assumptions of symmetry in regression models.
method Develops tests for G-equivariance independent of the model. result Confidence in using equivariant models when symmetry is unknown.
We propose a nonparametric sequential test that aims to address two practical problems pertinent to online randomized experiments: (i) how to do a hypothesis test for complex metrics; (ii) how to prevent type 1 error inflation under continuous monitoring. The proposed test does not require knowledge of the underlying…
Constraint-based causal discovery (CCD) algorithms require fast and accurate conditional independence (CI) testing. The Kernel Conditional Independence Test (KCIT) is currently one of the most popular CI tests in the non-parametric setting, but many investigators cannot use KCIT with large datasets because the test sca…
New framework limits testing algorithmic stability under computational constraints.
problem Testing algorithmic stability is computationally hard.
method Unified framework for quantifying stability hardness.
result Exhaustive search is the only universally valid mechanism for certifying stability.
Reduces test set maintenance effort by 80-100%.
problem Lack of proper and up-to-date test sets in real-world scenarios.
method Simple technique to reduce labeling effort.
result Significant reduction in test set maintenance effort (80-100%).
Research suggests using deep learning for better recommendation systems.
problem Recommender systems rely on proxies for A/B testing, leading to random success.
method Advocates for using deep learning to improve recommendation performance.
result Deep learning can potentially optimize reward in recommendation systems.
Semi-supervised method boosts two-sample testing with covariate data.
problem Two-sample testing with covariate information.
method Semi-supervised kernel test with asymptotic normality.
result Higher asymptotic power compared to existing methods.
The ERI is a new index for measuring exam readiness.
problem Measuring exam readiness in a clear and actionable way.
method The ERI combines six signals derived from practice and mock tests, formalizing axioms for component maps and the composite.
result The ERI is a composite score interpretable and actionable for exam readiness.
Study improves CI tests for relational data to robustly discover causal structures.
problem Learning causal relationships from relational data.
method Conduct CI tests against relational data to robustly recover causal structure.
result Effective approach demonstrated through experiments.
The paper introduces tests for high-dimensional independence using maximum and average distance correlations.
problem Testing independence in high-dimensional data.
method Characterizes consistency properties, compares test statistics, examines null distributions, and presents a fast chi-square-based procedure.
result The proposed tests are non-parametric and applicable to various metrics.
Study tests financial market efficiency using random number generator tests.
problem Check for informational efficiencies in financial markets.
method Analysed binary daily returns as random number generators, split analysis by annual and company levels, investigated longer-term efficiency over Nasdaq-listed companies.
result Information efficiency varies across years and reflects large-scale market impacts.
Proposes a modified Morgan-Pitman test for evaluating variances in machine learning models.
problem Limited ability to account for sampling variability in model selection.
method Enhances the classic Morgan-Pitman test for robustness in non-linear models with heavy-tailed distributions or outliers.
result Demonstrates the test's effectiveness and practical utility in model evaluation and selection.
New methods needed to evaluate uncertainty estimates in neural networks.
problem Evaluating uncertainty estimates in neural networks is flawed and inconsistent.
method Proposes a simulation-based testing approach to address flaws in current methods.
result Current methods for evaluating uncertainty estimates have significant flaws and cannot accurately compare different methods.
Simple methods combine statistical tests for out-of-distribution detection.
problem Detecting data points not following the training distribution.
method Combining classical parametric tests (Rao's score test) and a typicality test.
result Combining Fisher's method of test statistics improves out-of-distribution detection accuracy.
The paper improves the robustness of approximate randomization tests.
problem Noisy data limits the robustness of approximate randomization tests.
method Derives non-asymptotic bounds and novel conditions for approximate randomization tests.
result Valid approximate randomization tests under data invariances can be derived.
Bayesian methods improve group testing for identifying infected patients.
problem Identifying infected patients from group testing results with false positives.
method Bayesian inference and belief propagation algorithm, combined with expectation-maximization method.
result True-positive rate improved by considering credible intervals.