Boosted Enhanced Quantile Regression Neural Networks with Spatiotemporal Permutation Entropy for Complex System Prognostics
This paper presents an integrative prognostic framework that combines Spatiotemporal Permutation Entropy (STPE), Boosted Enhanced Quantile Regression Neural Networks (B-EQRNNs), Gated Temporal Attention, a Spiking Neural Network (SNN) refinement stage, and a Temporal Fusion Transformer (TFT) classifier. The motivation is long-horizon fault prediction in distributed industrial electronic systems, where single-sensor or point-estimate models can miss weak spatially propagating degradation signatures and provide limited uncertainty information. The proposed pipeline first converts 70-channel sensor streams into multiscale STPE descriptors, then learns conditional quantile representations and attention-weighted temporal context before final Normal/Abnormal classification. Evaluation is reported on a nine-system industrial electronic-sensor dataset with 48-, 90-, and 168-hour prediction horizons. The comparison includes a tree-based LightGBM baseline and modern sequence baselines available under the same preprocessing protocol, including LSTM, Autoformer, and TCN models. The full pipeline reaches 81.17% accuracy at the 168-hour horizon and is evaluated with component ablations, computational-cost analysis, and an explicit reproducibility protocol. The contribution is therefore framed as a validated hybrid architecture for uncertainty-aware spatiotemporal prognostics rather than as a new standalone learning theory.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Improved conformalized quantile regression
Conformalized quantile regression is a procedure that inherits the advantages of conformal prediction and quantile regression. That is, we use quantile regression to estimate the true conditional quantile and then apply …
Conformal PredictionPredictionPrediction Intervalsquantile regression+1A Case for Library-Level k-Means Binning in Histogram Gradient-Boosted Trees
Modern gradient-boosted decision trees (GBDTs) accelerate split finding with histogram-based binning, which reduces complexity from O(N) to O(B) given a fixed bin budget B. However, the predominant quantile binning strat…
GPUQuantile Geometry Regularization for Distributional Reinforcement Learning
Quantile-based distributional reinforcement learning methods learn return distributions through sampled quantile regression, but their bootstrapped target quantiles may induce distorted or degenerate distribution estimat…
Reinforcement LearningAtari GamesSEMF: Supervised Expectation-Maximization Framework for Predicting Intervals
This work introduces the Supervised Expectation-Maximization Framework (SEMF), a versatile and model-agnostic approach for generating prediction intervals with any ML model. SEMF extends the Expectation-Maximization algo…
PredictionPrediction Intervalsquantile regressionregression+1Conformal Graph Prediction with Z-Gromov-Wasserstein Distances
Supervised graph prediction addresses regression problems where the outputs are structured graphs. Although several approaches exist for graph-valued prediction, principled uncertainty quantification remains limited. We …