This talk focuses on the Hankel matrix and Weighted Automata. After introducing these two notions and the main algorithm that links them, I will detail the spectral learning algorithm, a machine learning approach that comes with theoretical guarantees and interesting practical results. Extensions will be discussed with a particular insight on the extraction of weighted automata from any black box trained on (categorial) sequential data. If time allows it, a use case of an easy to use toolbox will be shown.
Petri Turing et en ligne