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

Trend · papers per month

2735458181,090 · Jun 202019922001200920172026
48 results for test performance

Training on mixed distributions improves test performance even when components are unrelated.

problem Improving test performance with mismatched training and test distributions.
method Analyzing mixture distributions with different training and test proportions.
result Distribution shift can be beneficial, improving test performance even when components are unrelated.

Paper proposes a new method for more accurate group testing of infected patients.

problem Identifying infected patients efficiently with reduced tests and corrected errors.
method Adaptive design of pools based on Bayesian posterior prediction using belief propagation algorithm.
result The proposed method results in more accurate identification of infected patients.

The study examines how extra compute during testing affects the performance of large language models.

problem Understanding the conditions under which test-time scaling improves model performance.
method An in-context weight prediction task for linear regression was used to train transformers. The performance was analyzed under varying levels of test-time compute.
result Training transformers on diverse, relevant, and hard tasks leads to the best performance for test-time scaling.

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…

2014-08-23abs ↗pdf ↗

Improves test set performance and reduces out-of-sample disappointment for unstable models.

problem Ensuring strong test set performance via cross-validation for unstable models.
method Nested k-fold cross-validation with hyperparameter selection based on a weighted sum of cross-validation metric and model stability measure.
result Improves out-of-sample MSE for sparse ridge regression and CART by 4% and 2% respectively, compared to k-fold cross-validation.

This paper applies combinatorial testing to machine learning for robust model performance.

problem Identifying robust machine learning models using test and training sets.
method Adapting combinatorial interaction testing for machine learning, focusing on simple features.
result Combinatorial coverage can enhance model performance and robustness.

Simple policy search outperforms advanced learnable test-time augmentation techniques.

problem Improving predictive performance through test-time data augmentation.
method Greedy policy search (GPS) for learning test-time augmentation policies.
result Augmentation policies learned with GPS achieve superior predictive performance and robustness.

We propose a novel adaptive test of goodness-of-fit, with computational cost linear in the number of samples. We learn the test features that best indicate the differences between observed samples and a reference model, by minimizing the false negative rate. These features are constructed via Stein's method, meaning th…

2017-05-22abs ↗pdf ↗

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.

Statistical tests that compare classification algorithms are univariate and use a single performance measure, e.g., misclassification error, FF measure, AUC, and so on. In multivariate tests, comparison is done using multiple measures simultaneously. For example, error is the sum of false positives and false negatives…

2014-09-16abs ↗pdf ↗

Private online FDR control for adaptive testing under differential privacy.

problem Controlling false discoveries in adaptive multiple hypothesis testing with privacy constraints.
method Private online algorithms based on non-private results, ensuring privacy and statistical performance.
result Strong guarantees for privacy and statistical performance in FDR and power.

In this paper we consider a Lagrange Multiplier-type test (LM) to detect change in the mean of time series with heteroskedasticity of unknown form. We derive the limiting distribution under the null, and prove the consistency of the test against the alternative of either an abrupt or smooth changes in the mean. We perf…

2011-02-26abs ↗pdf ↗

The relation between performance and stress is described by the Yerkes-Dodson Law but varies significantly between individuals. This paper describes a method for determining the individual optimal performance as a function of physiological signals. The method is based on attention and reasoning tests of increasing comp…

2015-07-13abs ↗pdf ↗

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.

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.

A new framework improves kernel Stein discrepancy tests for validating distributions.

problem Improving goodness-of-fit testing for non-normal distributions.
method Introducing Sf-KSD, a unifying framework for studying Stein operators in KSD-based tests.
result Sf-KSD guides the development of new tests and outperforms existing methods.

The statistical comparison of multiple algorithms over multiple data sets is fundamental in machine learning. This is typically carried out by the Friedman test. When the Friedman test rejects the null hypothesis, multiple comparisons are carried out to establish which are the significant differences among algorithms. …

2015-05-09abs ↗pdf ↗

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.

AdaStop improves statistical testing for Deep RL algorithm comparisons.

problem Statistical reproducibility issues in Deep RL.
method AdaStop, a new statistical test based on multiple group sequential tests.
result AdaStop ensures theoretically sound comparisons of Deep RL algorithms.

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.

Classification is a fundamental problem in machine learning and data mining. During the past decades, numerous classification methods have been presented based on different principles. However, most existing classifiers cast the classification problem as an optimization problem and do not address the issue of statistic…

2019-01-03abs ↗pdf ↗

New algorithm reduces conditional independence tests needed for causal discovery.

problem Efficiently infer causal relations from observational data.
method Established an algorithm with complexity pO(s)p^{\mathcal{O}(s)} tests.
result Achieves exponent-optimality up to a logarithmic factor in terms of conditional independence tests.

Statistical test evaluates if personalizing interventions is cost-effective.

problem Balancing the benefits of personalizing interventions with their potential costs.
method Developed a statistical hypothesis test to assess the performance of personalized interventions.
result The test shows that personalized interventions can outperform standard approaches under certain conditions.

We conduct an extensive evaluation of price jump tests based on high-frequency financial data. After providing a concise review of multiple alternative tests, we document the size and power of all tests in a range of empirically relevant scenarios. Particular focus is given to the robustness of test performance to the …

2017-08-31abs ↗pdf ↗

Concolic testing combines program execution and symbolic analysis to explore the execution paths of a software program. This paper presents the first concolic testing approach for Deep Neural Networks (DNNs). More specifically, we formalise coverage criteria for DNNs that have been studied in the literature, and then d…

2018-04-30abs ↗pdf ↗

Improved hypothesis testing and change-point detection using diffusion-based methods.

problem Limited power of score-based hypothesis tests and change-point detection.
method Extending score-based Fisher divergence to diffusion-divergence by multiplying score functions with a matrix-valued function or weight matrix.
result Theoretical quantification and demonstration of optimal performance of diffusion-based algorithms.

A study on optimizing data augmentation weights for improved test-time predictions.

problem Improving robustness of predictions during testing with data augmentation methods.
method A weighted Test-Time Augmentation (TTA) approach based on variational Bayesian framework to optimize weights.
result Optimizing weights suppresses unwanted data augmentations and improves prediction performance.

A new CVaR test reduces group performance disparity detection complexity.

problem Detecting performance disparities across multiple sensitive groups in ML models.
method Conditional Value-at-Risk (CVaR) testing to reduce sample complexity.
result Sample complexity reduced exponentially to be at most the square root of the number of groups.

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.

In biospectroscopy, suitably annotated and statistically independent samples (e. g. patients, batches, etc.) for classifier training and testing are scarce and costly. Learning curves show the model performance as function of the training sample size and can help to determine the sample size needed to train good classi…

2012-11-06abs ↗pdf ↗

We introduce hyppo, a unified library for performing multivariate hypothesis testing, including independence, two-sample, and k-sample testing. While many multivariate independence tests have R packages available, the interfaces are inconsistent and most are not available in Python. hyppo includes many state of the art…

2019-07-03abs ↗pdf ↗

This paper evaluates test selection methods for deep neural networks, revealing their limitations.

problem Challenges in testing deep learning systems due to high labeling costs.
method Analysis and empirical testing of 11 test selection methods on five datasets.
result Test selection methods can fail under certain conditions, leading to significant drops in test relative coverage.

New insights into SGD and generalization via shift-curvature and bias-curvature mechanisms.

problem Understanding the role of curvature in generalization and how SGD affects it.
method Derivation of new SGD steady-state distribution and analysis of shift-curvature and bias-curvature mechanisms.
result Shift-curvature is a significant factor in test performance, especially for small SGD noise.

This work constructs a hypothesis test for detecting whether an data-generating function h:RpRh: R^p \rightarrow R belongs to a specific reproducing kernel Hilbert space H0\mathcal{H}_0 , where the structure of H0\mathcal{H}_0 is only partially known. Utilizing the theory of reproducing kernels, we reduce this hypothesis …

2017-10-03abs ↗pdf ↗

We perform a finite sample analysis of the detection levels for sparse principal components of a high-dimensional covariance matrix. Our minimax optimal test is based on a sparse eigenvalue statistic. Alas, computing this test is known to be NP-complete in general, and we describe a computationally efficient alternativ…

2012-02-23abs ↗pdf ↗

We characterize the asymptotic performance of nonparametric one- and two-sample testing. The exponential decay rate or error exponent of the type-II error probability is used as the asymptotic performance metric, and an optimal test achieves the maximum rate subject to a constant level constraint on the type-I error pr…

2019-08-27abs ↗pdf ↗

Building machine translation (MT) test sets is a relatively expensive task. As MT becomes increasingly desired for more and more language pairs and more and more domains, it becomes necessary to build test sets for each case. In this paper, we investigate using Amazon's Mechanical Turk (MTurk) to make MT test sets chea…

2014-10-20abs ↗pdf ↗

The study examines how verifier imperfections impact test-time scaling techniques.

problem Understanding how verifier imperfections affect test-time scaling methods.
method Proves the instance-level accuracy of Best-of-N and Rejection Sampling methods using the geometry of the verifier's ROC curve.
result RS outperforms BoN for fixed compute, but both converge to the same accuracy in the infinite-compute limit.