An Algebraic Formalization of Forward and Forward-backward Algorithms
Ai Azuma, Masashi Shimbo, Yuji Matsumoto

TL;DR
This paper introduces an algebraic framework that unifies and generalizes various forward and forward-backward algorithms used in dynamic programming, parsing, and automatic differentiation, revealing their underlying structures.
Contribution
It provides a comprehensive algebraic formalization that subsumes many existing algorithms and offers a systematic way to design complex variants.
Findings
Unified algebraic framework for forward algorithms
Algebraic structures underlying complex computations
Systematic design of advanced forward-backward algorithms
Abstract
In this paper, we propose an algebraic formalization of the two important classes of dynamic programming algorithms called forward and forward-backward algorithms. They are generalized extensively in this study so that a wide range of other existing algorithms is subsumed. Forward algorithms generalized in this study subsume the ordinary forward algorithm on trellises for sequence labeling, the inside algorithm on derivation forests for CYK parsing, a unidirectional message passing on acyclic factor graphs, the forward mode of automatic differentiation on computation graphs with addition and multiplication, and so on. In addition, we reveal algebraic structures underlying complicated computation with forward algorithms. By the aid of the revealed algebraic structures, we also propose a systematic framework to design complicated variants of forward algorithms. Forward-backward algorithms…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Algorithms and Data Compression · Formal Methods in Verification
