New method tests linear hypotheses in high-dimensional models without sparsity assumptions.
problem Testing linear hypotheses in high-dimensional models without restrictive assumptions.
method Proposes a test based on restructured regression with transformed and augmented features.
result Asymptotically exact control on Type I error without sparsity assumptions.
Develops a flexible framework for hypothesis testing in high-dimensional linear regression.
problem Hypothesis testing in high-dimensional linear regression models with more parameters than samples.
method Assumes approximate sparsity and develops a framework for testing various hypotheses, controlling type I error and power.
result The proposed procedure controls type I error near the nominal level and has high power.
Unified framework for large-scale hypothesis testing with confounders.
problem Bias in large-scale hypothesis testing due to unmeasured confounders.
method Unified statistical estimation and inference framework that disentangles confounding effects and jointly estimates latent and primary effects.
result Effective Type-I error control and power in hypothesis testing.
This letter presents a novel Block Bayesian Hypothesis Testing Algorithm (Block-BHTA) for reconstructing block sparse signals with unknown block structures. The Block-BHTA comprises the detection and recovery of the supports, and the estimation of the amplitudes of the block sparse signal. The support detection and rec…
A test for sparsity in Bayesian networks helps choose algorithms.
problem Selecting appropriate structure discovery algorithms for Bayesian networks.
method Developed a hypothesis test using the largest eigenvalue of the normalized inverse covariance matrix.
result The hypothesis test can determine if a BN has max in-degree greater than 1.
A heuristic framework tests the multi-manifold hypothesis in empirical data.
problem Overestimation of parameters in global linear models.
method Heuristic multiscale framework using spline-interpolated manifolds.
result Validates the multi-manifold hypothesis in empirical data.
Paper extends Chernoff sampling for active testing and parameter estimation, improving neural network and regression models.
problem Reducing sample complexity in hypothesis testing and model parameter estimation.
method Developed an extension of Chernoff sampling for active learning and parameter estimation.
result Non-asymptotic bounds for sample complexity and estimation error in active learning.
Paper studies PSGD for constrained optimization problems and its statistical properties.
problem Online inference for constrained optimization problems.
method Stochastic gradient descent with projection (PSGD) for constrained optimization.
result Limiting distribution of PSGD-based estimates under linear-equality constraints.
A test for weak signal detection in noisy data matrices.
problem Detecting a weak signal in a noisy Wigner matrix when the signal-to-noise ratio is small.
method Utilizes linear spectral statistics and hypothesis testing on the data matrix.
result The proposed test is optimal when the noise is Gaussian and can be improved with known noise density.
Efficient tests achieve best error rates in high-dimensional hypothesis testing.
problem Achieving optimal error rates in computationally efficient hypothesis testing.
method Linear spectral statistics and low-degree likelihood ratio analysis.
result An efficient test achieves the best possible error rates among all computationally efficient tests.
Method constructs confidence regions for linear models with arbitrary predictors.
problem Constructing confidence regions for linear models with non-linear predictors.
method Mixed Integer Linear Programming for constraints.
result Empty confidence regions for hypothesis testing.
A debiased score test detects linear structure in semiparametric models.
problem Testing linear structure in semiparametric models.
method Hunt-and-test strategy with debiasing correction.
result The test has power when the hunted direction is correlated with the true score.
A framework for hypothesis testing on attributed graphs using sampling.
problem Statistical testing on graph data, especially large attributed graphs.
method Sampling-based framework with PHASE and PHASEopt for accurate and efficient hypothesis testing.
result PHASE and PHASEopt improve accuracy and efficiency of hypothesis testing in attributed graphs.
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.
The paper sets thresholds for testing correlation in hypergraphs, distinguishing between independent and correlated states.
problem Testing correlation between two hypergraphs under different models.
method Derives sharp information-theoretic thresholds for distinguishing between null and alternative hypotheses.
result The testing threshold decreases as the hypergraph's uniformity (m) increases, making correlation testing easier for higher uniformity.
Binary testing for softmax models requires many samples, similar to leverage score models.
problem Binary hypothesis testing for softmax models and leverage score models.
method Analyzing sample complexity and drawing analogies between models.
result Sample complexity is asymptotically \(O(ε^{-2})\), where \(ε\) is the distance between model parameters.
A simple algorithm for Gaussian mean testing with optimal sample complexity.
problem Distinguishing between standard Gaussian and other Gaussian distributions with unknown mean and covariance.
method An extremely simple algorithm with a one-page analysis.
result Optimal sample complexity of Θ(√d/ε^2) with sample linear time.
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…
Study robust hypothesis testing under Hellinger distance, proving lower bounds and providing tests.
problem Testing close variants of specified distributions robustly to Hellinger distance.
method Lower bound on slack factor, testing with Hellinger balls, symmetric chi-squared distance analysis.
result Lower bound on slack factor quantifies robustness under misspecification.
Paper resolves open problems on sample complexity in binary hypothesis testing.
problem Open problems in distributed simple binary hypothesis testing under information constraints.
method One-shot lower bound on Bayes error, streamlined sample complexity formula, reverse data-processing inequality.
result Optimally tight sample complexity bounds for communication-constrained simple binary hypothesis testing.
New algorithms for decision trees with noisy outcomes improve learning efficiency.
problem Learning with noisy outcomes in active learning.
method Approximation algorithms for optimal decision trees with persistent noise.
result Approximation algorithms provide nearly optimal performance guarantees.
Improves signal detection in non-Gaussian noise using transformed data.
problem Signal detection in rank-one signal-plus-noise data matrices.
method Pre-transforming matrix entries and using linear spectral statistics for hypothesis testing.
result Sharp phase transition of largest eigenvalues in spiked rectangular matrices.
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.
Study shows Chinese stock market returns are predictable over time, especially during market turbulence.
problem Predicting returns in the Chinese stock market is challenging due to market inefficiency.
method Used wild bootstrap automatic variance ratio test and generalized spectral test.
result Return predictability varies over time, with significant predictability during market turmoils.
Transforms any test into anytime-valid with sample savings.
problem Sequential data invalidates classical test guarantees.
method Predicts test outcomes to create anytime-valid stopping rules.
result Ensures Type-I error control and near-optimal power.
Paper proposes a new framework for hypothesis testing in imaging.
problem Challenges in hypothesis testing for imaging data.
method Combines self-supervised imaging, vision-language models, and non-parametric hypothesis testing.
result Demonstrates improved power and robust error control in image-based phenotyping.
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.
Study hypothesis testing under quantized samples with communication constraints, achieving near-optimal sample complexity.
problem Optimizing hypothesis testing with quantized samples and communication constraints.
method Developed a polynomial-time algorithm achieving near-optimal sample complexity under communication constraints.
result Achieved near-optimal sample complexity under communication constraints, with a logarithmic factor increase over unconstrained setting.
New private algorithm for sequential hypothesis testing with privacy and error rate guarantees.
problem Privacy protection in sequential hypothesis testing for sensitive data.
method Renyi differential privacy, Wald's Sequential Probability Ratio Test (SPRT).
result Private algorithm with strong privacy guarantees and theoretical performance analysis.
Efficiently estimates Cox model coefficients without sharing data.
problem Privacy and ownership concerns in multi-center biomedical studies.
method Communication-efficient iterative distributed algorithms for estimation and inference.
result Achieves convergence rate of full-sample estimator with minimal iterations.
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…
Robust test for distributions under Hellinger distance, simpler than optimal tests.
problem Testing and estimating distributions robustly under Hellinger distance.
method Simple robust hypothesis test with optimal sample complexity, robust to Hellinger distance perturbations.
result Empirically demonstrated robustness and power of the test on canonical distributions.
Develops a framework to test excessive influence of small data subsets.
problem Identifying when small data subsets significantly impact model conclusions.
method Formalizes the concept of most influential sets, deriving influence formulas and extreme value distributions.
result Allows rigorous hypothesis testing for excessive influence, resolving contested findings.
Paper optimizes hypothesis verification in sequential experiments.
problem Maximizing confidence in a verified hypothesis after exploration.
method Formulated as a confidence maximization problem in a POMDP, characterized optimal solutions, and proposed a heuristic.
result Heuristic performs better than existing methods in some scenarios.
Neural networks improve language comprehension by testing and refining hypotheses.
problem Improving language comprehension models through more sophisticated reasoning.
method Memory augmented neural networks with a hypothesis testing loop.
result Achieved state-of-the-art results on language comprehension benchmarks.
Unified Bayesian framework improves clinical trial hypothesis testing.
problem Lack of transparency and inability to quantify evidence in traditional P-values.
method Interval null hypothesis framework combined with Bayes factor-based tests.
result Bayesian interval hypothesis testing ensures frequentist error control and interpretability.
Study on hypothesis testing games with adversarial classification, showing convergence rates.
problem Adversarial classification in hypothesis testing.
method Mixed strategy Nash equilibria analysis, concentration phenomena examination.
result Exponential rates of convergence of classification errors at equilibrium.
The problem of multiple hypothesis testing arises when there are more than one hypothesis to be tested simultaneously for statistical significance. This is a very common situation in many data mining applications. For instance, assessing simultaneously the significance of all frequent itemsets of a single dataset entai…
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.
Develops GLRT for defending against adversarial attacks in hypothesis testing.
problem Adversarial attacks on machine learning models causing misclassification.
method Generalized likelihood ratio test applied to composite hypothesis testing problem.
result GLRT approach yields competitive robustness-accuracy tradeoff under various attacks.
We formulate statistical watermarking as hypothesis testing and establish near-optimal bounds.
problem Statistical watermarking in the context of hypothesis testing.
method Formulated as a hypothesis testing problem, using coupling of output tokens and rejection regions.
result Established nearly matching upper and lower bounds on the number of i.i.d. tokens required for small Type I and Type II errors.
We develop a framework for post model selection inference, via marginal screening, in linear regression. At the core of this framework is a result that characterizes the exact distribution of linear functions of the response y, conditional on the model being selected (``condition on selection" framework). This allows…
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.
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.
Proposes a new model for testing causal structural priors and synthesizing data.
problem Testing and synthesizing causal structural priors using nonparametric knowledge and neural networks.
method Causal Structural Hypothesis Testing (C-SHT) and Causal Structural Variational Hypothesis Testing (C-SVHT) using deep neural networks.
result Demonstrates out-of-distribution generalization error as a proxy for causal structural prior hypothesis testing.
This paper explains differential privacy through hypothesis testing and analyzes its relaxations.
problem Understanding the hypothesis testing interpretation of differential privacy.
method Identifying conditions for a statistical divergence to satisfy a similar interpretation and analyzing relaxations of differential privacy based on Renyi divergence.
result Improved conversion rules between differential privacy and its relaxations based on Renyi divergence.
Formula derived for sample complexity in binary hypothesis testing.
problem Determine the minimum number of samples to distinguish between two distributions.
method Developed a formula for sample complexity in both prior-free and Bayesian settings, using Jensen-Shannon and Hellinger divergences.
result Formula characterizes sample complexity for a wide range of error parameters, up to multiplicative constants.
The paper presents a test to determine when pooling datasets from multiple sites is beneficial for regression analysis.
problem Determining when pooling multi-site datasets improves regression analysis power.
method Developed a hypothesis test for classical and high-dimensional linear regression to assess when pooling datasets is sensible.
result Identified specific conditions under which pooling datasets improves power in regression analysis.