Efficiently improving key weather variables forecasting by performing the guided iterative prediction in latent space

• URL: http://arxiv.org/abs/2407.19187v1
• Date: Sat, 27 Jul 2024 05:56:37 GMT
• Title: Efficiently improving key weather variables forecasting by performing the guided iterative prediction in latent space
• Authors: Shuangliang Li, Siwei Li,
• Abstract summary: We propose an 'encoding-prediction-decoding' prediction network. It can adaptively extract key variable-related low-dimensional latent feature from more input atmospheric variables. We improve the HTA algorithm in citebi2023accurate by inputting more time steps to enhance the temporal correlation between the prediction results and input variables.
• Score: 0.8885727065823155
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Weather forecasting refers to learning evolutionary patterns of some key upper-air and surface variables which is of great significance. Recently, deep learning-based methods have been increasingly applied in the field of weather forecasting due to their powerful feature learning capabilities. However, prediction methods based on the original space iteration struggle to effectively and efficiently utilize large number of weather variables. Therefore, we propose an 'encoding-prediction-decoding' prediction network. This network can efficiently benefit to more related input variables with key variables, that is, it can adaptively extract key variable-related low-dimensional latent feature from much more input atmospheric variables for iterative prediction. And we construct a loss function to guide the iteration of latent feature by utilizing multiple atmospheric variables in corresponding lead times. The obtained latent features through iterative prediction are then decoded to obtain the predicted values of key variables in multiple lead times. In addition, we improve the HTA algorithm in \cite{bi2023accurate} by inputting more time steps to enhance the temporal correlation between the prediction results and input variables. Both qualitative and quantitative prediction results on ERA5 dataset validate the superiority of our method over other methods. (The code will be available at https://github.com/rs-lsl/Kvp-lsi)

Related papers

• Exploring the Role of Token in Transformer-based Time Series Forecasting [10.081240480138487]
  Transformer-based methods are a mainstream approach for solving time series forecasting (TSF) Most focus on optimizing the model structure, with few studies paying attention to the role of tokens for predictions. We find that the gradients mainly depend on tokens that contribute to the predicted series, called positive tokens. To utilize T-PE and V-PE, we propose T2B-PE, a Transformer-based dual-branch framework.
  arXiv  Detail & Related papers  (2024-04-16T07:21:39Z)
• Contrastive Difference Predictive Coding [79.74052624853303]
  We introduce a temporal difference version of contrastive predictive coding that stitches together pieces of different time series data to decrease the amount of data required to learn predictions of future events. We apply this representation learning method to derive an off-policy algorithm for goal-conditioned RL.
  arXiv  Detail & Related papers  (2023-10-31T03:16:32Z)
• ASPEST: Bridging the Gap Between Active Learning and Selective Prediction [56.001808843574395]
  Selective prediction aims to learn a reliable model that abstains from making predictions when uncertain. Active learning aims to lower the overall labeling effort, and hence human dependence, by querying the most informative examples. In this work, we introduce a new learning paradigm, active selective prediction, which aims to query more informative samples from the shifted target domain.
  arXiv  Detail & Related papers  (2023-04-07T23:51:07Z)
• A Meta-Analysis of Solar Forecasting Based on Skill Score [0.0]
  We conduct the first comprehensive meta-analysis of deterministic solar forecasting based on skill score. A database of 4,687 points was built and analyzed. More improvement is observed for intra-hour and intra-day than day-ahead forecasts.
  arXiv  Detail & Related papers  (2022-08-22T18:37:01Z)
• Efficient and Differentiable Conformal Prediction with General Function Classes [96.74055810115456]
  We propose a generalization of conformal prediction to multiple learnable parameters. We show that it achieves approximate valid population coverage and near-optimal efficiency within class. Experiments show that our algorithm is able to learn valid prediction sets and improve the efficiency significantly.
  arXiv  Detail & Related papers  (2022-02-22T18:37:23Z)
• A computationally efficient neural network for predicting weather forecast probabilities [0.0]
  We take the novel approach of using a neural network to predict probability density functions rather than a single output value. This enables the calculation of both uncertainty and skill metrics for the neural network predictions. This approach is purely data-driven and the neural network is trained on the WeatherBench dataset.
  arXiv  Detail & Related papers  (2021-03-26T12:28:15Z)
• Evaluating Prediction-Time Batch Normalization for Robustness under Covariate Shift [81.74795324629712]
  We call prediction-time batch normalization, which significantly improves model accuracy and calibration under covariate shift. We show that prediction-time batch normalization provides complementary benefits to existing state-of-the-art approaches for improving robustness. The method has mixed results when used alongside pre-training, and does not seem to perform as well under more natural types of dataset shift.
  arXiv  Detail & Related papers  (2020-06-19T05:08:43Z)
• Ambiguity in Sequential Data: Predicting Uncertain Futures with Recurrent Models [110.82452096672182]
  We propose an extension of the Multiple Hypothesis Prediction (MHP) model to handle ambiguous predictions with sequential data. We also introduce a novel metric for ambiguous problems, which is better suited to account for uncertainties.
  arXiv  Detail & Related papers  (2020-03-10T09:15:42Z)
• Value-driven Hindsight Modelling [68.658900923595]
  Value estimation is a critical component of the reinforcement learning (RL) paradigm. Model learning can make use of the rich transition structure present in sequences of observations, but this approach is usually not sensitive to the reward function. We develop an approach for representation learning in RL that sits in between these two extremes. This provides tractable prediction targets that are directly relevant for a task, and can thus accelerate learning the value function.
  arXiv  Detail & Related papers  (2020-02-19T18:10:20Z)
• Early Forecasting of Text Classification Accuracy and F-Measure with Active Learning [0.7614628596146599]
  We investigate the difference in forecasting difficulty when using accuracy and F-measure as the text classification system performance metrics. We find that forecasting is easiest for decision tree learning, moderate for Support Vector Machines, and most difficult for neural networks.
  arXiv  Detail & Related papers  (2020-01-20T06:27:33Z)

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.