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

4.1%8.1%12.2%16.3% · May 202619922001200920172026
48 results for sequential hypothesis testing

New private algorithm for sequential hypothesis testing with privacy and error rate guarantees.

problem Privacy protection in sequential hypothesis testing for sensitive data.
method Renyi differential privacy, Wald's Sequential Probability Ratio Test (SPRT).
result Private algorithm with strong privacy guarantees and theoretical performance analysis.

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.

Paper resolves open problems on sample complexity in binary hypothesis testing.

problem Open problems in distributed simple binary hypothesis testing under information constraints.
method One-shot lower bound on Bayes error, streamlined sample complexity formula, reverse data-processing inequality.
result Optimally tight sample complexity bounds for communication-constrained simple binary hypothesis testing.

Optimal tests developed for sequential experiments with asymptotic properties.

problem Performing hypothesis tests after sequential experiments without prior design.
method Analyze asymptotic properties of sequential experiments; develop tests for Gaussian process observations.
result Asymptotic power function of any test can be matched by a specific test in a limit experiment.

Improved sequential tests detect anomalies faster in multi-stream auditing.

problem Efficiently auditing machine learning systems across multiple data streams.
method Developed new sequential tests using merging martingales and averaging/products rules.
result Balanced tests achieve optimal stopping times in sparse and dense alternatives.

Sequential tests for two-sample and independence testing using betting strategies.

problem Testing sequential data for two-sample and independence without kernel selection issues.
method Prediction-based betting strategies that adaptively determine distribution and joint distribution.
result Prediction-based tests outperform kernel-based approaches in high-dimensional or structured data settings.

We study the power of interactivity in local differential privacy. First, we focus on the difference between fully interactive and sequentially interactive protocols. Sequentially interactive protocols may query users adaptively in sequence, but they cannot return to previously queried users. The vast majority of exist…

2019-04-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.

We propose a new algorithmic framework for sequential hypothesis testing with i.i.d. data, which includes A/B testing, nonparametric two-sample testing, and independence testing as special cases. It is novel in several ways: (a) it takes linear time and constant space to compute on the fly, (b) it has the same power gu…

2015-06-10abs ↗pdf ↗

Motivated by real-world machine learning applications, we consider a statistical classification task in a sequential setting where test samples arrive sequentially. In addition, the generating distributions are unknown and only a set of empirically sampled sequences are available to a decision maker. The decision maker…

2019-12-03abs ↗pdf ↗

E-valuator converts verifier scores into reliable decision rules.

problem Ensuring the correctness of agent trajectories based on heuristic scores.
method Sequential hypothesis testing framework for online monitoring of agent trajectories.
result E-valuator provides better false alarm rate control and statistical power than other strategies.

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 ↗

Hypothesis testing is an important problem with applications in target localization, clinical trials etc. Many active hypothesis testing strategies operate in two phases: an exploration phase and a verification phase. In the exploration phase, selection of experiments is such that a moderate level of confidence on the …

2018-12-04abs ↗pdf ↗

Formula derived for sample complexity in binary hypothesis testing.

problem Determine the minimum number of samples to distinguish between two distributions.
method Developed a formula for sample complexity in both prior-free and Bayesian settings, using Jensen-Shannon and Hellinger divergences.
result Formula characterizes sample complexity for a wide range of error parameters, up to multiplicative constants.

A new stopping rule based on E-values helps efficiently use sampling in Bayesian Deep Ensembles.

problem How long should sampling continue in Bayesian Deep Ensembles to yield significant improvements?
method Formulated as a sequential anytime-valid hypothesis test, using E-values to decide when to stop sampling.
result Only a fraction of the full-chain budget is often required for significant improvements.

The paper presents a method for detecting jump sizes in crude oil prices.

problem Detecting jump sizes in crude oil price data.
method Sequential hypothesis testing using infinitesimal generators and super-solutions.
result The method improves the Barndorff-Nielsen and Shephard model for derivative and commodity market analysis.

This paper shows how to construct sequential tests with power one against weakly compact sets in Polish spaces.

problem Testing composite null hypotheses involving weakly compact sets in Polish spaces.
method Develops sequential tests for i.i.d. laws in Polish spaces, providing a sufficient condition for power one.
result Power-one sequential tests exist for weakly compact sets against their complements in i.i.d. laws in Polish spaces.

EviTrack improves sequential prediction in delayed disambiguation scenarios.

problem Challenges in sequential prediction with delayed disambiguation where early observations are ambiguous.
method EviTrack operates over latent trajectories, applying evidence- and likelihood-ratio-based selection to delay commitment until supported by data.
result EviTrack outperforms sampling-based baselines in a controlled synthetic benchmark, achieving faster post-disambiguation recovery.

A new method reduces computational costs for testing RF variable importance measures.

problem Testing variable importance measures from random forests is computationally expensive and challenging.
method Sequential permutation testing and sequential p-value estimation to reduce computational costs.
result Theoretical properties of sequential tests are confirmed, maintaining type-I error and high power.

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 ↗

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.

The paper proposes an efficient method for estimating ATEs using adaptive experiments.

problem Estimating average treatment effects (ATEs) with minimal sample size and high accuracy.
method The paper defines and uses the efficient treatment-assignment probability to sequentially assign treatments, estimating ATEs using an Adaptive Augmented Inverse Probability Weighting (A2IPW) estimator.
result The proposed experimental design and A2IPW estimator achieve the minimized semiparametric efficiency bound and provide anytime valid confidence intervals for early stopping.

New algorithm for efficiently identifying the best arm in stochastic bandits.

problem Best arm identification in stochastic multi-armed bandits with fixed confidence.
method Sequential probability ratio tests for arm selection.
result Asymptotically optimal sample complexity and guaranteed δδ-PAC performance.

Sequential hypothesis testing is a desirable decision making strategy in any time sensitive scenario. Compared with fixed sample-size testing, sequential testing is capable of achieving identical probability of error requirements using less samples in average. For a binary detection problem, it is well known that for k…

2015-08-31abs ↗pdf ↗

The problem of multi-hypothesis testing with controlled sensing of observations is considered. The distribution of observations collected under each control is assumed to follow a single-parameter exponential family distribution. The goal is to design a policy to find the true hypothesis with minimum expected delay whi…

2019-10-24abs ↗pdf ↗

We study "active" decision making over sensor networks where the sensors' sequential probing actions are actively chosen by continuously learning from past observations. We consider two network settings: with and without central coordination. In the first case, the network nodes interact with each other through a centr…

2018-09-12abs ↗pdf ↗

Study online monotone density estimation with expert aggregation and log-optimal calibration.

problem Online monotone density estimation and log-optimal calibration.
method Proposed two online estimators: Grenander estimator and expert aggregation estimator.
result Online estimators achieve O(n1/3)O(n^{1/3}) cumulative log-likelihood gap and nlogn\sqrt{n\log{n}} pathwise regret bound.

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 ↗

Proposes real-time risk monitoring for machine learning systems under unknown shifts.

problem Dynamic distribution shifts challenge real-world machine learning systems' risk assurances.
method Sequential hypothesis testing with 'testing by betting' to detect risk violations.
result Effective real-time risk monitoring under various unknown shifts.

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.

In sequential anytime-valid inference, any admissible procedure must be based on e-processes: generalizations of test martingales that quantify the accumulated evidence against a composite null hypothesis at any stopping time. This paper proposes a method for combining e-processes constructed in different filtrations b…

2024-02-15abs ↗pdf ↗

Testing-by-betting strategies almost surely go bankrupt under null hypotheses.

problem Understanding the behavior of betting strategies under null hypotheses.
method Analyzed the asymptotics of betting strategies under null distributions, focusing on the almost sure divergence of sums.
result Testing-by-betting strategies go bankrupt with probability one under any non-degenerate null distribution.

The paper sets thresholds for testing correlation in hypergraphs, distinguishing between independent and correlated states.

problem Testing correlation between two hypergraphs under different models.
method Derives sharp information-theoretic thresholds for distinguishing between null and alternative hypotheses.
result The testing threshold decreases as the hypergraph's uniformity (m) increases, making correlation testing easier for higher uniformity.

Study robust hypothesis testing under Hellinger distance, proving lower bounds and providing tests.

problem Testing close variants of specified distributions robustly to Hellinger distance.
method Lower bound on slack factor, testing with Hellinger balls, symmetric chi-squared distance analysis.
result Lower bound on slack factor quantifies robustness under misspecification.

This work tackles asymmetric community estimation in multi-layer directed networks.

problem Estimating different numbers of sender and receiver communities in multi-layer directed networks.
method Proposes a goodness-of-fit test based on the largest singular value of an aggregated normalized residual matrix.
result Develops sequential and ratio-based testing procedures to consistently determine true sender and receiver community numbers.

Can we make Bayesian posterior MCMC sampling more efficient when faced with very large datasets? We argue that computing the likelihood for N datapoints in the Metropolis-Hastings (MH) test to reach a single binary decision is computationally inefficient. We introduce an approximate MH rule based on a sequential hypoth…

2013-04-19abs ↗pdf ↗

Study hypothesis testing under quantized samples with communication constraints, achieving near-optimal sample complexity.

problem Optimizing hypothesis testing with quantized samples and communication constraints.
method Developed a polynomial-time algorithm achieving near-optimal sample complexity under communication constraints.
result Achieved near-optimal sample complexity under communication constraints, with a logarithmic factor increase over unconstrained setting.