56 citations · 170 across the 32 of their papers we have counts for
6 papers · 1 filter
Optimal Approximate Minimization of One-Letter Weighted Finite Automata
Clara Lacroce, Borja Balle, Prakash Panangaden +1
In this paper, we study the approximate minimization problem of weighted finite automata (WFAs): to compute the best possible approximation of a WFA given a bound on the number of…
Towards an AAK Theory Approach to Approximate Minimization in the Multi-Letter Case
Clara Lacroce, Prakash Panangaden, Guillaume Rabusseau
We study the approximate minimization problem of weighted finite automata (WFAs): given a WFA, we want to compute its optimal approximation when restricted to a given size. We refo…
Optimal Spectral-Norm Approximate Minimization of Weighted Finite Automata
Borja Balle, Clara Lacroce, Prakash Panangaden +2
We address the approximate minimization problem for weighted finite automata (WFAs) with weights in , over a one-letter alphabet: to compute the best possible approxima…
Learning Graph Weighted Models on Pictures
Philip Amortila, Guillaume Rabusseau
Graph Weighted Models (GWMs) have recently been proposed as a natural generalization of weighted automata over strings and trees to arbitrary families of labeled graphs (and hyperg…
Neural Network Based Nonlinear Weighted Finite Automata
Tianyu Li, Guillaume Rabusseau, Doina Precup
Weighted finite automata (WFA) can expressively model functions defined over strings but are inherently linear models. Given the recent successes of nonlinear models in machine lea…
Recognizable Series on Hypergraphs
Raphaël Bailly, François Denis, Guillaume Rabusseau
We introduce the notion of Hypergraph Weighted Model (HWM) that generically associates a tensor network to a hypergraph and then computes a value by tensor contractions directed by…