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

6.3%12.5%18.8%25.0% · Mar 199319922001200920172026
48 results for Simulation-based evaluation

A new algorithm improves efficiency and robustness of heuristic optimization in simulation-based problems.

problem Optimizing input parameters for stochastic simulation-based optimization.
method Reactive sample size algorithm based on parametric tests and indifference-zone selection.
result The reactive method improves efficiency and robustness of heuristic optimization techniques.

ConDiSim uses diffusion models to approximate complex system posteriors efficiently.

problem Simulation-based inference of systems with intractable likelihoods.
method Conditional diffusion model with forward and reverse processes.
result Effective posterior approximation across various benchmark and real-world problems.

pmsims R package uses Gaussian process for flexible sample size estimation in clinical models.

problem Determining adequate sample size for clinical prediction models.
method Simulation-based Gaussian process search for flexible sample size estimation.
result Gaussian process-based method produces more stable sample size estimates, especially in challenging settings.

Framework synthesizes programs for simulating complex models and estimating parameters.

problem Parameter estimation for complex models requires manual encoding of fixed model structures.
method Combines LLMs for program synthesis with neural simulation-based inference.
result Identifies plausible model families from open-ended prompts with high accuracy.

Unified framework for simulation-based inference learns a single model for multiple tasks.

problem Simulation-based inference for multiple tasks with limited model retraining.
method Unified flow-matching generative model with query-aware masking distribution.
result Competitive performance on various inference tasks and real-world problems.

BNRE improves simulation-based inference by producing more conservative posteriors.

problem Overconfident posteriors from current simulation-based inference algorithms risk false inferences.
method Balanced Neural Ratio Estimation (BNRE) that produces more conservative posterior approximations.
result BNRE produces more conservative posterior surrogates on all tested benchmarks and simulation budgets.

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.

SSNL improves simulation-based inference for high-dimensional data.

problem Performance degradation in neural likelihood estimation for high-dimensional data.
method Surjective Sequential Neural Likelihood (SSNL) using surjective normalizing flow models.
result SSNL avoids manual crafting of summary statistics and outperforms state-of-the-art methods.

Paper tackles SBI under model misspecification, presenting robust strategies.

problem Challenges in SBI under model misspecification.
method Three key strategies: robust summary statistics, generalised Bayesian inference, and error modelling.
result Empirical results show vulnerabilities of SBI and effectiveness of misspecification-robust alternatives.

A benchmark for simulation-based inference methods.

problem Lack of a public benchmark for 'likelihood-free' algorithms.
method Provided a benchmark with tasks and performance metrics, including neural networks and ABC methods.
result State-of-the-art algorithms have room for improvement, and neural network-based approaches generally perform better.

Diffusion models enhance SBI with flexible parameter and observation learning.

problem Efficient and accurate estimation of latent parameters from simulations and real data.
method Score-based diffusion models, guidance, score composition, flow matching, consistency models, joint modeling.
result Flexibility and versatility in modeling various problems.

GATSBI uses GANs for SBI, improving posterior estimation in high dimensions.

problem Statistical inference on stochastic models without likelihoods.
method Adversarial approach to variational objective, amortized inference, implicit priors.
result GATSBI returns well-calibrated posterior estimates in high dimensions.

NQE uses quantile regression for fast SBI with cubic Hermite splines.

problem Efficient Bayesian inference for complex models with limited data.
method Neural Quantile Estimation (NQE) learns quantiles autoregressively and interpolates them using cubic Hermite splines.
result NQE achieves state-of-the-art performance on various benchmark problems.

VB methods improve MMNL estimation speed and accuracy.

problem Scalable Bayesian estimation of MMNL models.
method Extending VB methods to include both fixed and random utility parameters, and conducting extensive simulations.
result VB methods, especially VB-NCVMP-Delta, are up to 16 times faster than MCMC and MSLE while maintaining similar accuracy.

BOED improves SBI by optimizing experimental designs and inference functions.

problem Efficiently use experimental resources for better inference on complex models.
method Link mutual information bounds between SBI and BOED, optimizing both design and inference.
result BOED improves inference in real-world simulators in epidemiology and biology.

CMPE improves SBI efficiency and accuracy.

problem Efficiently infer parameters of complex simulation models.
method CMPE is a new conditional sampler that distills a continuous probability flow.
result CMPE outperforms current state-of-the-art algorithms on hard low-dimensional benchmarks and competitive on high-dimensional problems.

PRISM infers model structures and parameters from simulations, controlling complexity at test time.

problem Choosing among large model families for scientific discovery.
method Simulation-based encoder-decoder that infers model structures and parameters, with test-time complexity control.
result PRISM scales to large model families and performs model selection in biophysical diffusion MRI.

UDA improves ABI robustness but fails under certain prior misspecifications.

problem Robustness of ABI in noisy real-world data.
method Systematic evaluation of UDA across various misspecification scenarios.
result UDA aligns summary spaces but can fail under prior misspecifications.

Simulation-based inference methods can produce unreliable posterior approximations.

problem Reliability of simulation-based inference methods for scientific use cases.
method Benchmarked algorithms including Neural Posterior Estimation, Neural Ratio Estimation, Sequential Neural Likelihood, and Approximate Bayesian Computation.
result Ensembling posterior surrogates provides more reliable approximations.

Bayesian neural networks improve simulation-based inference with limited data.

problem Inaccurate inference in data-poor regimes with limited or expensive simulations.
method Bayesian neural networks for posterior approximation, accounting for computational uncertainty.
result Bayesian neural networks produce well-calibrated posteriors with few simulations.

Framework for Bayesian inference using GP emulated MH sampler for noisy likelihoods.

problem Approximate Bayesian inference with limited noisy log-likelihood evaluations.
method Gaussian process emulates MH sampler for log-likelihood evaluations; sequential experimental design selects evaluation points.
result Approximate sampler is sample-efficient and robust to GP assumptions.

Clarifies challenges in machine learning uncertainty quantification.

problem Inconsistent terminology and diverse technical requirements for trustworthy uncertainties.
method Examines estimation targets, uncertainty constructs, and problematic mappings.
result Advocates for alignment between intent and implementation in UQ.

While it's always possible to compute a variational approximation to a posterior distribution, it can be difficult to discover problems with this approximation. We propose two diagnostic algorithms to alleviate this problem. The Pareto-smoothed importance sampling (PSIS) diagnostic gives a goodness of fit measurement f…

2018-02-07abs ↗pdf ↗

New method optimizes sensor placement for stochastic systems efficiently.

problem Optimizing sensor placements for black-box stochastic systems with computational constraints.
method Trains a joint energy-based model on simulation data to learn parameter and solution distributions, allowing efficient sensor placement.
result Demonstrates lower computational cost and more informative sensor locations compared to conventional approaches.

A novel kernel approach for model selection in simulator-based models.

problem Model selection for simulator-based statistical models with limited prior knowledge.
method Iteratively updates model weights and parameters using Bayes' rule and kernel recursive ABC algorithm.
result Demonstrates effectiveness on dynamical systems in ecology and epidemiology.

This work extends balancing to various simulation-based inference algorithms for more conservative posterior approximations.

problem Overconfident posterior approximations in simulation-based inference.
method Introduces a balanced version of neural posterior estimation and contrastive neural ratio estimation.
result Balanced versions tend to produce conservative posterior approximations on various benchmarks.

A new method optimizes a generalized Kullback-Leibler divergence for better simulation-based inference.

problem Optimizing likelihood functions when they are only known implicitly.
method Optimizes a generalized Kullback-Leibler divergence that accounts for normalization constants in unnormalized distributions.
result Unified approach that combines Neural Posterior Estimation and Neural Ratio Estimation.

LSBI approximates likelihood with linear functions for cosmological parameter estimation.

problem Estimating cosmological parameters from complex data.
method Sequential Linear Simulation-based Inference (LSBI) using Gaussian approximations.
result LSBI achieves convergence after 4-5 rounds of simulations, comparable to neural methods.

Proposes method for eliciting non-parametric joint priors using normalizing flows.

problem Learning complex non-parametric joint priors for model parameters.
method Expert elicitation combined with normalizing flows for generative modeling.
result Framework supports elicitation of both parametric and non-parametric priors.

CogFormer trains a transformer to estimate parameters across various cognitive models.

problem Difficulty in fitting complex cognitive models and iterating over varying assumptions.
method Meta-amortized framework using a transformer to estimate parameters across multiple models.
result CogFormer accurately estimates parameters across different model families with minimal retraining.

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.

Simulation-based inference speeds up gravitational wave data analysis.

problem High-dimensional parameter spaces and complex noise in gravitational wave data.
method Simulation-based inference methods using machine learning techniques.
result Simulation-based inference methods improve speed over traditional methods.

Paper introduces a new sampler for simulation-based inference using Gromov-Monge distance.

problem Simulation-based inference for multi-dimensional probability distributions.
method Proposes Reversible Gromov-Monge (RGM) distance and sampler for alignment and inference.
result RGM sampler can estimate optimal alignments and push measures between spaces.