Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,694 papers · 148 categories

Trend · papers per month

99197296394 · Jun 202019922001200920172026
48 results for powerful tests

Power of network tests degrades when vertices are misaligned.

problem Power loss in network hypothesis testing due to vertex shuffling.
method Theoretical analysis and simulations of Frobenius norm differences in random dot product and stochastic block models.
result Shuffling vertices can significantly reduce the power of network tests.

Paper proposes a robust test for high-dimensional models with large covariates and instruments.

problem Testing high-dimensional linear instrumental variable models with large covariates and instruments.
method Introduces a test based on the maximum norm of multiple parameters and a power-enhanced test.
result The proposed test is robust to heteroskedastic errors and has higher power than existing tests.

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 n1/2n^{-1/2} over multinomial and bounded-support alternatives.

This paper shows how to construct sequential tests with power one against weakly compact sets in Polish spaces.

problem Testing composite null hypotheses involving weakly compact sets in Polish spaces.
method Develops sequential tests for i.i.d. laws in Polish spaces, providing a sufficient condition for power one.
result Power-one sequential tests exist for weakly compact sets against their complements in i.i.d. laws in Polish spaces.

We introduce a new test for detection of power-law cross-correlations among a pair of time series - the rescaled covariance test. The test is based on a power-law divergence of the covariance of the partial sums of the long-range cross-correlated processes. Utilizing a heteroskedasticity and auto-correlation robust est…

2013-07-17abs ↗pdf ↗

Improved MMD test for two-sample testing with random Fourier features.

problem Quadratic-time complexity of MMD test for large-scale analysis.
method Approximated MMD test using random Fourier features, investigating time-power trade-off.
result Sub-quadratic time complexity with same minimax separation rates as MMD test.

Unified CI test for categorical and ordinal data maintains power in high dimensions.

problem Rapid degradation of statistical power in existing CI tests for high-dimensional conditioning variables.
method Unified CI test for categorical and ordinal data, maintaining reasonable calibration and power in high dimensions.
result Our test outperforms existing baselines in model testing and structure learning for dense directed graphical models.

Meta two-sample testing uses auxiliary data to quickly find powerful tests from limited samples.

problem Challenges in identifying powerful kernels for distinguishing complex distributions with limited data.
method Introduces meta two-sample testing (M2ST) to leverage abundant auxiliary data on related tasks.
result Proposed algorithms improve over baselines and identify powerful tests from scarce observations.

The paper analyzes a private likelihood-ratio test for frequency tables under differential privacy constraints.

problem Achieving privacy in statistical data analysis while maintaining statistical utility.
method A rigorous analysis of a private likelihood-ratio (LR) test for goodness-of-fit in frequency tables, considering (ε,δ)(\varepsilon,δ)-differential privacy.
result Characterization of the trade-off between differential privacy parameters (ε,δ)(\varepsilon,δ) and statistical power of the private LR test.

Testing independence is of significant interest in many important areas of large-scale inference. Using extreme-value form statistics to test against sparse alternatives and using quadratic form statistics to test against dense alternatives are two important testing procedures for high-dimensional independence. However…

2015-12-30abs ↗pdf ↗

DIET tests conditional independence using marginal dependence measures of residual information.

problem Computational intractability of conditional randomization tests (CRTs).
method DIET avoids fitting large models by leveraging marginal independence statistics of information residuals.
result DIET achieves higher power than other tractable CRTs on synthetic and real benchmarks.

DART2 enhances multiple testing by leveraging ancillary information robustly.

problem Enhancing multiple testing power with uncertain ancillary information.
method Distance-assisted multiple testing procedure (DART2) that handles both helpful and misleading ancillary information.
result DART2 asymptotically controls FDR and improves power when ancillary information is helpful, maintaining FDR and power otherwise.

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χ^2 test and the likelihood ratio test ca…

2017-12-17abs ↗pdf ↗

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…

2013-07-08abs ↗pdf ↗

This work improves independence tests for high-dimensional data.

problem Detecting subtle dependencies between high-dimensional random variables with complex distributions.
method Develops two approaches to learn powerful independence tests using variational mutual information and HSIC.
result Optimized HSIC tests generally outperform other approaches on detecting structured dependence.

Two semimetrics on probability distributions are proposed, given as the sum of differences of expectations of analytic functions evaluated at spatial or frequency locations (i.e, features). The features are chosen so as to maximize the distinguishability of the distributions, by optimizing a lower bound on test power f…

2016-05-22abs ↗pdf ↗

Near-optimal private tests for simple and MLR hypotheses developed under Gaussian differential privacy.

problem Developing private tests for simple and MLR hypotheses under Gaussian differential privacy.
method A private mean estimator with data-driven clamping bounds, constructing private test statistics.
result Private tests achieve the same asymptotic relative efficiency as non-private most powerful tests.

FMCIT accelerates CI tests for causal discovery, maintaining power and efficiency.

problem High computational complexity in CI tests limits practical applicability of causal discovery methods.
method Flow Matching-based Conditional Independence Test (FMCIT) that leverages flow matching for fast CI tests.
result FMCIT effectively controls type-I error and maintains high testing power under the alternative hypothesis.

Conditional independence testing is a key problem required by many machine learning and statistics tools. In particular, it is one way of evaluating the usefulness of some features on a supervised prediction problem. We propose a novel conditional independence test in a predictive setting, and show that it achieves bet…

2019-07-31abs ↗pdf ↗

Discusses MultiFIT for multivariate dependence, comparing it to HSIC tests.

problem Comparing Multiscale Fisher's Independence Test (MultiFIT) to HSIC tests for multivariate dependence.
method Compares MultiFIT to HSIC tests, highlighting exact level control and performance limitations.
result Observes performance limitations of MultiFIT in terms of test power.

Study improves statistical power for detecting algorithmic bias in educational data.

problem Challenges in measuring algorithmic bias using ABROCA due to skewed distribution.
method Investigates ABROCA's distributional properties and proposes nonparametric randomization tests.
result ABROCA-based bias assessments are underpowered in typical EDM sample sizes.

USP test improves on Pearson's chi-squared and GG-test for independence.

problem Deficiencies in Pearson's chi-squared and GG-test for independence.
method USP test based on UU-statistic estimator of population dependence measure.
result USP test controls size, handles small cell counts, and detects minimal violations of independence.

Improved KSD test for better detection of differences in distributions.

problem Low power of KSD test when distributions have same modes but different mixing proportions.
method Perturb the observed sample using Markov transition kernels to improve KSD test power.
result Perturbed KSD test can lead to substantially higher power than the original KSD test.

New algorithms control FDX while achieving more power in online multiple testing.

problem Problems with previous online multiple testing methods, including high FDX and low power.
method Developed new dynamic algorithms that adjust testing levels based on accumulated wealth.
result SupLORD algorithm achieves higher power and FDR control in synthetic experiments.

Proposes DR-ME test for interpretable distributional treatment effects.

problem Detects invisible differences in treatment effects on distributional outcomes.
method Semiparametrically efficient finite-location test using kernel witnesses and orthogonal features.
result DR-ME reveals causal-discrepancy coordinates and has noncentral chi-square local power.

Deep-learning method improves hypothesis testing for independence.

problem Improving hypothesis testing for independence using deep learning.
method Proposes deep-testing, a novel procedure that uses a deep neural network to distinguish between data generated under and outside a given statistical model.
result Deep-testing achieves the highest overall power against nineteen competing methods across various dependence structures.