惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

P
Proofpoint News Feed
V
V2EX
WordPress大学
WordPress大学
Google DeepMind News
Google DeepMind News
Martin Fowler
Martin Fowler
小众软件
小众软件
Blog — PlanetScale
Blog — PlanetScale
月光博客
月光博客
The Cloudflare Blog
T
Tailwind CSS Blog
H
Help Net Security
腾讯CDC
爱范儿
爱范儿
人人都是产品经理
人人都是产品经理
H
Hackread – Cybersecurity News, Data Breaches, AI and More
The GitHub Blog
The GitHub Blog
Microsoft Security Blog
Microsoft Security Blog
Stack Overflow Blog
Stack Overflow Blog
D
DataBreaches.Net
C
Check Point Blog
量子位
酷 壳 – CoolShell
酷 壳 – CoolShell
美团技术团队
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com

math.ST updates on arXiv.org

What is Learnable in Valiant's Theory of the Learnable? Learning Perturbations to Extrapolate Your LLM Byzantine-Robust Distributed Sparse Learning Revisited The Sample Complexity of Multiple Change Point Identification under Bandit Feedback A proximal gradient algorithm for composite log-concave sampling Model-based Bootstrap of Controlled Markov Chains Approximation of Maximally Monotone Operators : A Graph Convergence Perspective Posterior Contraction Rates for Sparse Kolmogorov-Arnold Networks in Anisotropic Besov Spaces MIST: Reliable Streaming Decision Trees for Online Class-Incremental Learning via McDiarmid Bound A Spectral Framework for Closed-Form Relative Density Estimation Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability Higher-Order Equilibrium Tracking for EM-Compressible Online Estimation Scaling Limits of Long-Context Transformers A Note on Non-Negative $L_1$-Approximating Polynomials Susceptibilities and Patterning: A Primer on Linear Response in Bayesian Learning Linear Response Estimators for Singular Statistical Models Statistical inference with belief functions: A survey Robust stochastic first order methods in heavy-tailed noise via medoid mini-batch gradient sampling Every Feedforward Neural Network Definable in an o-Minimal Structure Has Finite Sample Complexity Adaptive auditing of AI systems with anytime-valid guarantees Locally Near Optimal Piecewise Linear Regression in High Dimensions via Difference of Max-Affine Functions Risk-Controlled Post-Processing of Decision Policies Covariate Balancing and Riesz Regression Should Be Guided by the Neyman Orthogonal Score in Debiased Machine Learning A Unified Pair-GRPO Family: From Implicit to Explicit Preference Constraints for Stable and General RL Alignment Time-Inhomogeneous Preconditioned Langevin Dynamics A Fine-Grained Understanding of Uniform Convergence for Halfspaces CITE: Anytime-Valid Statistical Inference in LLM Self-Consistency Ratio-based Loss Functions Optimal Confidence Band for Kernel Gradient Flow Estimator A renormalization-group inspired lattice-based framework for piecewise generalized linear models
Order-Induced Variance in the Moving-Range Sigma Estimato...
[Submitted on 23 Feb 2026 (v1), last revised 18 Jul 2026 (this v · 2026-02-24 · via math.ST updates on arXiv.org

View PDF HTML (experimental)

Abstract:I--MR charts commonly estimate the process standard deviation $\sigma$ via the span-2 average moving range divided by the unbiasing constant $d_2$; unlike the unbiased sample standard deviation ($S/c_4$), this estimator depends on ordering through adjacency, so permuting a fixed sample changes it. We formalize this by introducing an independent uniformly random permutation and applying the law of total variance, yielding an exact decomposition into a values component (variance of the permutation mean) and an adjacency component (expected conditional variance over permutations). The permutation mean is order-invariant and equals $\GMD/d_2$, where $\GMD$ is the sample Gini mean difference. Under i.i.d.\ Normal sampling, both components admit closed forms; the adjacency fraction converges to $0.3813$, and the familiar asymptotic efficiency loss relative to $S/c_4$ is almost entirely an adjacency effect.

Submission history

From: Andrew Karl [view email]
[v1] Mon, 23 Feb 2026 16:15:07 UTC (19 KB)
[v2] Sat, 7 Mar 2026 03:22:07 UTC (8 KB)
[v3] Tue, 10 Mar 2026 11:21:17 UTC (8 KB)
[v4] Sat, 18 Jul 2026 16:28:10 UTC (30 KB)