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.

169,051 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · May 199319922001200920172026
48 results for Likelihood Ratio

Study shows how to reduce variational inference bias by concentrating likelihood ratio distribution.

problem Bias and variance issues in variational inference.
method Upper bound variational gap using dispersion measure of likelihood ratio, suggesting methods to reduce bias.
result Reducing bias in variational inference can be achieved by making likelihood ratio distribution more concentrated.

Novel neural likelihood ratio estimation for negative data in particle physics.

problem Estimating likelihood ratios with negative probability densities and weights.
method Introducing a novel loss function and a new model architecture based on signed mixture models.
result Demonstrated improved estimation on a real-world example from particle physics.

Deep learning compresses and quantizes log-likelihood ratios for fading channels.

problem Efficiently compress and quantize log-likelihood ratios for fading channels.
method Trains a deep autoencoder network to map log-likelihood ratios to a latent space and reconstruct them.
result Achieves a compression factor of nearly three times with minimal performance loss.

New machine learning methods for inference from simulated data.

problem Modeling score and likelihood ratio functions from sampled data.
method InferoStatic Networks (ISN), Kernel Score Estimation (KSE), Kernel Likelihood Ratio Estimation (KLRE).
result Improved inference methods for complex models.

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.

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.

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.

Optimally tackles covariate shift in RKHS-based nonparametric regression.

problem Covariate shift in nonparametric regression over RKHS.
method Two families of covariate shift problems defined using likelihood ratios. Minimax rate-optimal estimators for KRR and reweighted KRR.
result KRR is minimax rate-optimal and strictly sub-optimal compared to naive estimator under covariate shift.

Bayesian optimization improves by focusing on outputs with the likelihood ratio method.

problem Improving Bayesian optimization by accurately estimating output importance.
method Importance-sampling theory and likelihood ratio for guiding search towards low objective function values.
result Likelihood-weighted acquisition functions outperform unweighted ones in various applications.

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.

DeepLR constructs confidence intervals for neural networks with asymmetric expansions.

problem Uncertainty estimation for neural network predictions.
method Likelihood-ratio-based approach for constructing asymmetric confidence intervals.
result DeepLR offers asymmetric intervals expanding in regions with limited data.

Unified view of KL-divergence and IPMs via DRE, with new DRM metrics.

problem Unified understanding of KL-divergence and IPMs.
method Unified representation via maximum likelihood density-ratio estimation (DRE).
result Unified form of IPMs and novel DRM metrics.

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.

The paper proposes an efficient nested simulation design using likelihood ratio method.

problem Designing nested simulations with fixed outer scenarios and minimizing simulation effort.
method Proposes a bi-level optimization problem to decide inner replications and pooling strategies.
result Optimized design achieves $\cO(Γ^{-1})$ mean squared error of estimators.

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.

wd1 improves reasoning in dLLMs by optimizing policies without policy ratios.

problem Improving reasoning in diffusion-based large language models through RL.
method wd1: ratio-free policy optimization using weighted log-likelihood.
result wd1 outperforms diffusion-based GRPO while requiring lower computational cost.

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 ↗

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.

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.

New method improves neural network robustness with brain-like learning.

problem Traditional methods struggle with robustness in adversarial attacks.
method Generalized likelihood ratio method with brain-like learning mechanisms.
result Significant improvement in robustness of neural networks.

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.

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.

Proposes a conservative LR estimator for infrequent data near a frequency threshold.

problem Overestimation of likelihood ratios for infrequent data near a frequency threshold.
method Conservative likelihood ratio estimator for frequencies slightly above a threshold.
result Improves prediction accuracy in named entity context prediction.

A new method improves text generation quality and diversity.

problem Exposure bias in Maximum Likelihood Estimation for text generation.
method ψ-MLE, a new training scheme based on density ratio estimation.
result ψ-MLE outperforms Maximum Likelihood Estimation and other models in text generation quality and diversity.

A new method optimizes diffusion models with recursive likelihood ratios.

problem Efficiently aligning pre-trained diffusion models for specific applications.
method Recursive Likelihood Ratio (RLR) optimizer for Half-Order (HO) fine-tuning.
result The RLR method achieves unbiased and lower-variance gradients, improving model performance.

New method for valid prediction sets in high-dimensional covariate shifts.

problem Valid prediction sets in high-dimensional covariate shifts.
method Likelihood-ratio regularized quantile regression (LR-QR) algorithm.
result LR-QR constructs valid prediction sets with desired coverage in target domain.

Unified view of LR and RP gradients with improved importance sampling.

problem Understanding and optimizing gradient estimators in machine learning.
method First principles explanation of LR and RP, divergence theorem, optimal importance sampling schemes.
result Optimal importance sampling schemes derived with analytic probability densities.

Corrects bias in learned generative models using likelihood-free importance weighting.

problem Bias in learned generative models relative to true data distribution.
method Estimate likelihood ratio using a classifier, apply importance weighting.
result Consistently improves goodness-of-fit metrics for deep generative models.

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 ↗

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.

New method estimates hazard ratios without bias in observational studies.

problem Uninterpretable hazard ratios due to unspecified baseline hazard.
method Kernel-based machine learning to model risk set changes.
result Debiased maximum-likelihood estimators identify true hazard ratios.

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.

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 ↗