Learning Closed Signal Flow Graphs
<|reference_start|>Learning Closed Signal Flow Graphs: We develop a learning algorithm for closed signal flow graphs - a graphical model of signal transducers. The algorithm relies on the correspondence between closed signal flow graphs and weighted finite automata on a singleton alphabet. We demonstrate that this procedure results in a genuine reduction of complexity: our algorithm fares better than existing learning algorithms for weighted automata restricted to the case of a singleton alphabet.<|reference_end|>
@article{piotrovskaya2024learning,
    title={Learning Closed Signal Flow Graphs},
    author={Ekaterina Piotrovskaya, Leo Lobski, Fabio Zanasi},
    journal={arXiv preprint arXiv:2407.00245},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.00245},
    primaryClass={cs.LO cs.LG}
}