Towards black-box parameter estimation

Abstract Deep learning algorithms have recently been shown to be a successful tool in estimating parameters of statistical models for which simulation is easy, but likelihood computation is challenging. This is achieved by sampling a large number of parameter values from a distribution, which is typically chosen to be non-informative and cover as much of the parameter space as possible. However, for high-dimensional and large parameter spaces, covering all possible reasonable parameter values is infeasible. We propose a new sequential training procedure that reduces simulation cost and guides simulations toward the region of high parameter density based on estimates of the neural network and the observed data. Our following proposal aims to fit time series models to newly collected data at no cost using a pre-trained neural network with simulated time series of a fixed length. These approaches can successfully estimate and quantify the uncertainty of parameters from non-Gaussian models with complex spatial and temporal dependencies. The success of our methods is a first step towards a fully flexible automatic black-box estimation framework.

Authors

Institutions

Publication Details

Journal
Computational Statistics
Published
2025-04-25
DOI
https://doi.org/10.1007/s00180-025-01623-4
Primary Topic
Markov Chains and Monte Carlo Methods
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Towards black-box parameter estimation

Amanda Lenzi, Håvard Rue
Computational Statistics
Markov Chains and Monte Carlo Methods
article

Towards black-box parameter estimation

Amanda Lenzi, Håvard Rue
article en

Abstract

Abstract Deep learning algorithms have recently been shown to be a successful tool in estimating parameters of statistical models for which simulation is easy, but likelihood computation is challenging. This is achieved by sampling a large number of parameter values from a distribution, which is typically chosen to be non-informative and cover as much of the parameter space as possible. However, for high-dimensional and large parameter spaces, covering all possible reasonable parameter values is infeasible. We propose a new sequential training procedure that reduces simulation cost and guides simulations toward the region of high parameter density based on estimates of the neural network and the observed data. Our following proposal aims to fit time series models to newly collected data at no cost using a pre-trained neural network with simulated time series of a fixed length. These approaches can successfully estimate and quantify the uncertainty of parameters from non-Gaussian models with complex spatial and temporal dependencies. The success of our methods is a first step towards a fully flexible automatic black-box estimation framework.

Computational StatisticsVol. 40(8)
King Abdullah University of Science and Technology (SA), University of Edinburgh (GB)
Openalex Percentile: Top 91%
Markov Chains and Monte Carlo Methods
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Towards black-box parameter estimation — Amanda Lenzi, Håvard Rue · Computational Statistics (2025) | TGRS Research Map | TGRS