Table of Contents
Fetching ...

Differentiable Calibration of Inexact Stochastic Simulation Models via Kernel Score Minimization

Ziwei Su, Diego Klabjan

TL;DR

This paper proposes to learn differentiable input parameters of stochastic simulation models using output-level data via kernel score minimization with stochastic gradient descent and quantifies the uncertainties of the learned input parameters using a frequentist confidence set procedure based on a new asymptotic normality result that accounts for model inexactness.

Abstract

Stochastic simulation models are generative models that mimic complex systems to help with decision-making. The reliability of these models heavily depends on well-calibrated input model parameters. However, in many practical scenarios, only output-level data are available to learn the input model parameters, which is challenging due to the often intractable likelihood of the stochastic simulation model. Moreover, stochastic simulation models are frequently inexact, with discrepancies between the model and the target system. No existing methods can effectively learn and quantify the uncertainties of input parameters using only output-level data. In this paper, we propose to learn differentiable input parameters of stochastic simulation models using output-level data via kernel score minimization with stochastic gradient descent. We quantify the uncertainties of the learned input parameters using a frequentist confidence set procedure based on a new asymptotic normality result that accounts for model inexactness. The proposed method is evaluated on exact and inexact G/G/1 queueing models.

Differentiable Calibration of Inexact Stochastic Simulation Models via Kernel Score Minimization

TL;DR

This paper proposes to learn differentiable input parameters of stochastic simulation models using output-level data via kernel score minimization with stochastic gradient descent and quantifies the uncertainties of the learned input parameters using a frequentist confidence set procedure based on a new asymptotic normality result that accounts for model inexactness.

Abstract

Stochastic simulation models are generative models that mimic complex systems to help with decision-making. The reliability of these models heavily depends on well-calibrated input model parameters. However, in many practical scenarios, only output-level data are available to learn the input model parameters, which is challenging due to the often intractable likelihood of the stochastic simulation model. Moreover, stochastic simulation models are frequently inexact, with discrepancies between the model and the target system. No existing methods can effectively learn and quantify the uncertainties of input parameters using only output-level data. In this paper, we propose to learn differentiable input parameters of stochastic simulation models using output-level data via kernel score minimization with stochastic gradient descent. We quantify the uncertainties of the learned input parameters using a frequentist confidence set procedure based on a new asymptotic normality result that accounts for model inexactness. The proposed method is evaluated on exact and inexact G/G/1 queueing models.

Paper Structure

This paper contains 39 sections, 9 theorems, 52 equations, 4 figures, 12 tables, 1 algorithm.

Key Result

Proposition 2.2

If Assumption ass:ubg_reg_conditions holds, then $\mathbb{E}_{Y_1(\theta), \cdots, Y_n(\theta)} \nabla_\theta \widehat{L}_{m, n}^{\operatorname{KS}}(\theta) = \nabla_\theta L_{m}^{\operatorname{KS}}(\theta)$.

Figures (4)

  • Figure 1: Confidence set for KOSE-Riesz, Experiment 4, $a=1$.
  • Figure 2: Confidence set for KOSE-Riesz, Experiment 4, $a=0.6$.
  • Figure 3: Confidence set for KOSE-Gaussian, Experiment 4, $a=1$.
  • Figure 4: Confidence set for KOSE-Gaussian, Experiment 4, $a=0.6$.

Theorems & Definitions (12)

  • Proposition 2.2: Unbiased Gradient Estimate
  • Theorem 2.4: Asymptotic Normality
  • Theorem 2.6
  • Proposition A.15: Strong Consistency oates2022minimum
  • Proposition A.16: Strong consistency under model non-identifiability oates2022minimum
  • Theorem A.18: Generalization bounds briol2019statistical
  • Proposition A.19: Differentiation lemma binkowski2018demystifying
  • Theorem A.20: Strong law of large numbers for generalized $k$-sample U-statistics sen1977almost
  • Proposition A.21
  • proof
  • ...and 2 more