Semantic Feature Segmentation for Interpretable Predictive Maintenance in Complex Systems

• URL: http://arxiv.org/abs/2605.14318v1
• Date: Thu, 14 May 2026 03:29:37 GMT
• Title: Semantic Feature Segmentation for Interpretable Predictive Maintenance in Complex Systems
• Abstract summary: This work proposes a semantic feature segmentation framework that decomposes the monitored feature space into a canonical component.<n>We show that the canonical space consistently achieves lower predictive risk than the residual space across multiple temporal configurations.<n>These findings suggest that semantic feature segmentation provides an interpretable and information-latency decomposition of monitoring signals.
• Score: 36.94429692322632
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Predictive maintenance in complex systems is often complicated by the heterogeneity and redundancy of monitored variables,which can obscure fault-relevant information and reduce model interpretability. This work proposes a semantic feature segmentation framework that decomposes the monitored feature space into a canonical component,expected to retain the dominant predictive information, and a residual component containing structurally peripheral signals. The segmentation is defined through domain informed criteria and sets up monitoring variables into functional groups reflecting operational mechanisms such as throughput,latency,pressure,network activity,and structural state. To evaluate the effectiveness of this decomposition, we adopt a predictive perspective in which expected predictive risk is used as an operational proxy for task-relevant information. Experimental results obtained through time-aware cross-validation show that the canonical space consistently achieves lower predictive risk than the residual space across multiple temporal configurations, indicating that the semantic segmentation concentrates the most relevant information for fault anticipation. In addition, the canonical segments exhibit significantly stronger intra-segment coherence than inter-segment dependence, and this structural organization remains stable after redundancy reduction. When compared with the full feature space and with a Principal Component Analysis (PCA) representation, the canonical space carries out comparable predictive performance and furthermore preserves the semantic meaning of the original variables. These findings suggest that semantic feature segmentation provides an interpretable and information-preserving decomposition of monitoring signals, enabling competitive predictive performance without sacrificing the operational interpretability required in predictive maintenance applications.

Related papers

• SAUF-Net: Structure--Appearance Representation Learning with Uncertainty Feedback for Semi-Supervised Medical Image Segmentation [11.11888950065648]
  We propose SAUF-Net, a structure--Appearance Representation Learning with Uncertainty Feedback Network for semi-supervised medical image segmentation.<n>We introduce an Appearance-Swapped Consistency branch to encourage structural representations to remain stable under appearance variations.<n>Experiments on ISIC-2016 and Kvasir-SEG demonstrate that SAUF-Net outperforms state-of-the-art semi-supervised methods.
  arXiv  Detail & Related papers  (2026-09-02T07:54:49Z)
• ControlledShifts: Towards Standardizing Robustness Evaluation in Trajectory Prediction Under Distribution Shifts [12.370065954075299]
  Trajectory prediction is central to safety in autonomous driving.<n>Many methods attempt to mitigate distribution shift degradation through data-centric or test-time adaptation approaches.<n>We introduce ControlledShifts, a framework that systematically re-splits existing trajectory datasets into in-distribution and out-of-distribution partitions.
  arXiv  Detail & Related papers  (2026-08-18T15:16:52Z)
• Breaking Structural Isolation: Scalable Graph Clustering via Community-Aware Sampling and Structural Entropy [57.058369251551795]
  Unsupervised graph clustering is a fundamental technique for uncovering underlying semantic patterns in large-scale networks.<n>We propose SCISE, a framework that preserves structural Integrity by synergizing community-aware sampling with constrained Structural Entropy.<n>We show that SCISE significantly outperforms state-of-the-art algorithms, with ablation studies and robustness analyses further validating its effectiveness and reliability for real-world large-scale graphs.
  arXiv  Detail & Related papers  (2026-07-06T07:55:53Z)
• AnchorMoE: Interpretable Time Series Classification via Anchor-Routed MoE [51.994752158953084]
  AnchorMoE is an interpretable-by-construction classification framework.<n>It encodes multi-view representations of local patches and routes them to specialized experts.<n>Experiments on real-world and synthetic benchmarks demonstrate that AnchorMoE achieves highly competitive classification performance.
  arXiv  Detail & Related papers  (2026-06-02T13:30:54Z)
• Factorize to Generalize: Retrieval-Guided Invariant-Dynamic Decomposition for Time Series Forecasting [64.2640656619583]
  Time series foundation models (TSFMs) have recently achieved strong zero-shot forecasting performance through large-scale pretraining and retrieval-augmented prediction.<n>We propose a Retrieval-guided Invariant-Dynamic DEcomposition framework for time series forecasting.
  arXiv  Detail & Related papers  (2026-05-24T07:31:55Z)
• Continual Segmentation under Joint Nonstationarity [8.522964568257455]
  Evolving data streams induce joint nonstationarity in continual semantic segmentation.<n>This setting reflects practical structured prediction systems, yet remains largely unexplored in prior continual learning work.<n>We formalize continual segmentation under coupled class, domain, and label shifts and investigate learning in heterogeneous dense prediction environments.
  arXiv  Detail & Related papers  (2026-05-19T22:20:00Z)
• K-Models: a Flexible and Interpretable Method for Ordinal Clustering with Application to Antigen-Antibody Interaction Profiles [65.21921642886367]
  K-Models is a novel framework that integrates ordinal constraints and estimates key underlying elements of the random process generating the observed functional profiles.<n>The proposed method is evaluated through simulations and real-world applications.
  arXiv  Detail & Related papers  (2026-05-14T13:35:44Z)
• Large Vision-Language Models Get Lost in Attention [51.851592109135716]
  We propose a unified framework grounded in information theory and geometry to quantify the geometric and entropic nature of residual updates.<n>Applying this unified framework reveals a fundamental functional decoupling: Attention acts as a subspace-language operator focused on reconfiguration, whereas FFNs serve as subspace-language operators driving semantic innovation.
  arXiv  Detail & Related papers  (2026-05-07T04:45:52Z)
• Weight-Informed Self-Explaining Clustering for Mixed-Type Tabular Data [63.62853416081748]
  WISE is a framework that unifies representation, feature weighting, clustering, and interpretation.<n>It produces faithful, human-interpretable explanations grounded in the same primitives that drive clustering.
  arXiv  Detail & Related papers  (2026-04-07T13:18:31Z)
• Transformer-Based Reinforcement Learning for Autonomous Orbital Collision Avoidance in Partially Observable Environments [0.3093890460224435]
  We introduce a Transformer-based Reinforcement Learning framework for autonomous orbital collision avoidance.<n>A central contribution of this work is the use of transformer-based Partially Observable Markov Decision Process architecture.<n>This integration provides a foundation for training collision avoidance agents that can operate more reliably under imperfect monitoring environments.
  arXiv  Detail & Related papers  (2026-02-05T04:57:58Z)
• CURVE: Learning Causality-Inspired Invariant Representations for Robust Scene Understanding via Uncertainty-Guided Regularization [30.613712415224473]
  CURVE is a framework that integrates variational uncertainty modeling with uncertainty-guided structural regularization to suppress high-variance relations.<n>Specifically, we apply prototype-conditioned debiasing to disentangle invariant interaction dynamics from environment-dependent variations, promoting a sparse and domain-stable topology.<n> Empirically, we evaluate CURVE in zero-shot transfer and low-data sim-to-real adaptation, verifying its ability to learn domain-stable sparse topologies and provide reliable uncertainty estimates to support risk prediction under distribution shifts.
  arXiv  Detail & Related papers  (2026-01-28T08:15:56Z)
• Priors in Time: Missing Inductive Biases for Language Model Interpretability [58.07412640266836]
  We show that Sparse Autoencoders impose priors that assume independence of concepts across time, implying stationarity.<n>We introduce a new interpretability objective -- Temporal Feature Analysis -- which possesses a temporal inductive bias to decompose representations at a given time into two parts.<n>Our results underscore the need for inductive biases that match the data in designing robust interpretability tools.
  arXiv  Detail & Related papers  (2025-11-03T18:43:48Z)
• Probabilistic Lexical Manifold Construction in Large Language Models via Hierarchical Vector Field Interpolation [0.0]
  The proposed methodology constructs a probabilistic function space where word representations adhere to topological consistency.<n>Probability constraints enhance lexical coherence by refining contextual relationships, leading to improvements in semantic stability across multiple linguistic distributions.<n>An assessment of computational efficiency reveals that while representations introduces minor processing overhead, the structured representation learning approach remains scalable for practical deployment.
  arXiv  Detail & Related papers  (2025-02-14T08:47:10Z)
• Structured Context Recomposition for Large Language Models Using Probabilistic Layer Realignment [0.0]
  This paper introduces a probabilistic layer realignment strategy that dynamically adjusts learned representations within transformer layers.<n>It mitigates abrupt topic shifts and logical inconsistencies, particularly in scenarios where sequences exceed standard attention window constraints.<n>While SCR incurs a moderate increase in processing time, memory overhead remains within feasible limits, making it suitable for practical deployment in autoregressive generative applications.
  arXiv  Detail & Related papers  (2025-01-29T12:46:42Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.