Searcharxiv⌕ Search

arXiv subjects

James C. Spall

Publications and source records attributed to James C. Spall.

12 recordsLinked to original sources

Estimating Hessian Log-Determinants without Forming the Hessian Matrix

The log-determinant of a positive-definite Hessian matrix is used in uncertainty assessment, Bayesian model comparison, and experimental design. Computing this quantity can be difficult when function values are available but derivatives are not. We combine simultaneous perturbation stochastic approximation with stochastic Lanczos quadrature (SPSA-SLQ) to estimate the log-determinant without forming the Hessian. Possibly noisy function values suffice for fixed-data and expected Hessians, including Fisher information matrices. We derive a local bound on log-determinant error due to Hessian-vector product approximation, quadrature, and averaging random probes. Three numerical studies examine accuracy and computational cost. In a 3002-parameter example, SPSA-SLQ gives a relative root-mean-square error below 1% and uses 65% less peak GPU memory than a basic full-matrix estimator. A sensor-placement study also compares improved full-matrix methods and evaluates layout selection.

stat.AP↗

Blind Random Search with Noisy Measurements: Almost Sure Convergence and Convergence Rates

Blind random search is a simple global optimization method that only requires the value of the loss function, without needing gradient information or an explicit loss model. However, its classical formulation assumes that the loss evaluation is noise-free, which limits its direct application to practical problems with noisy measurements. We extend blind random search by combining a vanishing acceptance threshold with the running average of noisy loss measurements. Under the stated assumptions, we prove that the proposed algorithm converges almost surely to the global minimizer. We further analyze the rate at which the loss at the current estimate approaches the minimum loss. For low-dimensional cases, we obtain an almost sure asymptotic upper bound on the difference between the two, and for high-dimensional cases, we prove that this difference, suitably scaled, has an exact Weibull limiting distribution.

math.OC↗

High-Dimensional Regularization of the Spatial Sign Covariance Matrix for Robust Shape Estimation

Covariance estimation is a key component of many applications in system identification and data-driven control. Although heavy-tailed distributions may lack a covariance matrix to estimate, the shape matrix provides a well-defined, scale-free generalization for the broad family of elliptical distributions. In this setting, practitioners often employ Tyler's M-estimator (TME), which is defined implicitly and is computed using a fixed-point iteration. The spatial sign covariance matrix estimator (SSCM) offers a much simpler alternative: it corresponds to one iteration of TME. Yet, the SSCM has been largely regarded as an inferior estimator due to its statistical inconsistency under fixed-dimensional asymptotics. By contrast, using second-order tools from random matrix theory, we establish that, under standard assumptions, SSCM asymptotically dominates TME in Frobenius risk when dimension and sample size grow proportionally. This advantage arises from implicit regularization, which reduces variance at the cost of a bias that vanishes as the dimension grows. Numerical experiments support the theoretical predictions even at moderate dimensions.

math.ST↗

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 or black-box simulators, so we propose LMC-SPSA with noise, which approximates the gradient of the target log-density using two noisy function evaluations per iteration. We prove, under noisy gradient estimates, that LMC-SPSA converges in distribution by proving the convergence in Wasserstein distance. Furthermore, we construct a diminishing step-size schedule that still drives the Wasserstein error bound to convergence, extending convergence guarantees beyond the constant-step setting. Further, we sharpen the dominant dimension dependence of the Wasserstein error from $O(p^4)$ to $O(p^2)$ (with $p$ denoting the dimension), and support this analysis with numerical results. We show that LMC-SPSA achieves $W_2$-accuracy $\varepsilon$ with total noisy-oracle complexity of $O(p/\varepsilon^2+δ^2p^3/\varepsilon^3)$, where $δ$ is the paired-noise level. This improves the noise-dependent accuracy scaling relative to the ZO-LMC method of Roy et al. We further establish asymptotically vanishing Wasserstein error as the number of iterations $\to\infty$ under diminishing step-size and perturbation sequences and derive an explicit convergence rate for a balanced schedule under noisy zeroth-order feedback. Empirical experiments are conducted to verify the performance of LMC-SPSA with noise. We provide an oracle-budget-matched comparison with the ZO-LMC method, showing smaller empirical sampling errors under the same function-evaluation budget.

math.OC↗

Autocovariance and Optimal Design for Random Walk Metropolis-Hastings Algorithm

The Metropolis-Hastings algorithm has been extensively studied in the estimation and simulation literature, with most prior work focusing on convergence behavior and asymptotic theory. However, its covariance structure-an important statistical property for both theory and implementation-remains less understood. In this work, we provide new theoretical insights into the scalar case, focusing primarily on symmetric unimodal target distributions with symmetric random walk proposals, where we also establish an optimal proposal design. In addition, we derive some more general results beyond this setting. For the high-dimensional case, we relate the covariance matrix to the classical 0.23 average acceptance rate tuning criterion.

stat.CO↗

Simulation-Based Optimization for Policy Incentives and Planning of Hybrid Microgrids

Transitioning to renewable power generation is often difficult for remote or isolated communities, due to generation intermittency and high cost barriers. Our paper presents a simulation-based optimization approach for the design of policy incentives and planning of microgrids with renewable energy sources, targeting isolated communities. We propose a novel framework that integrates stochastic simulation to account for weather uncertainty and system availability while optimizing microgrid configurations and policy incentives. Utilizing the mixed-variable Simultaneous Perturbation Stochastic Approximation (MSPSA) algorithm, our method demonstrates a significant reduction in Net Present Cost (NPC) for microgrids, achieving a 68.1% reduction in total costs in a case study conducted on Popova Island. The results indicate the effectiveness of our approach in enhancing the economic viability of microgrids while promoting cleaner energy solutions. Future research directions include refining uncertainty models and exploring applications in grid-connected microgrids.

math.OC↗

Difference Between Cyclic and Distributed Approach in Stochastic Optimization for Multi-agent System

Many stochastic optimization problems in multi-agent systems can be decomposed into smaller subproblems or reduced decision subspaces. The cyclic and distributed approaches are two widely used strategies for solving such problems. In this manuscript, we review four existing methods for addressing these problems and compare them based on their suitable problem frameworks and update rules.

math.OC↗

Switch Updating in SPSA Algorithm for Stochastic Optimization with Inequality Constraints

Simultaneous perturbation stochastic approximation (SPSA) is widely used in stochastic optimization due to its high efficiency, asymptotic stability, and reduced number of required loss function measurements. However, the standard SPSA algorithm needs to be modified to deal with constrained problems. In recent years, sequential quadratic programming (SQP)-based projection ideas and penalty ideas have been analyzed. Both ideas have convergence results and a potentially wide range of applications, but with some limitations in practical consideration, such as computation time, complexity, and feasibility guarantee. We propose an SPSA-based switch updating algorithm, which updates based on the loss function or the inequality constraints, depending on current feasibility in each iteration. We show convergence results for the algorithm, and analyze its properties relative to other methods. We also numerically compare the switch updating algorithm with the penalty function approach for two constrained examples.

math.OC↗

Discrete Stochastic Optimization for Public Health Interventions with Constraints

Many public health threats exist, motivating the need to find optimal intervention strategies. Given the stochastic nature of the threats (e.g., the spread of pandemic influenza, the occurrence of drug overdoses, and the prevalence of alcohol-related threats), deterministic optimization approaches may be inappropriate. In this paper, we implement a stochastic optimization method to address aspects of the 2009 H1N1 and the COVID-19 pandemics, with the spread of disease modeled by the open source Monte Carlo simulations, FluTE and Covasim, respectively. Without testing every possible option, the objective of the optimization is to determine the best combination of intervention strategies so as to result in minimal economic loss to society. To reach our objective, this application-oriented paper uses the discrete simultaneous perturbation stochastic approximation method (DSPSA), a recursive simulation-based optimization algorithm, to update the input parameters in the disease simulation software so that the output iteratively approaches minimal economic loss. Assuming that the simulation models for the spread of disease (FluTE for H1N1 and Covasim for COVID-19 in our case) are accurate representations for the population being studied, the simulation-based strategy we present provides decision makers a powerful tool to mitigate potential human and economic losses from any epidemic. The basic approach is also applicable in other public health problems, such as opioid abuse and drunk driving.

math.OC↗

Efficient Implementation of Second-Order Stochastic Approximation Algorithms in High-Dimensional Problems

Stochastic approximation (SA) algorithms have been widely applied in minimization problems when the loss functions and/or the gradient information are only accessible through noisy evaluations. Stochastic gradient (SG) descent---a first-order algorithm and a workhorse of much machine learning---is perhaps the most famous form of SA. Among all SA algorithms, the second-order simultaneous perturbation stochastic approximation (2SPSA) and the second-order stochastic gradient (2SG) are particularly efficient in handling high-dimensional problems, covering both gradient-free and gradient-based scenarios. However, due to the necessary matrix operations, the per-iteration floating-point-operations (FLOPs) cost of the standard 2SPSA/2SG is $O(p^3)$, where $p$ is the dimension of the underlying parameter. Note that the $O(p^3)$ FLOPs cost is distinct from the classical SPSA-based per-iteration $O(1)$ cost in terms of the number of noisy function evaluations. In this work, we propose a technique to efficiently implement the 2SPSA/2SG algorithms via the symmetric indefinite matrix factorization and show that the FLOPs cost is reduced from $O(p^3)$ to $O(p^2)$. The formal almost sure convergence and rate of convergence for the newly proposed approach are directly inherited from the standard 2SPSA/2SG. The improvement in efficiency and numerical stability is demonstrated in two numerical studies.

math.OC↗

Error Analysis for the Particle Filter: Methods and Theoretical Support

The particle filter is a popular Bayesian filtering algorithm for use in cases where the state-space model is nonlinear and/or the random terms (initial state or noises) are non-Gaussian distributed. We study the behavior of the error in the particle filter algorithm as the number of particles gets large. After a decomposition of the error into two terms, we show that the difference between the estimator and the conditional mean is asymptotically normal when the resampling is done at every step in the filtering process. Two nonlinear/non-Gaussian examples are tested to verify this conclusion.

stat.CO↗

Modeling Traffic Networks Using Integrated Route and Link Data

Real-time navigation services, such as Google Maps and Waze, are widely used in daily life. These services provide rich data resources in real-time traffic conditions and travel time predictions; however, they have not been fully applied in transportation modeling. This paper aims to use traffic data from Google Maps and applying cutting-edge technologies in maximum likelihood estimation to model traffic networks and travel time reliability. This paper integrates Google Maps travel time data for routes and traffic condition data for links to model the complexities of traffic networks. We then formulate the Fisher information matrix and apply the asymptotic normality to obtain the probability distribution of the travel time estimates for a random route within the network of interest. We also derive the travel time reliability by considering two levels of uncertainties, i.e., the uncertainty of the route's travel time and the uncertainty of its travel time estimates. The proposed method could provide a more realistic and precise travel time reliability estimate. The methodology is applied to a small network in the downtown Baltimore area, where we propose a link data collection strategy and provide empirical evidence to show data independence by following this strategy. We also show results for maximum likelihood estimates and travel time reliability measures for different routes within the network. Furthermore, we use the historical data from a different network to validate this approach, showing our method provides a more accurate and precise estimate compared to the sample mean of the empirical data.

eess.SY↗