Message Propagation Through Time: An Algorithm for Sequence Dependency Retention in Time Series Modeling
Time series modeling, a crucial area in science, often encounters challenges when training Machine Learning (ML) models like Recurrent Neural Networks (RNNs) using the conventional mini-batch training strategy that assumes independent and identically distributed (IID) samples and initializes RNNs with zero hidden states. The IID assumption ignores temporal dependencies among samples, resulting in poor performance. This paper proposes the Message Propagation Through Time (MPTT) algorithm to effectively incorporate long temporal dependencies while preserving faster training times relative to the stateful solutions. MPTT utilizes two memory modules to asynchronously manage initial hidden states for RNNs, fostering seamless information exchange between samples and allowing diverse mini-batches throughout epochs. MPTT further implements three policies to filter outdated and preserve essential information in the hidden states to generate informative initial hidden states for RNNs, facilitating robust training. Experimental results demonstrate that MPTT outperforms seven strategies on four climate datasets with varying levels of temporal dependencies.
Code (0)
등록된 구현이 없습니다.
Tasks
Time SeriesSimilar Papers 제목 키워드 기반
Message Scheduling for Performant, Many-Core Belief Propagation
Belief Propagation (BP) is a message-passing algorithm for approximate inference over Probabilistic Graphical Models (PGMs), finding many applications such as computer vision, error-correcting codes, and protein-folding.…
GPUProtein FoldingSchedulingMulti-Agent Decentralized Belief Propagation on Graphs
We consider the problem of interactive partially observable Markov decision processes (I-POMDPs), where the agents are located at the nodes of a communication network. Specifically, we assume a certain message type for a…
Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classification
Graph neural network (GNN) and label propagation algorithm (LPA) are both message passing algorithms, which have achieved superior performance in semi-supervised classification. GNN performs feature propagation by a neur…
General ClassificationGraph Neural NetworkNode ClassificationNode Property PredictionDeep Attentive Belief Propagation: Integrating Reasoning and Learning for Solving Constraint Optimization Problems
Belief Propagation (BP) is an important message-passing algorithm for various reasoning tasks over graphical models, including solving the Constraint Optimization Problems (COPs). It has been shown that BP can achieve st…
Graph AttentionSelf-Supervised LearningReactive Message Passing for Scalable Bayesian Inference
We introduce Reactive Message Passing (RMP) as a framework for executing schedule-free, robust and scalable message passing-based inference in a factor graph representation of a probabilistic model. RMP is based on the r…
Bayesian InferenceState Space Models