Portrait of Clara Lacroce is unavailable

Clara Lacroce

Alumni

Publications

Optimal Approximate Minimization of One-Letter Weighted Finite Automata
Clara Lacroce
Borja Balle
Prakash Panangaden
Guillaume Rabusseau
2024-11-08
Mathematical Structures in Computer Science (published)
doi.org
arxiv.org
Length independent PAC-Bayes bounds for Simple RNNs
Volodimir Mitarchuk
Clara Lacroce
Rémi Eyraud
Rémi Emonet
Amaury Habrard
Guillaume Rabusseau
2024-04-18
Proceedings of The 27th International Conference on Artificial Intelligence and Statistics (published)
proceedings.mlr.press
Simulating weighted automata over sequences and trees with transformers
Michael Rizvi-Martel
Maude Lizaire
Clara Lacroce
Guillaume Rabusseau
2024-04-18
Proceedings of The 27th International Conference on Artificial Intelligence and Statistics (published)
doi.org
arxiv.org
Simulating Weighted Automata over Sequences and Trees with Transformers
Michael Rizvi
Maude Lizaire
Clara Lacroce
Guillaume Rabusseau
2024-03-12
ArXiv (preprint)
doi.org
arxiv.org
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 … (see more)when restricted to a given size. We reformulate the problem as a rank-minimization task in the spectral norm, and propose a framework to apply Adamyan-Arov-Krein (AAK) theory to the approximation problem. This approach has already been successfully applied to the case of WFAs and language modelling black boxes over one-letter alphabets \citep{AAK-WFA,AAK-RNN}. Extending the result to multi-letter alphabets requires solving the following two steps. First, we need to reformulate the approximation problem in terms of noncommutative Hankel operators and noncommutative functions, in order to apply results from multivariable operator theory. Secondly, to obtain the optimal approximation we need a version of noncommutative AAK theory that is constructive. In this paper, we successfully tackle the first step, while the second challenge remains open.
2022-06-01
ArXiv (preprint)
doi.org
arxiv.org
Extracting Weighted Automata for Approximate Minimization in Language Modelling
Clara Lacroce
Prakash Panangaden
Guillaume Rabusseau
2021-08-25
Proceedings of the Fifteenth International Conference on Grammatical Inference (published)
proceedings.mlr.press
arxiv.org
Optimal Spectral-Norm Approximate Minimization of Weighted Finite Automata
Borja Balle
Clara Lacroce
Prakash Panangaden
Doina Precup
Guillaume Rabusseau
We address the approximate minimization problem for weighted finite automata (WFAs) with weights in …
2021-02-13
ArXiv (preprint)
doi.org
arxiv.org