paper-with-me

Papers

Learning Various Length Dependence by Dual Recurrent Neural Networks

2020-05-28 · Chenpeng Zhang, Shuai Li, Mao Ye, Ce Zhu, Xue Li

Recurrent neural networks (RNNs) are widely used as a memory model for sequence-related problems. Many variants of RNN have been proposed to solve the gradient problems of training RNNs and process long sequences. Although some classical models have been proposed, capturing long-term dependence while responding to short-term changes remains a challenge. To this problem, we propose a new model named Dual Recurrent Neural Networks (DuRNN). The DuRNN consists of two parts to learn the short-term dependence and progressively learn the long-term dependence. The first part is a recurrent neural network with constrained full recurrent connections to deal with short-term dependence in sequence and generate short-term memory. Another part is a recurrent neural network with independent recurrent connections which helps to learn long-term dependence and generate long-term memory. A selection mechanism is added between two parts to help the needed long-term information transfer to the independent neurons. Multiple modules can be stacked to form a multi-layer model for better performance. Our contributions are: 1) a new recurrent model developed based on the divide-and-conquer strategy to learn long and short-term dependence separately, and 2) a selection mechanism to enhance the separating and learning of different temporal scales of dependence. Both theoretical analysis and extensive experiments are conducted to validate the performance of our model, and we also conduct simple visualization experiments and ablation analyses for the model interpretability. Experimental results indicate that the proposed DuRNN model can handle not only very long sequences (over 5000 time steps), but also short sequences very well. Compared with many state-of-the-art RNN models, our model has demonstrated efficient and better performance.

📄 PDF Abstract BibTeX arXiv:2005.13867

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Temporal Knowledge Graph Reasoning Triggered by Memories

2021-10-17 · Mengnan Zhao, Lihe Zhang, Yuqiu Kong, BaoCai Yin

Inferring missing facts in temporal knowledge graphs is a critical task and has been widely explored. Extrapolation in temporal reasoning tasks is more challenging and gradually attracts the attention of researchers sinc…

AttributeDecision MakingKnowledge GraphsRepresentation Learning

Gate Recurrent Unit Network based on Hilbert-Schmidt Independence Criterion for State-of-Health Estimation

2023-03-16 · Ziyue Huang, Lujuan Dang, Yuqing Xie, Wentao Ma 외

State-of-health (SOH) estimation is a key step in ensuring the safe and reliable operation of batteries. Due to issues such as varying data distribution and sequence length in different cycles, most existing methods requ…

On the Role of Noise in the Sample Complexity of Learning Recurrent Neural Networks: Exponential Gaps for Long Sequences

2023-05-28 · NeurIPS 2023 11

We consider the class of noisy multi-layered sigmoid recurrent neural networks with $w$ (unbounded) weights for classification of sequences of length $T$, where independent noise distributed according to $\mathcal{N}(0,\…

PAC learning

Deep Contextual Recurrent Residual Networks for Scene Labeling

2017-04-12 · T. Hoang Ngan Le, Chi Nhan Duong, Ligong Han, Khoa Luu 외

Designed as extremely deep architectures, deep residual networks which provide a rich visual representation and offer robust convergence behaviors have recently achieved exceptional performance in numerous computer visio…

Representation LearningScene Labeling

The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting

2026-07-01 · Konstantina Bairaktari, Kasper Green Larsen arxiv

Private continual counting is a fundamental problem in differential privacy: given a binary stream of length $n$, where each $1$ corresponds to the contribution of one individual, the goal is to release all running count…