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

Trend · papers per month

93185278370 · Jun 202019922001200920172026
48 results for likelihood measure

Quantum machine learning uses quantum cross entropy to minimize loss, but measurement loss affects this process.

problem Quantum machine learning's loss minimization through cross entropy is affected by measurement outcomes.
method Defined quantum cross entropy, proved its lower bounds, and investigated its relation to quantum fidelity and likelihood.
result Quantum cross entropy is lower-bounded by negative log-likelihood when derived from quantum data, but measurement outcomes can cause loss.

Paper proposes an optimistic likelihood approximation for nonparametric likelihoods.

problem Computational intractability of evaluating likelihood functions in Bayesian statistics.
method Non-parametric approximation using distributionally robust optimization.
result Optimistic likelihood can be solved as a convex optimization problem with analytical expressions.

DAPS++ improves diffusion-based image restoration by decoupling prior and likelihood.

problem Decoupling prior and likelihood in diffusion-based inverse problems for better performance.
method Introducing DAPS++, which separates diffusion initialization from likelihood refinement.
result DAPS++ achieves high computational efficiency and robust reconstruction performance.

DAPS++ improves diffusion-based image restoration by decoupling prior and likelihood.

problem Decoupling prior and likelihood in diffusion-based inverse problems.
method Introducing DAPS++, which fully decouples diffusion-based initialization from likelihood-driven refinement.
result Achieves high computational efficiency and robust reconstruction performance.

A new metric for detecting out-of-distribution samples using neural rendering models.

problem Difficulty in detecting out-of-distribution samples with existing deep generative models.
method Derive metrics for out-of-distribution detection using a neural rendering model.
result Lower likelihood of latent variables is assigned to out-of-distribution samples.

We define a generalized likelihood function based on uncertainty measures and show that maximizing such a likelihood function for different measures induces different types of classifiers. In the probabilistic framework, we obtain classifiers that optimize the cross-entropy function. In the possibilistic framework, we …

2013-01-16abs ↗pdf ↗

Measures neural network complexity via effective degrees of freedom.

problem Challenges in quantifying neural network complexity.
method Adapts generalized degrees of freedom (GDF) for binary outcomes and compares with cross-validation and null degrees of freedom.
result GDF provides a robust measure of model complexity for 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.

We extend Bayes' theorem for upper probabilities considering likelihood uncertainty.

problem Addressing uncertainty in likelihood for upper probability bounds.
method Generalization of Wasserman and Kadane's result, considering both prior and likelihood uncertainty.
result A sufficient condition for the upper bound to become an equality.

Method recovers complex-valued signals from speckle-noised measurements.

problem Recovering complex-valued signals from speckle-noised measurements.
method Bagged Deep Image Priors integrated with projected gradient descent and Newton-Schulz algorithm.
result Achieves state-of-the-art performance in MSE reduction.

In this note, we study the relationship between the variational gap and the variance of the (log) likelihood ratio. We show that the gap can be upper bounded by some form of dispersion measure of the likelihood ratio, which suggests the bias of variational inference can be reduced by making the distribution of the like…

2019-06-09abs ↗pdf ↗

New method for conditional sampling using M-GANs, likely-free inference.

problem Conditional sampling of probability measures.
method Developed a novel computational approach called M-GANs based on block triangular transport.
result Accurate sampling of conditional measures in various applications.

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.

DALTON improves ODE parameter estimation by learning from noisy data.

problem High sensitivity to parameters in ODEs produces unreliable parameter estimates.
method Data-adaptive probabilistic likelihood approximation for ODEs.
result DALTON produces more accurate parameter estimates than existing methods.

Study of maximum likelihood under biased constraints reveals novel degeneracies and anomalous statistical behavior.

problem Investigating maximum likelihood under biased estimating equations.
method Analyzing the behavior of optimal distributions and log-likelihood statistics under mis-specification.
result Degeneracies in optimal distributions and anomalous behavior of log-likelihood statistics under mis-specification.

Gaussian process regression helps approximate Bayesian inverse problems efficiently.

problem Computational intractability of Bayesian posterior distributions in inverse problems.
method Gaussian process regression to build a surrogate model for the likelihood.
result Error between true and approximate posterior can be bounded by weighted L2L^2-norm error between true and approximate likelihood.

C-DPS improves diffusion posterior sampling for inverse problems without projection or likelihood approximation.

problem Inaccurate and unstable solutions in inverse problems due to complex or high-noise conditions.
method C-DPS introduces a forward stochastic process in measurement space evolving in parallel with data-space diffusion, leading to a closed-form posterior.
result C-DPS consistently outperforms existing methods across multiple inverse problem benchmarks.

For localization and mapping of indoor environments through WiFi signals, locations are often represented as likelihoods of the received signal strength indicator. In this work we compare various measures of distance between such likelihoods in combination with different methods for estimation and representation. In pa…

2018-09-19abs ↗pdf ↗

The maximum likelihood approach is adapted to the problem of estimation of drift and diffusion functions of stochastic processes from measured time series. We reconcile a previously devised iterative procedure [Kleinhans et al., Physics Letters A (346), 2005] and put the application of the method on a firm theoretical …

2006-11-10abs ↗pdf ↗

New CTRL algorithm adapts to varying problem difficulty.

problem Adapting to varying levels of problem difficulty in CTRL.
method MLE with a general function approximator, estimating state marginal density.
result Regret bound scales with reward variance and measurement resolution, independent of measurement strategy.

The Restricted Boltzmann Machines (RBM) can be used either as classifiers or as generative models. The quality of the generative RBM is measured through the average log-likelihood on test data. Due to the high computational complexity of evaluating the partition function, exact calculation of test log-likelihood is ver…

2015-10-08abs ↗pdf ↗

One major challenge for the legacy measurements at the LHC is that the likelihood function is not tractable when the collected data is high-dimensional and the detector response has to be modeled. We review how different analysis strategies solve this issue, including the traditional histogram approach used in most par…

2019-06-04abs ↗pdf ↗

Paper examines stability of Bayesian posterior measures using integral probability metrics.

problem Stability of Bayesian inference in large-scale inverse problems.
method New families of integral probability metrics for likelihood and prior perturbations.
result Constructs new stability results for Bayesian posterior measures.

A new ensemble learning method called Residual Likelihood Forests improves performance and reduces model size.

problem Improving machine learning classification performance with compact models.
method Sequential optimization of conditional likelihoods in a boosting-like framework, combining multiplicatively.
result Significant performance improvements and reduced model size compared to other ensemble methods.

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.

Posterior inference with an intractable likelihood is becoming an increasingly common task in scientific domains which rely on sophisticated computer simulations. Typically, these forward models do not admit tractable densities forcing practitioners to make use of approximations. This work introduces a novel approach t…

2019-03-10abs ↗pdf ↗

Bayesian calibration for BCP self-assembly models using image data and measure transport.

problem Calibrating models of BCP self-assembly from image data with aleatory uncertainty.
method Likelihood-free inference via measure transport and summary statistics.
result Expected information gains can be computed efficiently for model calibration.

Machine learning models encounter Out-of-Distribution (OoD) errors when the data seen at test time are generated from a different stochastic generator than the one used to generate the training data. One proposal to scale OoD detection to high-dimensional data is to learn a tractable likelihood approximation of the tra…

2018-10-02abs ↗pdf ↗

PUMA interprets metabolomics data to predict pathway activity and assign chemical identities.

problem Interpreting metabolomics data to determine biochemical pathway activities.
method Generative probabilistic modeling using stochastic sampling.
result PUMA predicts pathway activity and assigns chemical identities to metabolites.

Optimal algorithm identifies best arm for risk measures in heavy-tailed distributions.

problem Identifying the arm with smallest CVaR, VaR, or weighted sum of CVaR and mean from heavy-tailed distributions.
method Multi-armed bandit best-arm identification framework, solving non-convex optimization problem.
result Optimal δ-correct algorithm with matching lower bound on expected samples.

Paper proves method for calculating NML code length works for continuous models.

problem Uncertainty in calculating NML code length for continuous models.
method Introduced a novel decomposition approach based on the coarea formula to prove correctness for continuous cases.
result Method accurately calculates NML code length for continuous models.

A new model forecasts financial risks using multiple realized measures.

problem Forecasting financial risks using multiple realized measures.
method Developed a semi-parametric joint VaR and ES forecasting framework using realized measures.
result The proposed model outperformed other models in forecasting financial risks.

This research improves neural likelihood approximation for Bayesian inverse problems.

problem Challenges in modeling and inference for high-dimensional Bayesian inverse problems.
method Develops a strictly convex approximation framework for neural likelihood.
result Empirical minimizers converge to the true likelihood as sample size increases.