Search arXivSearch

arXiv · 2510.00389

Zero variance self-normalized importance sampling via estimating equations

Abstract

In ordinary importance sampling with a nonnegative integrand there exists an importance sampling strategy with zero variance. Practical sampling strategies are often based on approximating that optimal solution, potentially approaching zero variance. There is a positivisation extension of that method to handle integrands that take both positive and negative values. Self-normalized importance sampling uses a ratio estimate, for which the optimal sampler does not have zero variance and so zero variance cannot even be approached in practice. Strategies that separately estimate the numerator and denominator of that ratio can approach zero variance. This paper develops another zero variance solution for self-normalized importance sampling. The first step is to write the desired expectation as the zero of an estimating equation using Fieller's technique. Then we apply the positivisation strategy to the estimating equation. This paper give conditions for existence and uniqueness of the sample solution to the estimating equation. Then it give conditions for consistency and asymptotic normality and an expression for the asymptotic variance. The sample size multiplied by the variance of the asymptotic formula becomes arbitrarily close to zero for certain sampling strategies.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Art B. Owen. 2025-10-01. Zero variance self-normalized importance sampling via estimating equations. https://arxiv.org/abs/2510.00389

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A note on the distribution of the partial correlation coefficient with nonparametrically estimated marginal regressions

There has been much interest in the nonparametric testing of conditional independence in the econometric and statistical literature, but the simplest and potentially most useful method, based on the sample partial correlation, seems to have been overlooked, its distribution only having been investigated in some simple parametric instances. The present note shows that an easy to apply permutation test based on the sample partial correlation with nonparametrically estimated marginal regressions has good large and small sample properties.

math.ST

Instance-Log-Optimality of Portfolio-Based E-Processes and their Sequential Hypothesis Tests

We consider the problem of sequential hypothesis testing using $e$-processes. For a rich class of composite testing problems---which include bounded mean testing, equal mean testing for bounded random tuples, and some key ingredients of two-sample and independence testing as special cases---we show that any $e$-process satisfying a certain sublinear regret bound is asymptotically and almost surely instance-log-optimal for a composite alternative. This is a strong notion of optimality that has not previously been established for the aforementioned problems, and we provide explicit test supermartingales and $e$-processes satisfying this notion in a more general case. Furthermore, we derive matching lower and upper bounds on the expected rejection time in the high-confidence regime for the resulting sequential tests in all of these cases. The proofs of these results make weak, algorithm-agnostic moment assumptions and rely on a proof technique involving the aforementioned regret and a family of numeraire portfolios. Finally, we discuss how all of these theorems hold in a distribution-uniform sense, a notion of log-optimality that is stronger still and seems to be new to the literature.

math.ST

Common Drivers in Sparsely Interacting Hawkes Processes

We study a multivariate Hawkes process as a model for time-continuous relational event networks. The model does not assume the network to be known, it includes covariates, and it allows for both common drivers, parameters common to all the actors in the network, and also local parameters specific for each actor. We derive rates of convergence for all of the model parameters when both the number of actors and the time horizon tends to infinity. To prevent an exploding network, sparseness is assumed. We also discuss numerical aspects.

math.ST