Article

A Canonical Form for Weighted Automata and Applications to Approximate Minimization

Authors:

Prakash Panangaden,

Doina PrecupAuthors Info & Claims

LICS '15: Proceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

Pages 701 - 712

https://doi.org/10.1109/LICS.2015.70

Published: 06 July 2015 Publication History

First page of PDF

References

[1]

N. Bezhanishvili, C. Kupke, and P. Panangaden, "Minimization via duality," in Logic, Language, Information and Computation - 19th International Workshop, WoLLIC 2012, Buenos Aires, Argentina, September 3-6, 2012. Proceedings, ser. Lecture Notes in Computer Science, vol. 7456. Springer, 2012, pp. 191-205.

[2]

F. Bonchi, M. M. Bonsangue, H. H. Hansen, P. Panangaden, J. Rutten, and A. Silva, "Algebra-coalgebra duality in Brzozowski's minimization algorithm," ACM Transactions on Computational Logic, 2014.

Digital Library

[3]

J. A. Brzozowski, "Canonical regular expressions and minimal state graphs for definite events," in Proceedings of the Symposium on Mathematical Theory of Automata, ser. MRI Symposia Series, J. Fox, Ed. Polytechnic Press of the Polytechnic Institute of Brooklyn, April 1962, no. 12, pp. 529-561, book appeared in 1963.

[4]

M. Boreale, "Weighted bisimulation in linear algebraic form," in CONCUR 2009-Concurrency Theory. Springer, 2009, pp. 163-177.

Digital Library

[5]

F. Bonchi, M. Bonsangue, M. Boreale, J. Rutten, and A. Silva, "A coalgebraic perspective in linear weighted automata," Information and Computation, vol. 211, pp. 77-105, 2012.

Digital Library

[6]

D. Hsu, S. M. Kakade, and T. Zhang, "A spectral algorithm for learning hidden Markov models," in COLT, 2009.

[7]

R. Bailly, F. Denis, and L. Ralaivola, "Grammatical inference as a principal component analysis problem," in ICML, 2009.

Digital Library

[8]

S. M. Siddiqi, B. Boots, and G. Gordon, "Reduced-rank hidden Markov models," in AISTATS, 2010.

[9]

B. Boots, S. Siddiqi, and G. Gordon, "Closing the learning-planning loop with predictive state representations," in Proceedings of Robotics: Science and Systems VI, 2009.

[10]

B. Balle, A. Quattoni, and X. Carreras, "A spectral learning algorithm for finite state transducers," in ECML-PKDD, 2011.

Digital Library

[11]

R. Bailly, X. Carreras, and A. Quattoni, "Unsupervised spectral learning of finite state transducers," in NIPS, 2013.

[12]

R. Bailly, "Quadratic weighted automata: Spectral algorithm and likelihood maximization," in ACML, 2011.

[13]

B. Balle and M. Mohri, "Spectral learning of general weighted automata via constrained matrix completion," in NIPS, 2012.

[14]

A. Recasens and A. Quattoni, "Spectral learning of sequence taggers over continuous sequences," in ECML-PKDD, 2013.

Digital Library

[15]

B. Balle, X. Carreras, F. Luque, and A. Quattoni, "Spectral learning of weighted automata: A forward-backward perspective," Machine Learning, 2014.

Digital Library

[16]

M. Mohri, F. C. N. Pereira, and M. Riley, "Speech recognition with weighted finite-state transducers," in Handbook on Speech Processing and Speech Communication, 2008.

[17]

J. Albert and J. Kari, "Digital image compression," in Handbook of Weighted Automata, 2009.

[18]

K. Knight and J. May, "Applications of weighted automata in natural language processing," in Handbook of Weighted Automata, 2009.

[19]

C. Baier, M. Größer, and F. Ciesinski, "Model checking linear-time properties of probabilistic systems," in Handbook of Weighted automata, 2009.

[20]

A. de Gispert, G. Iglesias, G. Blackwood, E. Banga, and W. Byrne, "Hierarchical phrase-based translation with weighted finite-state transducers and shallow-n grammars," Computational Linguistics, 2010.

Digital Library

[21]

A. P. Dempster, N. M. Laird, and D. B. Rubin, "Maximum likelihood from incomplete data via the EM algorithm," Journal of the Royal Statistical Society, 1977.

[22]

B. Balle, W. Hamilton, and J. Pineau, "Methods of moments for learning stochastic languages: Unified presentation and empirical comparison," in ICML, 2014.

[23]

A. Kulesza, N. R. Rao, and S. Singh, "Low-Rank Spectral Learning," in Proceedings of the Seventeenth International Conference on Artificial Intelligence and Statistics, 2014, pp. 522-530.

[24]

A. Kulesza, N. Jiang, and S. Singh, "Low-rank spectral learning with weighted loss functions," in Proceedings of the Eighteenth International Conference on Artificial Intelligence and Statistics, 2015.

[25]

S. Kiefer and B. Wachter, "Stability and complexity of minimising probabilistic automata," in Proceedings of the 41st International Colloquium on Automata, Languages and Programming (ICALP), part II, ser. LNCS, J. E. et al., Ed., vol. 8573. Copenhagen, Denmark: Springer, 2014, pp. 268-279.

[26]

K. Zhu, Operator Theory in Function Spaces. American Mathematical Society, 1990, vol. 138.

[27]

J. Berstel and C. Reutenauer, Noncommutative Rational Series with Applications. Cambridge University Press, 2011.

[28]

P. Dupont, F. Denis, and Y. Esposito, "Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms," Pattern Recognition, 2005.

Digital Library

[29]

L. R. Rabiner, "A tutorial on hidden markov models and selected applications in speech recognition," in Readings in speech recognition, A. Waibel and K. Lee, Eds., 1990, pp. 267-296.

Digital Library

[30]

S. Singh, M. James, and M. Rudary, "Predictive state representations: a new theory for modeling dynamical systems," in Proceedings of the 20th Conference on Uncertainty in Artificial Intelligence, 2004.

Digital Library

[31]

R. Bailly and F. Denis, "Absolute convergence of rational series is semi-decidable," Inf. Comput., vol. 209, no. 3, pp. 280-295, 2011. [Online]. Available: http://dx.doi.org/10.1016/j.ic.2010.11.004

Digital Library

[32]

L. N. Trefethen and D. Bau III, Numerical linear algebra. Siam, 1997.

[33]

B. Balle, P. Panangaden, and D. Precup, "A canonical form for weighted automata and applications to approximate minimization," CoRR, vol. abs/1501.06841, 2015. [Online]. Available: http://arxiv.org/abs/1501.06841

[34]

R. Bhatia, Matrix analysis. Springer, 1997, vol. 169.

[35]

R. Bailly, "Méthodes spectrales pour l'inférence grammaticale probabiliste de langages stochastiques rationnels," Ph.D. dissertation, Aix-Marseille Université, 2011.

[36]

F. Denis, Personal communication, 2015.

[37]

S. V. Lototsky, "Simple spectral bounds for sums of certain kronecker products," Linear Algebra and its Applications, vol. 469, pp. 114-129, 2015.

[38]

M. Collins and S. B. Cohen, "Tensor decomposition for fast parsing with latent-variable PCFGs," in NIPS, 2012.

[39]

S. B. Cohen, G. Satta, and M. Collins, "Approximate PCFG parsing using tensor decomposition," in NAACL, 2013.

Cited By

Bonnevie RSchmidt M(2021)Matrix product states for inference in discrete probabilistic modelsThe Journal of Machine Learning Research10.5555/3546258.354644522:1(8396-8443)Online publication date: 1-Jan-2021
https://dl.acm.org/doi/10.5555/3546258.3546445
Balle BMohri M(2015)On the Rademacher Complexity of Weighted AutomataProceedings of the 26th International Conference on Algorithmic Learning Theory - Volume 935510.1007/978-3-319-24486-0_12(179-193)Online publication date: 4-Oct-2015
https://dl.acm.org/doi/10.1007/978-3-319-24486-0_12

Recommendations

Bisimulation Minimisation of Weighted Automata on Unranked Trees

Several models of automata are available that operate unranked trees. Two well-known examples are the stepwise unranked tree automaton (suta) and the parallel unranked tree automaton (puta). By adding a weight, taken from some semiring, to every ...
Bisimulation Minimisation of Weighted Automata on Unranked Trees

Several models of automata are available that operate unranked trees. Two well-known examples are the stepwise unranked tree automaton (suta) and the parallel unranked tree automaton (puta). By adding a weight, taken from some semiring, to every ...
Weighted restarting automata and pushdown relations

Weighted restarting automata have been introduced to study quantitative aspects of computations of restarting automata. Here we study the special case that words over a given (output) alphabet are assigned as weights to the transitions of a restarting ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

LICS '15: Proceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

July 2015

776 pages

ISBN:9781479988754

Sponsors

In-Cooperation

EACSL: European Association for Computer Science Logic

Publisher

IEEE Computer Society

United States

Publication History

Published: 06 July 2015

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 215 of 622 submissions, 35%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
55
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Bonnevie RSchmidt M(2021)Matrix product states for inference in discrete probabilistic modelsThe Journal of Machine Learning Research10.5555/3546258.354644522:1(8396-8443)Online publication date: 1-Jan-2021
https://dl.acm.org/doi/10.5555/3546258.3546445
Balle BMohri M(2015)On the Rademacher Complexity of Weighted AutomataProceedings of the 26th International Conference on Algorithmic Learning Theory - Volume 935510.1007/978-3-319-24486-0_12(179-193)Online publication date: 4-Oct-2015
https://dl.acm.org/doi/10.1007/978-3-319-24486-0_12

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents