Generalized Convolution and Efficient Language Recognition

03/26/2019
by   Conal Elliott, et al.
0

Convolution is a broadly useful operation with applications including signal processing, machine learning, probability, optics, polynomial multiplication, and efficient parsing. Usually, however, this operation is understood and implemented in more specialized forms, hiding commonalities and limiting usefulness. This paper formulates convolution in the common algebraic framework of semirings and semimodules and populates that framework with various representation types. One of those types is the grand abstract template and itself generalizes to the free semimodule monad. Other representations serve varied uses and performance trade-offs, with implementations calculated from simple and regular specifications. Of particular interest is Brzozowski's method for regular expression matching. Uncovering the method's essence frees it from syntactic manipulations, while generalizing from boolean to weighted membership (such as multisets and probability distributions) and from sets to n-ary relations. The classic trie data structure then provides an elegant and efficient alternative to syntax. Pleasantly, polynomial arithmetic requires no additional implementation effort, works correctly with a variety of representations, and handles multivariate polynomials and power series with ease. Image convolution also falls out as a special case.

READ FULL TEXT
research
11/16/2022

Graph Filters for Signal Processing and Machine Learning on Graphs

Filters are fundamental in extracting information from data. For time se...
research
03/04/2016

Identifiability of an X-rank decomposition of polynomial maps

In this paper, we study a polynomial decomposition model that arises in ...
research
01/29/2022

A Novel Matrix-Encoding Method for Privacy-Preserving Neural Networks (Inference)

In this work, we present , a novel matrix-encoding method that is partic...
research
01/03/2019

Volumetric Convolution: Automatic Representation Learning in Unit Ball

Convolution is an efficient technique to obtain abstract feature represe...
research
03/21/2018

Truncated Normal Forms for Solving Polynomial Systems: Generalized and Efficient Algorithms

We consider the problem of finding the isolated common roots of a set of...
research
03/31/2018

Normal and Triangular Determinantal Representations of Multivariate Polynomials

In this paper we give a new and simple algorithm to put any multivariate...
research
04/25/2016

Generalized Homogeneous Polynomials for Efficient Template-Based Nonlinear Invariant Synthesis

The template-based method is one of the most successful approaches to al...

Please sign up or login with your details

Forgot password? Click here to reset