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,742 papers · 148 categories

Trend · papers per month

2905808691,159 · Jun 202019922001200920172026
48 results for test generation

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.

Study on continuous sequence classification with distribution uncertainty.

problem Classifying continuous sequences with varying distribution uncertainty.
method Proposes distribution-free tests for three test designs: fixed-length, sequential, and two-phase tests.
result Error probabilities decay exponentially fast for all test designs.

This paper provides a comprehensive survey of Machine Learning Testing (ML testing) research. It covers 144 papers on testing properties (e.g., correctness, robustness, and fairness), testing components (e.g., the data, learning program, and framework), testing workflow (e.g., test generation and test evaluation), and …

2019-06-19abs ↗pdf ↗

This paper explores the information-theoretic limitations of graph property testing in zero-field Ising models. Instead of learning the entire graph structure, sometimes testing a basic graph property such as connectivity, cycle presence or maximum clique size is a more relevant and attainable objective. Since property…

2017-09-20abs ↗pdf ↗

Unified score and distance-based GoF tests for model adequacy.

problem Difficulty in extending score-based GoF tests to nonparametric alternatives.
method Introducing semiparametric kernelized Stein discrepancy (SKSD) test.
result SKSD test is computationally efficient and universally consistent.

Testing Deep Neural Network (DNN) models has become more important than ever with the increasing usage of DNN models in safety-critical domains such as autonomous cars. The traditional approach of testing DNNs is to create a test set, which is a random subset of the dataset about the problem of interest. This kind of a…

2019-11-24abs ↗pdf ↗

This paper proposes a method to generate realistic test cases for image classifiers.

problem Ensuring neural networks for image classification are correct with adequate realistic test data.
method Captures patterns in a large input data space using a manifold, then generates fault-revealing test cases.
result Generates thousands of realistic yet fault-revealing test cases efficiently for well-trained models.

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.

Private CI tests for continuous Z with privacy constraints.

problem Testing conditional independence under differential privacy constraints.
method Developed two private CI testing procedures based on generalized covariance and conditional randomization tests.
result First private CI tests with rigorous theoretical guarantees for continuous Z.

We build new test sets for the CIFAR-10 and ImageNet datasets. Both benchmarks have been the focus of intense research for almost a decade, raising the danger of overfitting to excessively re-used test sets. By closely following the original dataset creation processes, we test to what extent current classification mode…

2019-02-13abs ↗pdf ↗

We introduce a general non-parametric independence test between right-censored survival times and covariates, which may be multivariate. Our test statistic has a dual interpretation, first in terms of the supremum of a potentially infinite collection of weight-indexed log-rank tests, with weight functions belonging to …

2019-12-08abs ↗pdf ↗

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.

The article proposes a deep learning method to test and infer the Markov property in time series data.

problem Testing and inferring the Markov property in high-dimensional time series data.
method Deep conditional generative learning to estimate conditional density functions and derive a doubly robust test statistic.
result The test controls the type-I error asymptotically and has power approaching one.

New theoretical tools simplify kernel-based tests analysis.

problem Asymptotic behavior of kernel-based tests in various scenarios.
method Avoids complex expansions and limit theorems, works directly with Hilbert spaces random functionals.
result Framework leads to simpler analysis with minimal regularity conditions.

New methods test discrete distributions faster with local privacy constraints.

problem Testing discrete distributions under local differential privacy constraints.
method Efficient randomized algorithms and test procedures, both non-interactive and interactive.
result Faster separation rates in interactive privacy mechanisms.

Automated testing improves deep learning model accuracy by 259.2%.

problem Ensuring robustness of deep learning models through automated testing.
method Jointly optimizing differential behaviors and neuron coverage; generating corner-cases; applying transformations and GANs.
result Deep learning model accuracy increased by 259.2% using automated generated corner cases.

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.

Paper develops a minimax optimal test for goodness-of-fit using kernel Stein discrepancy.

problem Developing a robust goodness-of-fit test for general domains.
method Kernel Stein Discrepancy (KSD) with spectral regularization and adaptive testing.
result Proposed regularized test achieves minimax optimality up to a logarithmic factor.

Develops a hypothesis testing framework for generalized Thurstone models.

problem Determining whether pairwise comparison data fits a generalized Thurstone model.
method Introduces separation distance and derives upper and lower bounds for testing.
result Critical threshold for testing depends on observation graph topology and scales as Θ((nk)1/2)Θ((nk)^{-1/2}) for complete graphs.

New test for conditional independence using GNNs avoids estimating conditional distributions.

problem Testing conditional independence of XX and YY given ZZ.
method Proposes a non-parametric testing procedure using GNNs to sample from marginal conditional distributions.
result Test statistic is doubly robust against GNN approximation errors.

Proposes a new method using GANs for testing conditional independence.

problem High-dimensional conditional independence testing in statistics and machine learning.
method Double GANs framework to learn conditional distributions, then construct a test statistic.
result The test statistic is doubly robust and has asymptotic power approaching one.

New method tests CMI using deep neural networks for high-dimensional data.

problem Testing conditional mean independence in high-dimensional settings.
method Population CMI measure and bootstrap-based testing with deep generative neural networks.
result Strong empirical performance and versatility in various scenarios.

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.

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 ↗

We propose a kernel-based nonparametric test of relative goodness of fit, where the goal is to compare two models, both of which may have unobserved latent variables, such that the marginal distribution of the observed variables is intractable. The proposed test generalizes the recently proposed kernel Stein discrepanc…

2019-07-01abs ↗pdf ↗

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 11 error inflation under continuous monitoring. The proposed test does not require knowledge of the underlying…

2016-10-08abs ↗pdf ↗

Near-optimal tests and confidence sequences for non-parametric data.

problem Flexible statistical inference and decision-making with non-parametric data.
method Classic delayed-start normal-mixture sequential probability ratio tests with asymptotic guarantees.
result Asymptotically optimal type-I error and expected rejection time guarantees.

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.

Develops non-parametric tests for group symmetry in data.

problem Lack of statistical tests for group symmetry in data.
method Formulates and implements non-parametric tests for distributional symmetry under specified groups.
result Develops tests for conditional invariance/equivariance and applies them to real-world data.

Study evaluates RKHS choices for assessing graph models using KSD tests.

problem Effect of RKHS choice on KSD tests for graph model assessment.
method Investigated power performance and computational runtime of KSD tests for ERGMs and synthetic graph generators.
result Different RKHS choices affect KSD test performance and computational runtime.

Probabilistic generative models provide a powerful framework for representing data that avoids the expense of manual annotation typically needed by discriminative approaches. Model selection in this generative setting can be challenging, however, particularly when likelihoods are not easily accessible. To address this …

2015-11-14abs ↗pdf ↗