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

67134200267 · Jun 202019922001200920172026
48 results for Testing Hypotheses

Sequential tests for nonparametric hypotheses using supermartingales.

problem Designing valid sequential tests for nonparametric null hypotheses.
method Using elicitable and identifiable functionals, nonnegative supermartingales, and Online Convex Optimization.
result Rigorous guarantees on asymptotic power for a wide range of alternative hypotheses.

Hypothesis testing in singular models is fundamentally about identifiable vs. non-identifiable parameters.

problem Testing in singular models is inherently problematic due to non-identifiability and degeneracy of Fisher information.
method Formalized the overlap obstruction and showed that hypotheses over non-identifiable parameters are untestable, while those over identifiable parameters reduce to classical testing.
result Hypotheses over non-identifiable parameters are untestable, while those over identifiable parameters reduce to classical testing.

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.

Drawing on some recent results that provide the formalism necessary to definite stationarity for infinite random graphs, this paper initiates the study of statistical and learning questions pertaining to these objects. Specifically, a criterion for the existence of a consistent test for complex hypotheses is presented,…

2017-08-10abs ↗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.

Do two data samples come from different distributions? Recent studies of this fundamental problem focused on embedding probability distributions into sufficiently rich characteristic Reproducing Kernel Hilbert Spaces (RKHSs), to compare distributions by the distance between their embeddings. We show that Regularized Ma…

2013-05-02abs ↗pdf ↗

We consider the problem of asynchronous online testing, aimed at providing control of the false discovery rate (FDR) during a continual stream of data collection and testing, where each test may be a sequential test that can start and stop at arbitrary times. This setting increasingly characterizes real-world applicati…

2018-12-12abs ↗pdf ↗

The problem of finding itemsets that are statistically significantly enriched in a class of transactions is complicated by the need to correct for multiple hypothesis testing. Pruning untestable hypotheses was recently proposed as a strategy for this task of significant itemset mining. It was shown to lead to greater s…

2014-07-01abs ↗pdf ↗

New method controls false discoveries in online testing with deadlines.

problem Controlling false discoveries in online hypothesis testing with decision deadlines.
method Benjamini-Hochberg-type procedure over a moving window of hypotheses with adaptive threshold parameters.
result Controls false discovery rate at every stage and adaptively chosen stopping times.

In many practical applications of multiple hypothesis testing using the False Discovery Rate (FDR), the given hypotheses can be naturally partitioned into groups, and one may not only want to control the number of false discoveries (wrongly rejected null hypotheses), but also the number of falsely discovered groups of …

2015-12-10abs ↗pdf ↗

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.

DivDis learns diverse hypotheses from underspecified data to improve robustness.

problem Learning from underspecified datasets leads to multiple equally viable solutions, causing out-of-distribution issues.
method DivDis framework: 1) learns diverse hypotheses using unlabeled test data, 2) selects one hypothesis with minimal additional supervision.
result DivDis finds robust features in image and natural language processing problems.

The paper confirms two groups of gamma-ray bursts using a new nonparametric metric.

problem Determining the number of inherent groups in gamma-ray bursts.
method A new nonparametric interpoint distance-based measure, combined with clustering methods.
result Confirms two groups of short and long gamma-ray bursts.

The paper tests hypotheses on two Lévy process-driven streams of observations.

problem Testing hypotheses on two Lévy process-driven streams of observations.
method Infinitesimal generators and super/sub-solutions are used to compute bounds and analyze the model.
result Bounds for infinitesimal generators are computed in terms of super/sub-solutions.

Efficient algorithms identify true hypothesis from many options with minimal actions.

problem Identifying true hypothesis from a large set of options with minimal actions.
method Greedy approximation algorithms for active sequential hypothesis testing.
result First approximation guarantees for ASHT, independent of the number of hypotheses.

While statistics focusses on hypothesis testing and on estimating (properties of) the true sampling distribution, in machine learning the performance of learning algorithms on future data is the primary issue. In this paper we bridge the gap with a general principle (PHI) that identifies hypotheses with best predictive…

2008-09-08abs ↗pdf ↗

New method quantifies reliability of neural network image segmentation.

problem Assessing statistical reliability of neural network-based image segmentation results.
method Selective inference framework to compute exact p-values for DNN-driven hypotheses.
result Proposed method successfully controls false positive rate and provides good results for medical image data.

The hypothesis of randomness is fundamental in statistical machine learning and in many areas of nonparametric statistics; it says that the observations are assumed to be independent and coming from the same unknown probability distribution. This hypothesis is close, in certain respects, to the hypothesis of exchangeab…

2019-06-21abs ↗pdf ↗

Hypothesis testing plays a central role in statistical inference, and is used in many settings where privacy concerns are paramount. This work answers a basic question about privately testing simple hypotheses: given two distributions PP and QQ, and a privacy level ε\varepsilon, how many i.i.d. samples are needed to…

2018-11-27abs ↗pdf ↗

Hypothesis testing in the linear regression model is a fundamental statistical problem. We consider linear regression in the high-dimensional regime where the number of parameters exceeds the number of samples (p>np> n). In order to make informative inference, we assume that the model is approximately sparse, that is th…

2017-04-26abs ↗pdf ↗

The paper develops online methods to control familywise error rate in growing hypothesis testing sequences.

problem Controlling familywise error rate in a growing sequence of hypotheses over time.
method Unified algorithmic concepts for offline and online FWER control, including new adaptive online algorithms.
result Substantial gains in power demonstrated and formally proved in a Gaussian sequence model.

Machine Learning benefits from prior information and computational power for better performance and understanding.

problem Improper use of Machine Learning methods leads to lack of understanding and performance issues.
method Employing prior information and computational power to solve learning problems, emphasizing interpretability and performance.
result Combining prior information and computational power can lead to better understanding and performance in Machine Learning.

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.

DP-SPRT improves privacy in sequential tests with near-optimal error rates.

problem Privacy constraints in sequential probability ratio tests.
method A wrapper for SPRT that uses a private mechanism to determine when to stop based on predefined intervals.
result DP-SPRT achieves near-optimal error rates and privacy guarantees.

The properties of statistical tests for hypotheses concerning the parameters of the multifractal model of asset returns (MMAR) are investigated, using Monte Carlo techniques. We show that, in the presence of multifractality, conventional tests of long memory tend to over-reject the null hypothesis of no long memory. Ou…

2016-01-05abs ↗pdf ↗

Finding statistically significant interactions between binary variables is computationally and statistically challenging in high-dimensional settings, due to the combinatorial explosion in the number of hypotheses. Terada et al. recently showed how to elegantly address this multiple testing problem by excluding non-tes…

2014-07-04abs ↗pdf ↗

Context. Generative models open up the possibility to interrogate scientific data in a more data-driven way. Aims: We propose a method that uses generative models to explore hypotheses in astrophysics and other areas. We use a neural network to show how we can independently manipulate physical attributes by encoding ob…

2018-12-03abs ↗pdf ↗

Robust hypothesis testing designs a test for worst-case distributions using kernel methods.

problem Design a robust test for hypothesis testing under uncertainty sets.
method Data-driven uncertainty sets constructed using kernel mean embeddings and maximum mean discrepancy (MMD). Bayesian and Neyman-Pearson settings investigated.
result Proposed robust kernel tests are exponentially consistent and asymptotically optimal.

A new framework selects information sources to test hypotheses robustly, even with misclassifications.

problem Robust hypothesis testing with misclassification penalties.
method Introduces a misclassification penalty framework and an efficient greedy algorithm.
result Proposes a submodular surrogate metric for better selection.

More powerful feature selection tests using selective inference.

problem Selection bias in feature selection leading to specious analysis.
method Conditioning on minimal selection event using Maximum Mean Discrepancy and Hilbert Schmidt Independence Criterion with multiscale bootstrap.
result Proposed test is more powerful in most scenarios.

Crowdsourcing has been successfully applied in many domains including astronomy, cryptography and biology. In order to test its potential for useful application in a Smart Grid context, this paper investigates the extent to which a crowd can contribute predictive hypotheses to a model of residential electric energy con…

2017-09-08abs ↗pdf ↗

Multiple hypothesis testing is a core problem in statistical inference and arises in almost every scientific field. Given a set of null hypotheses H(n)=(H1,,Hn)\mathcal{H}(n) = (H_1,\dotsc, H_n), Benjamini and Hochberg introduced the false discovery rate (FDR), which is the expected proportion of false positives among rejected nu…

2016-03-29abs ↗pdf ↗

LLM agents discover cryptocurrency factors under reproducible constraints.

problem Flexibility of LLM agents in empirical discovery leads to uncontrolled search.
method Sequential hypothesis search with fixed data splits and portfolio tests.
result Ridge-combined portfolio achieves 44.55% annualized return in out-of-sample period.

Unified method for MMD variance estimation improves accuracy and computational efficiency.

problem Variance estimation for MMD in nonparametric testing.
method Unified finite-sample characterization of MMD variance through U-statistic and Hoeffding decomposition; exact acceleration method for univariate case.
result Unified estimators improve accuracy and computational efficiency for MMD variance.

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 ↗