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

推荐订阅源

B
Blog RSS Feed
量子位
Recent Announcements
Recent Announcements
T
The Blog of Author Tim Ferriss
美团技术团队
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
Blog — PlanetScale
Blog — PlanetScale
H
Help Net Security
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
博客园 - Franky
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
宝玉的分享
宝玉的分享
大猫的无限游戏
大猫的无限游戏
V
Visual Studio Blog
博客园 - 聂微东
aimingoo的专栏
aimingoo的专栏
Microsoft Security Blog
Microsoft Security Blog
U
Unit 42
J
Java Code Geeks
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
IT之家
IT之家
Hugging Face - Blog
Hugging Face - Blog
腾讯CDC
L
LangChain Blog

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
On Symmetrized Pearson's Type Test for Normality of Autor...
Michael Boldin · 2020-04-04 · via math.ST updates on arXiv.org

We consider a stationary linear AR($p$) model with observations subject to gross errors (outliers). The autoregression parameters as well as the distribution function (d.f.) $G$ of innovations are unknown. The distribution of outliers $Π$ is unknown and arbitrary, their intensity is $γn^{-1/2}$ with an unknown $γ$, $n$ is the sample size. We test the hypothesis for normality of innovations $$\mathbf{H}_Φ\colon G \in \{Φ(x/θ),\,θ>0\},$$ $Φ(x)$ is the d.f. $\mathbf{N}(0,1)$. Our test is the special symmetrized Pearson's type test. We find the power of this test under local alternatives $$\mathbf{H}_{1n}(ρ)\colon G(x)=A_n(x):=(1-ρn^{-1/2})Φ(x/θ_0)+ρn^{-1/2}H(x), $$ $ρ\geq 0,\,θ_0$ is the unknown (under $\mathbf{H}_Φ$) variance of innovations. First of all we estimate the autoregression parameters and then using the residuals from the estimated autoregression we construct a kind of empirical distribution function (r.e.d.f.), which is a counterpart of the (inaccessible) e.d.f. of the autoregression innovations. After this we construct the symmetrized variant r.e.d.f. Our test statistic is the functional from symmetrized r.e.d.f. We obtain a stochastic expansion of this symmetrized r.e.d.f. under $\mathbf{H}_{1n}(ρ)$ , which enables us to investigate our test. We establish qualitative robustness of this test in terms of uniform equicontinuity of the limiting power (as functions of $γ,ρ$ and $Π$) with respect to $γ$ in a neighborhood of $γ=0$.