QBSD: Quartile-Based Seasonality Decomposition for Cost-Effective RAN KPI Forecasting

• URL: http://arxiv.org/abs/2306.05989v3
• Date: Mon, 04 Nov 2024 11:14:34 GMT
• Title: QBSD: Quartile-Based Seasonality Decomposition for Cost-Effective RAN KPI Forecasting
• Authors: Ebenezer RHP Isaac, Bulbul Singh,
• Abstract summary: We introduce QBSD, a live single-step forecasting approach tailored to optimize the trade-off between accuracy and computational complexity. QBSD has shown significant success with our real network RAN datasets of over several thousand cells. Results demonstrate that the proposed method excels in runtime efficiency compared to the leading algorithms available.
• Score: 0.18416014644193066
• License:
• Abstract: Forecasting time series patterns, such as cell key performance indicators (KPIs) of radio access networks (RAN), plays a vital role in enhancing service quality and operational efficiency. State-of-the-art forecasting approaches prioritize accuracy at the expense of computational performance, rendering them less suitable for data-intensive applications encompassing systems with a multitude of time series variables. They also do not capture the effect of dynamic operating ranges that vary with time. To address this issue, we introduce QBSD, a live single-step forecasting approach tailored to optimize the trade-off between accuracy and computational complexity. The method has shown significant success with our real network RAN KPI datasets of over several thousand cells. In this article, we showcase the performance of QBSD in comparison to other forecasting approaches on a dataset we have made publicly available. The results demonstrate that the proposed method excels in runtime efficiency compared to the leading algorithms available while maintaining competitive forecast accuracy that rivals neural forecasting methods.

Related papers

• Optimal starting point for time series forecasting [1.9937737230710553]
  We introduce a novel approach called Optimal Starting Point Time Series Forecast (OSP-TSP) By adjusting the sequence length via leveraging the XGBoost and LightGBM models, the proposed approach can determine optimal starting point (OSP) of the time series. Empirical results indicate that predictions based on the OSP-TSP approach consistently outperform those using the complete dataset.
  arXiv  Detail & Related papers  (2024-09-25T11:51:00Z)
• Enhancing Microgrid Performance Prediction with Attention-based Deep Learning Models [0.0]
  This research aims to address microgrid systems' operational challenges, characterized by power oscillations that contribute to grid instability. An integrated strategy is proposed, leveraging the strengths of convolutional and Gated Recurrent Unit (GRU) layers. The framework is anchored by a Multi-Layer Perceptron (MLP) model, which is tasked with comprehensive load forecasting.
  arXiv  Detail & Related papers  (2024-07-20T21:24:11Z)
• Stratified Prediction-Powered Inference for Hybrid Language Model Evaluation [62.2436697657307]
  Prediction-powered inference (PPI) is a method that improves statistical estimates based on limited human-labeled data. We propose a method called Stratified Prediction-Powered Inference (StratPPI) We show that the basic PPI estimates can be considerably improved by employing simple data stratification strategies.
  arXiv  Detail & Related papers  (2024-06-06T17:37:39Z)
• Share Your Secrets for Privacy! Confidential Forecasting with Vertical Federated Learning [5.584904689846748]
  Key challenges to address in manufacturing include data privacy and over-fitting on small and noisy datasets. We propose 'Secret-shared Time Series Forecasting with VFL', a novel framework that exhibits the following key features. Our results demonstrate that STV's forecasting accuracy is comparable to those of centralized approaches.
  arXiv  Detail & Related papers  (2024-05-31T12:27:38Z)
• Loss Shaping Constraints for Long-Term Time Series Forecasting [79.3533114027664]
  We present a Constrained Learning approach for long-term time series forecasting that respects a user-defined upper bound on the loss at each time-step. We propose a practical Primal-Dual algorithm to tackle it, and aims to demonstrate that it exhibits competitive average performance in time series benchmarks, while shaping the errors across the predicted window.
  arXiv  Detail & Related papers  (2024-02-14T18:20:44Z)
• A Meta-Learning Approach to Predicting Performance and Data Requirements [163.4412093478316]
  We propose an approach to estimate the number of samples required for a model to reach a target performance. We find that the power law, the de facto principle to estimate model performance, leads to large error when using a small dataset. We introduce a novel piecewise power law (PPL) that handles the two data differently.
  arXiv  Detail & Related papers  (2023-03-02T21:48:22Z)
• Low Complexity Adaptive Machine Learning Approaches for End-to-End Latency Prediction [0.0]
  This work is the design of efficient, low-cost adaptive algorithms for estimation, monitoring and prediction. We focus on end-to-end latency prediction, for which we illustrate our approaches and results on data obtained from a public generator provided after the recent international challenge on GNN.
  arXiv  Detail & Related papers  (2023-01-31T10:29:11Z)
• Grouped self-attention mechanism for a memory-efficient Transformer [64.0125322353281]
  Real-world tasks such as forecasting weather, electricity consumption, and stock market involve predicting data that vary over time. Time-series data are generally recorded over a long period of observation with long sequences owing to their periodic characteristics and long-range dependencies over time. We propose two novel modules, Grouped Self-Attention (GSA) and Compressed Cross-Attention (CCA) Our proposed model efficiently exhibited reduced computational complexity and performance comparable to or better than existing methods.
  arXiv  Detail & Related papers  (2022-10-02T06:58:49Z)
• Optimizing for the Future in Non-Stationary MDPs [52.373873622008944]
  We present a policy gradient algorithm that maximizes a forecast of future performance. We show that our algorithm, called Prognosticator, is more robust to non-stationarity than two online adaptation techniques.
  arXiv  Detail & Related papers  (2020-05-17T03:41:19Z)
• Deep Echo State Networks for Short-Term Traffic Forecasting: Performance Comparison and Statistical Assessment [8.586891288891263]
  In short-term traffic forecasting, the goal is to accurately predict future values of a traffic parameter of interest. Deep Echo State Networks achieve more accurate traffic forecasts than the rest of considered modeling counterparts.
  arXiv  Detail & Related papers  (2020-04-17T11:07:25Z)
• Transformer Hawkes Process [79.16290557505211]
  We propose a Transformer Hawkes Process (THP) model, which leverages the self-attention mechanism to capture long-term dependencies. THP outperforms existing models in terms of both likelihood and event prediction accuracy by a notable margin. We provide a concrete example, where THP achieves improved prediction performance for learning multiple point processes when incorporating their relational information.
  arXiv  Detail & Related papers  (2020-02-21T13:48:13Z)

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.