mlsanityData to 7 Oct 2026

Connecting Weighted Automata and Recurrent Neural Networks through Spectral Learning

arXiv 1807.01406 ↗First posted 4 Jul 2018cs.LG cs.FL stat.MLcited by 15

Not on the map. Why?

Abstract (arXiv)

In this paper, we unravel a fundamental connection between weighted finite automata~(WFAs) and second-order recurrent neural networks~(2-RNNs): in the case of sequences of discrete symbols, WFAs and 2-RNNs with linear activation functions are expressively equivalent. Motivated by this result, we build upon a recent extension of the spectral learning algorithm to vector-valued WFAs and propose the first provable learning algorithm for linear 2-RNNs defined over sequences of continuous input vectors. This algorithm relies on estimating low rank sub-blocks of the so-called Hankel tensor, from which the parameters of a linear 2-RNN can be provably recovered. The performances of the proposed method are assessed in a simulation study.

Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). First posted on arXiv 4 Jul 2018.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 7; 2022: 3; 2023: 1; 2024: 3; 2025: 1.

15 papers.

Sort:

By area: