Skip to content
Preprint

Near-Oracle Robustification of Finite-Difference Stochastic Gradient Estimators via Cheap Pilot Calibration

Jul 2026 · 0 citations · 38 references
Mathematics

TL;DR

It is shown that, by pilot-estimating these model quantities using a negligible fraction of the simulation budget, substantial robustness is attained in the resulting FD estimators, and how such an approach is competitive against any choices of prescribed perturbation size, even if they are designed to be minimax-optimal over reasonable classes of target functions and FD schemes.

Abstract

We study stochastic gradient estimation in black-box environments where only noisy simulation observations of function values are available. Finite-difference (FD) methods are among the most widely used zeroth-order gradient estimators in such settings, by measuring the change in function values against a perturbation size. While the optimal order in choosing this perturbation size with respect to the simulation budget is well understood, the optimal constant factor relies on model characteristics that are typically unknown and viewed to be as difficult to estimate as the gradient itself. Consequently, FD estimators are often based on ad hoc tuning of the perturbation size, which may exhibit highly unstable performance across problem instances. In this paper, we challenge this conventional wisdom from both theoretical and practical perspectives. We show that, by pilot-estimating these model quantities using a negligible fraction of the simulation budget, substantial robustness is attained in the resulting FD estimators. Theoretically, we show that using a perturbation size governed by this pilot estimation can already achieve an MSE that is first-order identical to the ``oracle"MSE as if the optimal perturbation size is known in advance. Moreover, we show how such an approach is competitive against any choices of prescribed perturbation size, even if they are designed to be minimax-optimal over reasonable classes of target functions and FD schemes. Our proposed pilot estimation is practically easy to run, and a variety of numerical experiments demonstrate both the robustness and near-oracle optimality of our estimator relative to conventional FD schemes based on ad hoc tuning.

View source

Similar papers

Preprint Aug 2026

Zeroth-Order Langevin Monte Carlo via SPSA under Noisy Function Measurements

In sampling problems, gradient-based schemes such as Langevin Monte Carlo (LMC) mix faster than non-gradient-based methods, but their applicability is limited by access to the gradient of the target log-density. In practice, gradients are often unavailable and function evaluations are noisy, e.g., stochastic simulators...

Hongbo Li, J. Spall · 0 citations
Preprint Jul 2026

First-Order Methods for Distributionally Robust Constrained Optimization

This paper proposes a tractable stochastic approach based on an entropic regularization of the distributionally robust value function, which makes it possible to compute stochastic gradient estimators, and the combination of these estimators with a stochastic Frank-Wolfe algorithm, allowing us to optimize the regulariz...

Hubert Villuendas, Mathieu Besanccon, Jérôme Malick · 0 citations
Open access Jul 2026

Stochastic finite-difference schemes for nondifferentiable quasiconvex optimization: convergence rate

The obtained results significantly broaden the applicability of stochastic finite-difference methods to nonsmooth quasiconvex optimization problems and provide a rigorous theoretical justification of the algorithm in black-box settings where only noisy function evaluations are available.

Rafik A. Khachatryan · 0 citations
Preprint Jul 2026

Optimization under Persistent State-Dependent Bias: Gradient-based Method and Complexity Analysis

This paper studies the convergence of stochastic gradient descent when the implemented updates are subject to a persistent and state-dependent bias, in which the desired update is scaled by response functions component-wise, and proposes a gradient-based algorithm, termed Residual Learning.

Zhaoxian Wu, Quan Xiao, Tayfun Gokmen et al. · 0 citations
Preprint Jul 2026

Statistical Inference for Scenario-Based Dynamic Optimization under Uncertainty

Motivated by batch and semi-batch process operation, we study finite-horizon open-loop dynamic optimization problems with uncertain parameters. A common computational approach replaces the expected performance criterion by an average over finitely many sampled parameter realizations. We develop a statistical theory for...

Aurya Javeed, Johannes Milz · 0 citations
Preprint Jul 2026

Robust estimation of the autocorrelation function via forward ratios

It is obvious to say that an adequate estimation of the autocorrelation function is central in time series analysis. In this paper, we propose three new robust estimators based on ratios of observations, which offer strong resistance against outliers. While the first estimator, which is based on the median, is not effi...

A. Montañés, E. Ruiz · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.