By folding normalization into a KL-based objective over un-normalized potentials, neural likelihood approximation becomes a strictly convex problem with provable consistency.
Double-loop randomized quasi-Monte Carlo estimator for nested integration
2 Pith papers cite this work. Polarity classification is still indexing.
abstract
Nested integration of the form $\int f\left(\int g(\bs{y},\bs{x})\di{}\bs{x}\right)\di{}\bs{y}$, characterized by an outer integral connected to an inner integral through a nonlinear function $f$, is a challenging problem in various fields, such as engineering and mathematical finance. The available numerical methods for nested integration based on Monte Carlo (MC) methods can be prohibitively expensive owing to the error propagating from the inner to the outer integral. Attempts to enhance the efficiency of these approximations using the quasi-MC (QMC) or randomized QMC (rQMC) method have focused on either the inner or outer integral approximation. This work introduces a novel nested rQMC method that simultaneously addresses the approximation of the inner and outer integrals. The method leverages the unique nested integral structure to offer a more efficient approximation mechanism. As the primary contribution, we derive asymptotic error bounds for the bias and variance of our estimator, along with the regularity conditions under which these bounds can be attained. Incorporating Owen's scrambling techniques, we address integrands exhibiting infinite variation in the Hardy--Krause sense, enabling theoretically sound error estimates. Moreover, we derive a truncation scheme for applications in the context of expected information gain estimation. We verify the estimator quality through numerical experiments by comparing the computational efficiency of the nested rQMC method against standard nested MC estimation to highlight the computational savings and enhanced applicability of the proposed approach.
years
2026 2representative citing papers
A Bayesian optimal experimental design framework with Gaussian approximation of expected information gain and surrogate Fisher information enables optimized uniaxial tests that significantly improve identifiability of history-dependent constitutive parameters over random designs.
citing papers explorer
-
A Convex Approximation Framework for Neural Likelihood-Based Bayesian Inverse Problems
By folding normalization into a KL-based objective over un-normalized potentials, neural likelihood approximation becomes a strictly convex problem with provable consistency.
-
Optimal Experimental Design for Reliable Learning of History-Dependent Constitutive Laws
A Bayesian optimal experimental design framework with Gaussian approximation of expected information gain and surrogate Fisher information enables optimized uniaxial tests that significantly improve identifiability of history-dependent constitutive parameters over random designs.