Search arXivSearch

arXiv · 2606.06137

An Adaptive Upper One-Sided Cumulative Sum Control Chart with Joint Parameter Optimization for Monitoring the Ratio of Two Normal Variables in Short Production Runs

Abstract

Monitoring the ratio of two correlated normal variables is increasingly important in statistical process control, since many quality characteristics are expressed in relative rather than absolute form. Memory-type ratio charts have mostly been developed for long production runs, while their finite-horizon counterparts rely on a fixed reference value $ k $ derived from a specified shift. Such fixed-$ k $ designs are not optimal at a given out-of-control magnitude and, in low-variability regimes, yield boundary solutions for which the in-control truncated average run length (TARL$ _0 $) is unattainable. This paper proposes an upper one-sided cumulative sum (CUSUM) control chart for the ratio $ Z = X/Y $ in short production runs, denoted CUSUM-RZ$ ^+ $ (RZ standing for the ratio $ Z $), with fully adaptive joint optimization of $ k $ and the decision interval $ h $. Given a target TARL$ _0 = I $ and a target shift $ τ$, a bilevel problem calibrates $ h(k) $ by inner root-finding to satisfy the TARL$ _0 $ constraint and selects $ k^* $ by outer line search to minimize the out-of-control TARL$ _1 $. Both use a finite-state Markov-chain framework with an accurate ratio approximation; the inner step recovers boundary cases that fixed-$ k $ designs cannot. The chart is assessed through matched-horizon benchmarks against Shewhart-RZ, exponentially weighted moving average (EWMA-RZ), and fixed-$ k $ CUSUM-RZ$ ^+ $ charts, Monte Carlo robustness studies, and a Phase I estimation analysis. All memory-type charts outperform the Shewhart-RZ baseline; the adaptive design matches them under stable correlation and improves appreciably when correlation rises from Phase I to Phase II. It is insensitive to symmetric heavy tails yet mildly anti-conservative under contamination, and $ m \geq 100 $ subgroups keep the TARL$ _0 $ relative bias near 1%.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kim Duc Tran. 2026-07-07. An Adaptive Upper One-Sided Cumulative Sum Control Chart with Joint Parameter Optimization for Monitoring the Ratio of Two Normal Variables in Short Production Runs. https://arxiv.org/abs/2606.06137

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

KEEP EXPLORING

Related papers

Sample complexity and weak limits of nonsmooth multimarginal Schrödinger system with application to optimal transport barycenter

Multimarginal optimal transport (MOT) has emerged as a useful framework for many applied problems. However, compared to the well-studied classical two-marginal optimal transport theory, analysis of MOT is far more challenging and remains much less developed. In this paper, we study the statistical estimation and inference problems for the entropic MOT (EMOT), whose optimal solution is characterized by the multimarginal Schrödinger system. Assuming only boundedness of the cost function, we derive sharp sample complexity for estimating several key quantities pertaining to EMOT (cost functional and Schrödinger coupling) from point clouds that are randomly sampled from the input marginal distributions. Moreover, with substantially weaker smoothness assumption on the cost function than the existing literature, we derive distributional limits and bootstrap validity of various key EMOT objects. As an application, we propose the multimarginal Schrödinger barycenter as a new and natural way to regularize the exact Wasserstein barycenter and demonstrate its statistical optimality.

math.ST

Nonparametric spectral density estimation using interactive mechanisms under local differential privacy

We study the problem of estimating the spectral density of a centered stationary Gaussian time series under local differential privacy constraints. Specifically, we propose new interactive privacy mechanisms for three tasks: recovering a single covariance coefficient, recovering the spectral density at a fixed frequency, and global recovery. Our approach achieves faster rates through a two-stage process: we first apply the Laplace mechanism to the truncated value, and then use the resulting privatized sample to learn about the dependence mechanism in the time series. For spectral densities belonging to Hölder and Sobolev smoothness classes, we demonstrate that our algorithms improve upon the non-interactive mechanism of Kroll (2024) for small privacy parameter $α$, since the pointwise rates depend on $nα^2$ instead of $nα^4$. Moreover, we show that the rate $(nα^4)^{-1}$ is optimal for estimating a covariance coefficient with non-interactive mechanisms. However, the $L_2$ rate of our interactive estimator is slower than the pointwise rate. We show how to use these procedures to provide a bona fide locally differentially private estimator of the entire covariance matrix. A simulation study validates our findings.

math.ST

Estimating eigenvectors and eigenspaces of covariance matrices: Optimal Bounds and Conditions for Consistency

Let $X = [ ξ_1, \,\, ξ_2,...\,\, ,ξ_d]^\top$ be a zero-mean random vector of large dimension $d$ ($d \rightarrow \infty$) with (hidden) covariance matrix $M = (m_{ij})_{1 \leq i, j \leq d},$ where $m_{ij} = m_{ji} = \textbf{Cov}(ξ_i, ξ_j).$ Let $X_1, X_2, \dots, X_n$ be $n$ iid samples of $X$. Consider the sample covariance matrix $$\textstyle \tilde{M} := \frac{1}{n} \sum_{i=1}^{n} X_i X_i^\top.$$ In practice, one frequently uses the eigenvectors and eigenspaces of $\tilde M$ as estimators for those of $M$. A central task is to provide an error analysis for these estimators. In this paper, we provide an optimal error analysis, obtaining upper and lower bounds of matching order of magnitude, for a wide range of parameters $d$ and $n$, under mild assumptions on $M$. As corollaries, we obtain new necessary and sufficient conditions for the consistency of the estimators. In these conditions, we only require the number of samples $n$ to depend linearly on the effective rank of $M$, which can be much smaller than the dimension $d$.

math.ST