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

Trend · papers per month

150300449599 · Jun 202019922001200920172026
48 results for Multiple Tests Procedure

Proposes a method to estimate and infer networks from multiple high-dimensional point processes.

problem Estimating and inferring networks from multiple high-dimensional point processes with shared and unique structures.
method Joint estimation procedure for networks of high-dimensional point processes incorporating weights to encourage similarity.
result Powerful hierarchical multiple testing procedure for edges of all estimated networks, controlling family-wise error rate.

We propose a novel procedure for outlier detection in functional data, in a semi-supervised framework. As the data is functional, we consider the coefficients obtained after projecting the observations onto orthonormal bases (wavelet, PCA). A multiple testing procedure based on the two-sample test is defined in order t…

2017-12-13abs ↗pdf ↗

Gaussian graphical model is a graphical representation of the dependence structure for a Gaussian random vector. It is recognized as a powerful tool in different applied fields such as bioinformatics, error-control codes, speech language, information retrieval and others. Gaussian graphical model selection is a statist…

2017-01-09abs ↗pdf ↗

Max-rank improves multiple testing in conformal prediction.

problem Simultaneous testing of multiple hypotheses in scientific inquiries.
method Introduces max-rank, a novel correction for positive dependencies in simultaneous testing.
result Max-rank efficiently controls family-wise error rate and improves predictive uncertainty estimates.

We apply the procedure of Lee et al. to the problem of performing inference on the signal-noise ratio of the asset which displays maximum sample Sharpe ratio over a set of possibly correlated assets. We find a multivariate analogue of the commonly used approximate standard error of the Sharpe ratio to use in this condi…

2019-06-03abs ↗pdf ↗

Traditional voxel-level multiple testing procedures in neuroimaging, mostly pp-value based, often ignore the spatial correlations among neighboring voxels and thus suffer from substantial loss of power. We extend the local-significance-index based procedure originally developed for the hidden Markov chain models, whic…

2014-04-04abs ↗pdf ↗

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.

Multiple hypothesis testing, a situation when we wish to consider many hypotheses, is a core problem in statistical inference that arises in almost every scientific field. In this setting, controlling the false discovery rate (FDR), which is the expected proportion of type I error, is an important challenge for making …

2019-02-07abs ↗pdf ↗

aLTT selects hyperparameters efficiently with statistical guarantees.

problem Statistical validity and efficiency in hyperparameter selection.
method Sequential data-dependent multiple hypothesis testing with early termination.
result Reduces testing rounds while maintaining statistical validity.

Proposes a two-stage method for testing variable interactions with FDR control.

problem Testing pairwise interactions in high-dimensional data with dependence.
method Two-stage testing procedure with FDR control using Cramér type moderate deviation technique.
result The proposed method controls FDR and has comparable or improved statistical power.

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 ↗

Wide class of elliptically contoured distributions is a popular model of stock returns distribution. However the important question of adequacy of the model is open. There are some results which reject and approve such model. Such results are obtained by testing some properties of elliptical model for each pair of stoc…

2019-07-24abs ↗pdf ↗

New asymptotic e-values improve inference by eliminating data-dependent scaling inefficiency.

problem Data-dependent scaling inefficiency in existing asymptotic e-values.
method Drawing on Bentkus's near-optimal concentration inequalities, introduce Bentkus-type asymptotic e-values.
result Bentkus-type asymptotic e-values consistently deliver sharper inference than existing alternatives.

Temporal data are increasingly prevalent in modern data science. A fundamental question is whether two time series are related or not. Existing approaches often have limitations, such as relying on parametric assumptions, detecting only linear associations, and requiring multiple tests and corrections. While many non-p…

2019-08-18abs ↗pdf ↗

To improve the off-sample generalization of classical procedures minimizing the empirical risk under potentially heavy-tailed data, new robust learning algorithms have been proposed in recent years, with generalized median-of-means strategies being particularly salient. These procedures enjoy performance guarantees in …

2018-10-15abs ↗pdf ↗

A method selects candidates based on predictions with statistical control.

problem Screening candidates for resource-intensive steps like hiring or drug discovery.
method Wraps around any prediction model to produce a subset of candidates with controlled false selection rate.
result Empirically demonstrates selection of candidates whose predictions exceed a data-dependent threshold.

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.

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 ↗

Estimates target GGM using auxiliary studies with false discovery rate control.

problem Estimating high-dimensional GGMs from related studies.
method Transfer learning with Trans-CLIME and debiased Trans-CLIME estimators.
result Debiased Trans-CLIME estimator provides element-wise asymptotic normality and false discovery rate control.

In recent years, there has been considerable theoretical development regarding variable selection consistency of penalized regression techniques, such as the lasso. However, there has been relatively little work on quantifying the uncertainty in these selection procedures. In this paper, we propose a new method for inf…

2014-01-12abs ↗pdf ↗

In hypothesis testing, a false discovery occurs when a hypothesis is incorrectly rejected due to noise in the sample. When adaptively testing multiple hypotheses, the probability of a false discovery increases as more tests are performed. Thus the problem of False Discovery Rate (FDR) control is to find a procedure for…

2020-02-27abs ↗pdf ↗

Study proposes a statistical testing framework for evaluating clustering pipelines.

problem Quantifying the statistical reliability of clustering results from data analysis pipelines.
method Selective inference-based statistical testing framework for clustering pipelines.
result The proposed test controls the type I error rate and is effective in validating clustering results.

Identifying dependency in multivariate data is a common inference task that arises in numerous applications. However, existing nonparametric independence tests typically require computation that scales at least quadratically with the sample size, making it difficult to apply them to massive data. Moreover, resampling i…

2018-06-18abs ↗pdf ↗

Detect hidden confounding in observational data using multiple environments.

problem Detect hidden confounding in observational data.
method Theoretical framework and simulation studies to test for hidden confounding.
result The proposed procedure correctly predicts hidden confounding, especially when bias is large.

A new metric, Weighted Regret, unifies FDR and power evaluation in online multiple testing.

problem The asymmetric costs of false positives and false negatives in automated pipelines.
method Introducing Weighted Regret and Decoupled-OMT (DOMT) to unify FDR and power evaluation.
result DOMT achieves an order-optimal sublinear mitigation of threshold depletion in bursty environments.

Method selects valid IVs from a large set using clustering and test of overidentifying restrictions.

problem Selecting valid instrumental variables from a large set of candidates.
method Agglomerative hierarchical clustering combined with a test of overidentifying restrictions.
result Achieves oracle properties when the largest group of IVs is valid.

Bayesian model compares ML algorithms on various datasets.

problem Comparing multiple machine learning algorithms across multiple datasets.
method Bayesian Bradley-Terry model, defining regions of practical equivalence (ROPE).
result Allows nuanced statements and ROPE definitions for algorithm comparison.

Proposes a new method to control FDR using frequentist-assisted horseshoe for high-dimensional testing.

problem Designing tests with frequentist false discovery rate control using horseshoe prior.
method Frequentist-assisted horseshoe procedure for high-dimensional normal means testing.
result Consistently achieves robust finite-sample FDR control in various sparse cases.

We propose a linear-time, single-pass, top-down algorithm for multiple testing on directed acyclic graphs (DAGs), where nodes represent hypotheses and edges specify a partial ordering in which hypotheses must be tested. The procedure is guaranteed to reject a sub-DAG with bounded false discovery rate (FDR) while satisf…

2017-09-29abs ↗pdf ↗

PAIR-CI calibrates CI tests for causal discovery with incomplete data.

problem Miscalibration of CI tests when imputing incomplete data.
method Integrates multiple imputation directly into the inferential procedure via a paired permutation design.
result PAIR-CI reduces false positive rates to below 5% in simulations.