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

114228342456 · Jun 202019922001200920172026
48 results for sequential likelihood ratio test

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 ↗

SPRT-TANDEM improves sequential classification accuracy with fewer samples.

problem Efficiently classifying sequential data with high accuracy and low sampling cost.
method Deep neural network-based SPRT algorithm that estimates log-likelihood ratio of two hypotheses.
result SPRT-TANDEM achieves statistically significantly better classification accuracy than other classifiers with fewer samples.

We propose a general method for constructing hypothesis tests and confidence sets that have finite sample guarantees without regularity conditions. We refer to such procedures as "universal." The method is very simple and is based on a modified version of the usual likelihood ratio statistic, that we call "the split li…

2019-12-24abs ↗pdf ↗

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.

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 ↗

The paper proposes a method to construct confidence sets using likelihood ratios for sequential decision-making.

problem Constructing valid uncertainty estimates for unknown quantities in sequential decision-making.
method The method uses likelihood ratios to create any-time valid confidence sequences without specialized treatment for each application.
result The proposed confidence sets maintain the prescribed coverage in a model-agnostic manner and their size depends on the choice of estimator sequence.

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.

Model change points in time-series data with neural SDEs and variational autoencoders.

problem Modeling change points in time-series data with neural stochastic differential equations.
method Proposes a novel model formulation and training procedure based on the variational autoencoder framework, alternating between updating neural SDE parameters and change points.
result Demonstrates the expressive power of the proposed model in modeling both classical parametric SDEs and real datasets with distribution shifts.

New method uses path signatures for efficient likelihood estimation in time-series data.

problem Intractable likelihood functions in complex dynamic models.
method Kernel classifier based on path signatures for sequential data.
result Path signatures yield highly performant classifiers, even with low sample numbers.

This paper presents a sequential method to identify the topological ordering of causal DAGs using likelihood ratio scores.

problem Identifying the causal relationships in a data mining scenario with ambiguity of causal directions.
method A general sequential sorting procedure that orders variables one at a time, starting at root nodes, followed by children of the root nodes, and so on until completion. Simple likelihood ratio scores are used to decide the next node to append to the current partial ordering.
result The population version of the procedure provably identifies a true ordering of the underlying DAG under mild assumptions.

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.

A novel kernel-based test detects equality versus singularity of two probability measures.

problem Detecting equality versus singularity of two probability distributions.
method Combines kernel mean and kernel covariance embeddings to construct a likelihood ratio test statistic.
result The test statistic satisfies a '0/\infty' law, vanishing under the null and diverging under the alternative.

A flexible nonparametric online changepoint detection algorithm for high-frequency data.

problem Detecting changes in real-time in high-frequency data streams with limited computational resources.
method NP-FOCuS, a sequential likelihood ratio test for a change in the empirical cumulative density function, using functional pruning.
result NP-FOCuS outperforms current nonparametric online changepoint techniques in various settings.

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.

Optimal selective classification using likelihood ratios improves model reliability.

problem Enhancing predictive model reliability by allowing uncertain predictions.
method Neyman--Pearson lemma applied to likelihood ratios for optimal selection.
result Neyman--Pearson-informed methods outperform existing baselines under covariate shifts.

Novel framework optimizes experiments for implicit models using mutual information.

problem Optimizing experiments for intractable implicit models.
method Sequential Bayesian Experimental Design using Mutual Information.
result Framework efficiently estimates parameters with few iterations.

This paper develops embeddings that preserve likelihood-based statistical inference.

problem Modern machine learning embeddings destroy the geometric structure required for likelihood-based inference.
method Developed a rigorous theory of likelihood-preserving embeddings and introduced the Likelihood-Ratio Distortion metric.
result Controlling the distortion ΔnΔ_n is necessary and sufficient for preserving inference.

A new algorithm detects changes in data with constant cost per iteration.

problem Detecting changes in data with low computational cost.
method Adapting pruning and maximisation techniques from Gaussian data to exponential family models.
result The algorithm can detect changes in a wide range of models with a constant per-iteration cost.

Extends likelihood ratio exponential families to analyze various optimization methods.

problem Analyzing optimization methods like rate-distortion and information bottleneck.
method Linking geometric mixture paths to exponential families and using hypothesis testing.
result Provides a common mathematical framework for understanding these methods.

A test for neural networks identifies genetic associations.

problem Testing complex associations in neural networks.
method Sieve quasi-likelihood ratio test for neural networks with one hidden layer.
result The test statistic has an asymptotic chi-squared distribution.

Efficient tests achieve best error rates in high-dimensional hypothesis testing.

problem Achieving optimal error rates in computationally efficient hypothesis testing.
method Linear spectral statistics and low-degree likelihood ratio analysis.
result An efficient test achieves the best possible error rates among all computationally efficient tests.

Markov regime switching models have been used in numerous empirical studies in economics and finance. However, the asymptotic distribution of the likelihood ratio test statistic for testing the number of regimes in Markov regime switching models has been an unresolved problem. This paper derives the asymptotic distribu…

2018-01-21abs ↗pdf ↗

FF algorithm uses goodness as a likelihood-ratio test for scalar normalization.

problem Training each layer locally with scalar goodness.
method FF algorithm uses a likelihood-ratio test with squared goodness as the sufficient statistic.
result The FF algorithm generalizes to anisotropic and heavy-tailed populations.

Study detects signals in spiked Wigner models using log likelihood ratio.

problem Detecting signals in rank-one spiked Wigner models with non-Gaussian noise.
method Proved asymptotic normality of log likelihood ratio and computed error thresholds.
result Optimal signal-to-noise ratio threshold for reliable detection.

FF algorithm uses goodness as a measure of input quality, derived from likelihood-ratio tests.

problem Training each layer locally with a goodness measure.
method FF algorithm uses a likelihood-ratio test to define goodness, which is the sum of squared activations normalized between layers.
result The goodness measure is a sufficient statistic for a likelihood-ratio test, explaining the FF algorithm's performance.

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 ↗

The paper analyzes a private likelihood-ratio test for frequency tables under differential privacy constraints.

problem Achieving privacy in statistical data analysis while maintaining statistical utility.
method A rigorous analysis of a private likelihood-ratio (LR) test for goodness-of-fit in frequency tables, considering (ε,δ)(\varepsilon,δ)-differential privacy.
result Characterization of the trade-off between differential privacy parameters (ε,δ)(\varepsilon,δ) and statistical power of the private LR test.

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.

Study benchmarks TSC algorithms in distinguishing diffusions using the likelihood ratio test.

problem Benchmarking optimality of TSC algorithms in distinguishing diffusion processes.
method Proposes to benchmark TSC algorithms using the likelihood ratio test (LRT).
result LRT benchmarks are computationally efficient and can be applied to various time series types.

Various problems in Engineering and Statistics require the computation of the likelihood ratio function of two probability densities. In classical approaches the two densities are assumed known or to belong to some known parametric family. In a data-driven version we replace this requirement with the availability of da…

2019-11-01abs ↗pdf ↗

SNVI combines likelihood estimation with variational inference for efficient Bayesian inference.

problem Bayesian inference in models with intractable likelihoods.
method Sequential Neural Variational Inference (SNVI) that combines likelihood-estimation with variational inference.
result SNVI is more computationally efficient than previous algorithms without sacrificing accuracy.

ACORE improves hypothesis testing and confidence sets in likelihood-free inference.

problem Constructing hypothesis tests and confidence sets in likelihood-free inference settings.
method Formulates classical LRT as a classification problem, uses machine learning to improve estimates.
result Demonstrates improved accuracy in hypothesis testing and confidence sets.

Develops GLRT for defending against adversarial attacks in hypothesis testing.

problem Adversarial attacks on machine learning models causing misclassification.
method Generalized likelihood ratio test applied to composite hypothesis testing problem.
result GLRT approach yields competitive robustness-accuracy tradeoff under various attacks.

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.

Hidden Markov models and their variants are the predominant sequential classification method in such domains as speech recognition, bioinformatics and natural language processing. Being generative rather than discriminative models, however, their classification performance is a drawback. In this paper we apply ideas fr…

2013-02-15abs ↗pdf ↗

Near-optimal tests and confidence sequences for non-parametric data.

problem Flexible statistical inference and decision-making with non-parametric data.
method Classic delayed-start normal-mixture sequential probability ratio tests with asymptotic guarantees.
result Asymptotically optimal type-I error and expected rejection time guarantees.

The paper optimizes designs for distinguishing between Gaussian process models.

problem Discriminating between two Gaussian process models.
method Sequential and static design criteria, including Kullback Leibler divergences and log-likelihood ratios.
result Necessary conditions for optimal design measures are provided.

PD curve calibration refers to the transformation of a set of rating grade level probabilities of default (PDs) to another average PD level that is determined by a change of the underlying portfolio-wide PD. This paper presents a framework that allows to explore a variety of calibration approaches and the conditions un…

2012-12-15abs ↗pdf ↗

The ratio of two probability densities can be used for solving various machine learning tasks such as covariate shift adaptation (importance sampling), outlier detection (likelihood-ratio test), and feature selection (mutual information). Recently, several methods of directly estimating the density ratio have been deve…

2009-12-15abs ↗pdf ↗