返回
The Kernel Adaptive Autoregressive-Moving-Average Algorithm
DOI:10.1109/TNNLS.2015.2418323.png)
摘要
En 中文
In this paper, we present a novel kernel adaptive recurrent filtering algorithm based on the autoregressive-moving-average (ARMA) model, which is trained with recurrent stochastic gradient descent in the reproducing kernel Hilbert spaces. This kernelized recurrent system, the kernel adaptive ARMA (KAARMA) algorithm, brings together the theories of adaptive signal processing and recurrent neural networks (RNNs), extending the current theory of kernel adaptive filtering (KAF) using the representer theorem to include feedback. Compared with classical feedforward KAF methods, the KAARMA algorithm provides general nonlinear solutions for complex dynamical systems in a state-space representation, with a deferred teacher signal, by propagating forward the hidden states. We demonstrate its capabilities to provide exact solutions with compact structures by solving a set of benchmark nondeterministic polynomial-complete problems involving grammatical inference. Simulation results show that the KAARMA algorithm outperforms equivalent input-space recurrent architectures using first-and second-order RNNs, demonstrating its potential as an effective learning solution for the identification and synthesis of deterministic finite automata.
Keyword:
Deterministic finite automaton (DFA)
kernel adaptive filtering (KAF)
recurrent neural network (RNN)
reproducing kernel Hilbert space (RKHS)
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.9
论文数:
7.6K
被引数:
7.2W
机构
引用论文
Análise da qualidade do encolamento de partículas de painéis OSB em condições de laboratório
CERNE
IF0
On-line identification and reconstruction of finite automata with generalized recurrent neural networks
NEURAL NETWORKS
IF6.3


