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

推荐订阅源

人人都是产品经理
人人都是产品经理
Apple Machine Learning Research
Apple Machine Learning Research
云风的 BLOG
云风的 BLOG
罗磊的独立博客
博客园 - 三生石上(FineUI控件)
量子位
GbyAI
GbyAI
腾讯CDC
T
Tailwind CSS Blog
博客园 - Franky
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
D
Docker
G
Google Developers Blog
aimingoo的专栏
aimingoo的专栏
The GitHub Blog
The GitHub Blog
Microsoft Security Blog
Microsoft Security Blog
Stack Overflow Blog
Stack Overflow Blog
Hugging Face - Blog
Hugging Face - Blog
小众软件
小众软件
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
N
Netflix TechBlog - Medium
Jina AI
Jina AI
IT之家
IT之家
Y
Y Combinator Blog

cs.IT updates on arXiv.org

Theoretical Limits of Language Model Alignment $f$-Divergence Regularized RLHF: Two Tales of Sampling and Unified Analyses A Unified Measure-Theoretic View of Diffusion, Score-Based, and Flow Matching Generative Models When Can Voting Help, Hurt, or Change Course? Exact Structure of Binary Test-Time Aggregation When Semantic Communication Meets Queueing: Cross-Layer Latency and Task Fidelity Optimization Convexity in Disguise: A Theoretical Framework for Nonconvex Low-Rank Matrix Estimation Conditional Diffusion Under Linear Constraints: Langevin Mixing and Information-Theoretic Guarantees Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Expert Routing for Communication-Efficient MoE via Finite Expert Banks Contextual Memory-Enhanced Source Coding for Low-SNR Communications Realizable Bayes-Consistency for General Metric Losses Leveraging Code Automorphisms for Improved Syndrome-Based Neural Decoding A Hierarchical Sampling Framework for bounding the Generalization Error of Federated Learning Dueling DDQN-Based Adaptive Multi-Objective Handover Optimization for LEO Satellite Networks The Causal Description Gap: Information-Theoretic Separations Across Pearl's Hierarchy Optimization of CV-QKD Under Practical Constraints Benchmarking Wireless Representations: High-Dimensional vs. Compressed Embeddings for Efficiency and Robustness Real-Time Text Transmission via LLM-Based Entropy Coding over Fixed-Rate Channels SwiftChannel: Algorithm-Hardware Co-Design for Deep Learning-Based 5G Channel Estimation Evolving Token Communication with Parametric Memory Network Remote Action Generation: Remote Control with Minimal Communication The (Marginal) Value of a Search Ad: An Online Causal Framework for Repeated Second-price Auctions Stabilizing Private LASSO under Heterogeneous Covariates via Anisotropic Objective Perturbation Linear-Readout Floors and Threshold Recovery in Computation in Superposition Soft Graph Diffusion Transformer for MIMO Detection Hierarchical Federated Learning for Networked AI: From Communication Saving to Architecture-Aware Design Exponential families from a single KL identity MIFair: A Mutual-Information Framework for Intersectionality and Multiclass Fairness Diffusion-OAMP for Joint Image Compression and Wireless Transmission Decoupled Descent: Exact Test Error Tracking Via Approximate Message Passing
Detection of Intermittent Faults Based on an Optimally We...
Yinghong Zhao, Xiao He, Junfeng Zhang, Hongquan Ji, Donghua Zhou · 2020-05-14 · via cs.IT updates on arXiv.org

The moving average (MA)-type scheme, also known as the smoothing method, has been well established within the multivariate statistical process monitoring (MSPM) framework since the 1990s. However, its theoretical basis is still limited to smoothing independent data, and the optimality of its equally or exponentially weighted scheme remains unproven. This paper aims to weaken the independence assumption in the existing MA method, and then extend it to a broader area of dealing with autocorrelated weakly stationary processes. With the discovery of the non-optimality of the equally and exponentially weighted schemes used for fault detection when data have autocorrelation, the essence that they do not effectively utilize the correlation information of samples is revealed, giving birth to an optimally weighted moving average (OWMA) theory. The OWMA method is combined with the Hotelling's $T^2$ statistic to form an OWMA $T^2$ control chart (OWMA-TCC), in order to detect a more challenging type of fault, i.e., intermittent fault (IF). Different from the MA scheme that puts an equal weight on samples within a time window, OWMA-TCC uses correlation (autocorrelation and cross-correlation) information to find an optimal weight vector (OWV) for the purpose of IF detection (IFD). In order to achieve a best IFD performance, the concept of IF detectability is defined and corresponding detectability conditions are provided, which further serve as selection criteria of the OWV. Then, the OWV is given in the form of a solution to nonlinear equations, whose existence is proven with the aid of the Brouwer fixed-point theory. Moreover, symmetrical structure of the OWV is revealed, and the optimality of the MA scheme for any IF directions when data exhibit no autocorrelation is proven.