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

81162243324 · Jun 202019922001200920172026
48 results for simultaneous tests

We present an efficient algorithm for simultaneously training sparse generalized linear models across many related problems, which may arise from bootstrapping, cross-validation and nonparametric permutation testing. Our approach leverages the redundancies across problems to obtain significant computational improvement…

2013-07-31abs ↗pdf ↗

The problem of multiple hypothesis testing arises when there are more than one hypothesis to be tested simultaneously for statistical significance. This is a very common situation in many data mining applications. For instance, assessing simultaneously the significance of all frequent itemsets of a single dataset entai…

2009-06-29abs ↗pdf ↗

Unified framework for large-scale hypothesis testing with confounders.

problem Bias in large-scale hypothesis testing due to unmeasured confounders.
method Unified statistical estimation and inference framework that disentangles confounding effects and jointly estimates latent and primary effects.
result Effective Type-I error control and power in hypothesis testing.

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 ↗

New classifiers converge under large data, simplifying complex models.

problem Complex predictive models under large datasets.
method Convergence of simultaneous and marginal classifiers under partition exchangeability.
result Asymptotic convergence of classifiers with large data reduces computational complexity.

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.

This article studies local and global inference for smoothing spline estimation in a unified asymptotic framework. We first introduce a new technical tool called functional Bahadur representation, which significantly generalizes the traditional Bahadur representation in parametric models, that is, Bahadur [Ann. Inst. S…

2012-12-30abs ↗pdf ↗

New method identifies structural parameters without assuming uncorrelated errors.

problem Identifying structural parameters in simultaneous equation models.
method Exploits higher-order cumulant restrictions, not requiring uncorrelated errors.
result Simple diagonality condition on hhth-order cumulants identifies structural parameter matrix.

We propose two nonparametric statistical tests of goodness of fit for conditional distributions: given a conditional probability density function p(yx)p(y|x) and a joint sample, decide whether the sample is drawn from p(yx)rx(x)p(y|x)r_x(x) for some density rxr_x. Our tests, formulated with a Stein operator, can be applied to any…

2020-02-24abs ↗pdf ↗

Two statistical tasks are shown to have equivalent sample complexity.

problem Determining if a function depends on only a few variables and identifying those variables.
method Proved statistical equivalence of feature selection and junta testing through sample complexity analysis.
result Brute-force algorithm is sample-optimal for both tasks with optimal sample size.

The paper provides high-probability bounds on false discovery proportions in conformal inference.

problem Existing methods fail to provide high-probability bounds on the realized false discovery proportion.
method Constructing a high-probability envelope for the empirical distribution function of null conformal p-values by sampling from their joint distribution.
result Establishes finite-sample, distribution-free upper bounds on the FDP that hold simultaneously over all possible rejection thresholds.

We consider a process XtX_t, which is observed on a finite time interval [0,T][0,T], at discrete times 0,Δn,2Δn,.0,Δ_n,2Δ_n,\ldots. This process is an Itô semimartingale with stochastic volatility σt2σ_t^2. Assuming that XX has jumps on [0,T][0,T], we derive tests to decide whether the volatility process has jumps occurring simultan…

2010-10-21abs ↗pdf ↗

A distributed bootstrap method for high-dimensional data reduces communication rounds efficiently.

problem Simultaneous inference on massive, high-dimensional data stored across many machines.
method Distributed bootstrap based on de-biased lasso with efficient cross-validation tuning.
result Theoretical lower bound on communication rounds τminτ_{\min} for statistical accuracy and efficiency.

Develops model selection for bandits balancing adversarial and stochastic guarantees.

problem Model selection in bandit scenarios with simultaneous adversarial and stochastic high-probability regret.
method Nested policy classes, balanced candidate regret bounds, mis-specification tests.
result Best of both world guarantees in linear bandits with simultaneous adversarial and stochastic environments.

New exact tests detect changepoints in binary and count data, especially when normal approximations fail.

problem Detecting changepoints in multichannel binary and count data.
method Exact tests combining two-sample conditional tests with multiplicity correction.
result Exact tests are much more powerful than asymptotic tests in various settings.

Natural and social multivariate systems are commonly studied through sets of simultaneous and time-spaced measurements of the observables that drive their dynamics, i.e., through sets of time series. Typically, this is done via hypothesis testing: the statistical properties of the empirical time series are tested again…

2019-07-01abs ↗pdf ↗

Proposes a method to calibrate data for more accurate linear correlation testing.

problem Inaccurate Pearson's correlation coefficient due to sample size and data non-normality.
method Predictive data calibration using machine learning to condition data on expected linear relationship.
result Calibrated Pearson's correlation coefficient yields a calibrated p-value and r estimate for posterior probability interpretation.

The use of deep networks to extract embeddings for speaker recognition has proven successfully. However, such embeddings are susceptible to performance degradation due to the mismatches among the training, enrollment, and test conditions. In this work, we propose an adversarial speaker verification (ASV) scheme to lear…

2019-04-29abs ↗pdf ↗

System tackles indeterminacies in automated audio captioning.

problem Word selection and sentence length indeterminacies in automated audio captioning.
method Solves caption generation and sub-indeterminacy problems through multi-task learning to estimate keywords and sentence length.
result Model achieved 20.7 SPIDEr score, significantly outperforming baseline.

Implicit models can match or exceed explicit models with more test-time compute.

problem Understanding the expressive power and scaling of implicit models.
method Nonparametric analysis of expressive power, mathematical characterization of implicit operators, and test-time scaling experiments.
result Implicit models can progressively express more complex mappings through iteration, matching a richer function class with test-time compute.

A goodness-of-fit test for DCSBM improves scalability and power for large sparse networks.

problem Testing goodness-of-fit for degree-corrected stochastic block models (DCSBM) in large sparse networks.
method Proposes an adjusted chi-square test statistic for multinomial distributions, adjusted for degree-corrected networks, and applies it to compressed adjacency matrices.
result The test statistic converges in distribution under null, and is consistent in recovering the number of communities.

We present a generalization of the Simultaneous Long-Short (SLS) trading strategy described in recent control literature wherein we allow for different parameters across the short and long sides of the controller; we refer to this new strategy as Generalized SLS (GSLS). Furthermore, we investigate the conditions under …

2018-06-14abs ↗pdf ↗

Framework calibrates ML models for risk control in various tasks.

problem Achieving statistical guarantees for model predictions.
method Reframing risk control as multiple hypothesis testing, applying statistical techniques.
result New calibration methods for multi-label classification, instance segmentation, outlier detection, and confidence set coverage.

A PID-based feedback-control system improves multiple KPIs in RTB display advertising.

problem Challenges in simultaneously improving multiple KPIs in RTB campaigns.
method Sequential Control using PID-based feedback and importance metrics.
result Effective in simultaneously controlling multiple KPIs in both simulations and live traffic.

Regression-via-Classification (RvC) is the process of converting a regression problem to a classification one. Current approaches for RvC use ad-hoc discretization strategies and are suboptimal. We propose a neural regression tree model for RvC. In this model, we employ a joint optimization framework where we learn opt…

2018-10-01abs ↗pdf ↗

A method for rank verification in multivariate Gaussian data, improving on existing approaches.

problem Determining the top KK means in multivariate Gaussian data with any covariance structure.
method Selective inference tools to generalize the two-sided difference-of-means test for any KK and covariance structure.
result The method provides a generalization for rank verification in multivariate Gaussian data with any covariance structure.

This paper studies the problem of learning with augmented classes (LAC), where augmented classes unobserved in the training data might emerge in the testing phase. Previous studies generally attempt to discover augmented classes by exploiting geometric properties, achieving inspiring empirical performance yet lacking t…

2019-10-21abs ↗pdf ↗

Transformer RL optimizes A/B testing for time series experiments.

problem Challenges in applying A/B testing to time series experiments, especially with limited history and strong assumptions.
method Transformer reinforcement learning approach that conditions allocation on full history and optimizes MSE without restrictive assumptions.
result Consistently outperforms existing designs in synthetic, simulator, and real-world data.

The continually increasing number of complex datasets each year necessitates ever improving machine learning methods for robust and accurate categorization of these data. This paper introduces Random Multimodel Deep Learning (RMDL): a new ensemble, deep learning approach for classification. Deep learning models have ac…

2018-05-03abs ↗pdf ↗