@inproceedings{97fdbb238fc4462bb1072592ccc128e4,

title = "Efficient computation of the relative entropy of probabilistic automata",

abstract = "The problem of the efficient computation of the relative entropy of two distributions represented by deterministic weighted automata arises in several machine learning problems. We show that this problem can be naturally formulated as a shortest-distance problem over an intersection automaton denned on an appropriate semiring. We describe simple and efficient novel algorithms for its computation and report the results of experiments demonstrating the practicality of our algorithms for very large weighted automata. Our algorithms apply to unambiguous weighted automata, a class of weighted automata that strictly includes deterministic weighted automata. These are also the first algorithms extending the computation of entropy or of relative entropy beyond the class of deterministic weighted automata.",

author = "Corinna Cortes and Mehryar Mohri and Ashish Rastogi and Riley, {Michael D.}",

year = "2006",

doi = "10.1007/11682462_32",

language = "English (US)",

isbn = "354032755X",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "323--336",

booktitle = "LATIN 2006",

note = "LATIN 2006: Theoretical Informatics - 7th Latin American Symposium ; Conference date: 20-03-2006 Through 24-03-2006",

}