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

3517021,0531,404 · Jun 202019922001200920172026
48 results for likelihood-free models

ALFI improves likelihood-free inference for black-box generators.

problem Limitations of likelihood-free inference on black-box generators.
method Adversarial Likelihood-Free Inference (ALFI) to estimate posterior distributions.
result ALFI achieves best parameter estimation accuracy with limited simulation.

Deep Gaussian Processes improve likelihood-free inference for complex distributions.

problem Limited flexibility of Bayesian Optimization with GPs for multimodal distributions.
method Proposes Deep Gaussian Processes (DGPs) as a surrogate model for likelihood-free inference.
result DGPs outperform GPs on multimodal distributions while maintaining comparable performance on unimodal cases.

This study benchmarks likelihood-free inference methods for models with heavy-tailed or discrete data.

problem Comparing likelihood-free inference methods for models with structural features like heavy-tails or discreteness.
method Four approaches: MLE, NBE, EOT, and AW-NBE are evaluated using simulations.
result The choice of evaluation tools is crucial for models with extremes and discrete data.

Engine for Likelihood-Free Inference (ELFI) is a Python software library for performing likelihood-free inference (LFI). ELFI provides a convenient syntax for arranging components in LFI, such as priors, simulators, summaries or distances, to a network called ELFI graph. The components can be implemented in a wide vari…

2017-08-02abs ↗pdf ↗

EnVAE uses energy score for likelihood-free VAEs, improving image reconstructions.

problem Likelihood misspecification in VAEs leads to blurry reconstructions and poor data fidelity.
method Deterministic decoder, energy score as reconstruction loss, fast variant for efficiency.
result EnVAE achieves superior reconstruction and generation quality compared to likelihood-based baselines.

A new method extends Bayesian optimization to more models and utilities.

problem Extending Bayesian optimization to a broader class of models and utilities.
method Likelihood-free Bayesian Optimization (LFBO) which directly models the acquisition function without separate inference.
result LFBO outperforms state-of-the-art black-box optimization methods on real-world problems.

Automatically learns summary features from time series data for likelihood-free inference.

problem Necessity of hand-tailored summary features for time series data in likelihood-free inference.
method Data-driven approach to automatically learn summary features.
result Learning summary features from data can outperform hand-crafted values in likelihood-free inference.

Improved likelihood-free inference by localizing and refining low-dimensional approximations.

problem Poor performance of common likelihood-free methods in high-dimensional models.
method Localisation followed by refinement of low-dimensional summaries.
result Improved accuracy in marginal posteriors through localized and refined approximations.

A new method improves likelihood-free Bayesian inference by transforming summary statistics and using efficient Variational Bayes.

problem Incorrectly assuming normally distributed summary statistics in likelihood-free Bayesian inference.
method Wasserstein Gaussianization transformation combined with robust BSL and efficient Variational Bayes.
result Highly efficient and reliable approximate Bayesian inference for likelihood-free problems.

Unified approach for sequence design combining likelihood-free inference and black-box optimization.

problem Designing biological sequences efficiently and accurately.
method Unified probabilistic framework integrating likelihood-free inference and black-box optimization.
result Previous optimization methods can be adapted and new algorithms proposed within this framework.

A new method reduces dimensionality for better likelihood-free parameter estimation.

problem Estimating parameters from data with no closed-form likelihood.
method Combines reconstruction map estimation with dimension-reduction techniques.
result The proposed method outperforms existing techniques in accuracy and efficiency.

Paper proposes a new method for probabilistic electricity price forecasting.

problem Accurate estimation of forecast uncertainties for optimal decision making.
method Implicit generative ensemble post-processing using an ensemble of point forecasting models.
result Method outperforms well-established model combination benchmarks.

New method uses neural exponential families for likelihood-free inference.

problem Bayesian Likelihood-Free Inference with intractable likelihood.
method Score Matching neural conditional exponential families for approximate likelihood.
result State-of-the-art performance in posterior sampling for intractable likelihood models.

We introduce a framework using Generative Adversarial Networks (GANs) for likelihood--free inference (LFI) and Approximate Bayesian Computation (ABC) where we replace the black-box simulator model with an approximator network and generate a rich set of summary features in a data driven fashion. On benchmark data sets, …

2017-11-29abs ↗pdf ↗

Likelihood-free methods perform parameter inference in stochastic simulator models where evaluating the likelihood is intractable but sampling synthetic data is possible. One class of methods for this likelihood-free problem uses a classifier to distinguish between pairs of parameter-observation samples generated using…

2020-02-10abs ↗pdf ↗

Likelihood-free inference is concerned with the estimation of the parameters of a non-differentiable stochastic simulator that best reproduce real observations. In the absence of a likelihood function, most of the existing inference methods optimize the simulator parameters through a handcrafted iterative procedure tha…

2018-11-30abs ↗pdf ↗

Likelihood-free methods such as approximate Bayesian computation (ABC) have extended the reach of statistical inference to problems with computationally intractable likelihoods. Such approaches perform well for small-to-moderate dimensional problems, but suffer a curse of dimensionality in the number of model parameter…

2019-06-11abs ↗pdf ↗

I consider two problems in machine learning and statistics: the problem of estimating the joint probability density of a collection of random variables, known as density estimation, and the problem of inferring model parameters when their likelihood is intractable, known as likelihood-free inference. The contribution o…

2019-10-29abs ↗pdf ↗

Likelihood-free inference involves inferring parameter values given observed data and a simulator model. The simulator is computer code which takes parameters, performs stochastic calculations, and outputs simulated data. In this work, we view the simulator as a function whose inputs are (1) the parameters and (2) a ve…

2019-10-08abs ↗pdf ↗

Paper proposes energy objective for training normalizing flows without determinants.

problem Challenges in training normalizing flows due to Jacobian determinants.
method Introduces energy objective based on proper scoring rules, determinant-free.
result Energy objective supports novel model families and competitive performance.

Improves likelihood-free inference by using a new sampling approach to avoid biased data collection.

problem Efficient Bayesian inference without likelihood evaluation for real-world datasets.
method Introduces Neural Proposal (NP) to sample simulation inputs i.i.d. for unbiased posterior inference.
result Demonstrates improved performance, especially for multi-modal posteriors, through experiments.

Improved MMD estimator for likelihood-free inference.

problem Computational challenges in estimating MMD for likelihood-free inference.
method Optimally-weighted MMD estimator with improved sample complexity.
result Significantly improved sample complexity for accurate MMD estimation.

We extend recent work (Brehmer, et. al., 2018) that use neural networks as surrogate models for likelihood-free inference. As in the previous work, we exploit the fact that the joint likelihood ratio and joint score, conditioned on both observed and latent variables, can often be extracted from an implicit generative m…

2018-08-02abs ↗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.

New method improves likelihood-free parameter estimation in complex models.

problem Estimating parameters in simulation-based models with unknown likelihood.
method Nested multi-time-scale stochastic approximation (NMTS) method.
result Eliminates bias and accelerates convergence in likelihood-free inference.

Parametric statistical models that are implicitly defined in terms of a stochastic data generating process are used in a wide range of scientific disciplines because they enable accurate modeling. However, learning the parameters from observed data is generally very difficult because their likelihood function is typica…

2018-10-23abs ↗pdf ↗

New method for state inference in state-space models with unknown dynamics.

problem State inference in state-space models with computationally expensive and undefined dynamics.
method Estimate state transition dynamics using a multi-output Gaussian process and Bayesian Neural Network as a surrogate model.
result Significant improvement in accuracy for state inference and prediction in non-stationary user models.

Likelihood-free inference refers to inference when a likelihood function cannot be explicitly evaluated, which is often the case for models based on simulators. Most of the literature is based on sample-based `Approximate Bayesian Computation' methods, but recent work suggests that approaches based on deep neural condi…

2018-11-21abs ↗pdf ↗

Likelihood-free inference for simulator-based statistical models has developed rapidly from its infancy to a useful tool for practitioners. However, models with more than a handful of parameters still generally remain a challenge for the Approximate Bayesian Computation (ABC) based inference. To advance the possibiliti…

2020-02-21abs ↗pdf ↗

A new method for experimental design focuses on predicting downstream quantities of interest.

problem Designs that maximize parameter learning may not maximize downstream quantity prediction.
method Likelihood-free goal-oriented optimal experimental design (LF-GO-OED) using ABC density ratio estimation.
result LF-GO-OED maximizes the expected information gain for downstream quantities.

Neural point estimators improve parameter estimation from replicated data.

problem Making inference from replicated data in weakly-identified and highly-parameterised models.
method Permutation-invariant neural networks for likelihood-free parameter estimation.
result Neural point estimators can quickly and optimally estimate parameters.

Approximate Bayesian Computation (ABC) is a framework for performing likelihood-free posterior inference for simulation models. Stochastic Variational inference (SVI) is an appealing alternative to the inefficient sampling approaches commonly used in ABC. However, SVI is highly sensitive to the variance of the gradient…

2016-06-28abs ↗pdf ↗

Improved likelihood-free inference using preconditioned neural posterior estimation.

problem Inaccurate posterior estimation in likelihood-free inference methods.
method Preconditioned Neural Posterior Estimation (PNPE) and Sequential PNPE (PSNPE) methods.
result PNPE and PSNPE improve posterior estimation accuracy over NPE and SNPE.

A new framework bridges classical and machine learning methods for reliable inference from complex models.

problem Intractable likelihood functions in complex systems make classical statistics ineffective for likelihood-free inference.
method Likelihood-Free Frequentist Inference (LF2I) framework that combines classical statistics and machine learning.
result Valid confidence sets with near finite-sample validity can be constructed for any parameter value.

The paper proposes using path signatures for better inference in time series data.

problem Simulation models with time series data often lack tractable likelihood functions.
method Approximate Bayesian Computation with path signatures to handle sequential data.
result Theoretical guarantees on the resultant posteriors for Bayesian parameter inference.

The paper tackles hypothesis testing for likelihood-free inference with a new kernel-based approach.

problem Testing hypotheses with limited labeled data in likelihood-free inference.
method Kernel-based tests using maximum mean discrepancy (MMD) for non-parametric density comparison.
result Existence of an asymmetric trade-off between labeled and unlabeled data samples.