메뉴 건너뛰기




Volumn 473, Issue , 2013, Pages 46-60

Learning probabilistic automata: A study in state distinguishability

Author keywords

Distribution learning; PAC learning; Probabilistic automata; Statistical queries

Indexed keywords

DISTINGUISHABILITY; DISTRIBUTION LEARNING; INPUT PARAMETER; LOWER BOUNDS; NUMBER OF STATE; PAC LEARNING; PROBABILISTIC AUTOMATA; STATISTICAL QUERIES; TARGET MACHINES; TECHNICAL TOOLS; TIME POLYNOMIALS;

EID: 84873286019     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2012.10.009     Document Type: Conference Paper
Times cited : (16)

References (24)
  • 1
    • 56649103578 scopus 로고    scopus 로고
    • Towards feasible pac-learning of probabilistic deterministic finite automata
    • Springer-Verlag Berlin, Heidelberg 978-3-540-88008-0 10.1007/978-3-540- 88009-713
    • J. Castro, and R. Gavaldà Towards feasible pac-learning of probabilistic deterministic finite automata ICGI '08: Proceedings of the 9th International Colloquium on Grammatical Inference 2008 Springer-Verlag Berlin, Heidelberg 978-3-540-88008-0 163 174 10.1007/978-3-540-88009-713
    • (2008) ICGI '08: Proceedings of the 9th International Colloquium on Grammatical Inference , pp. 163-174
    • Castro, J.1    Gavaldà, R.2
  • 2
    • 78249250855 scopus 로고    scopus 로고
    • A lower bound for learning distributions generated by probabilistic automata
    • M. Hutter, F. Stephan, V. Vovk, T. Zeugmann, Lecture Notes in Computer Science Springer Berlin/Heidelberg 10.1007/978-3-642-16108-717
    • B. Balle, J. Castro, and R. Gavaldà A lower bound for learning distributions generated by probabilistic automata M. Hutter, F. Stephan, V. Vovk, T. Zeugmann, Algorithmic Learning Theory Lecture Notes in Computer Science vol. 6331 2010 Springer Berlin/Heidelberg 179 193 10.1007/978-3-642-16108-717 URL
    • (2010) Algorithmic Learning Theory , vol.6331 , pp. 179-193
    • Balle, B.1    Castro, J.2    Gavaldà, R.3
  • 3
    • 19944415906 scopus 로고    scopus 로고
    • Links between probabilistic automata and hidden Markov models: Probability distributions, learning models and induction algorithms
    • P. Dupont, F. Denis, and Y. Esposito Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms Pattern Recognit. 38 9 2005 1349 1371
    • (2005) Pattern Recognit. , vol.38 , Issue.9 , pp. 1349-1371
    • Dupont, P.1    Denis, F.2    Esposito, Y.3
  • 6
    • 84873317994 scopus 로고    scopus 로고
    • PAC-learnability of probabilistic deterministic finite state automata
    • A. Clark, F. Thollard, PAC-learnability of probabilistic deterministic finite state automata, J. Mach. Learn. Res.
    • J. Mach. Learn. Res.
    • Clark, A.1    Thollard, F.2
  • 7
    • 33746063205 scopus 로고    scopus 로고
    • Learning Rational Stochastic Languages
    • G. Lugosi, H.-U. Simon, Lecture Notes in Computer Science Springer 3-540-35294-5
    • F. Denis, Y. Esposito, and A. Habrard Learning Rational Stochastic Languages G. Lugosi, H.-U. Simon, COLT Lecture Notes in Computer Science vol. 4005 2006 Springer 3-540-35294-5 274 288
    • (2006) COLT , vol.4005 , pp. 274-288
    • Denis, F.1    Esposito, Y.2    Habrard, A.3
  • 8
    • 0001841122 scopus 로고
    • On the computational complexity of approximating distributions by probabilistic automata
    • 0885-6125 10.1007/BF00992677
    • N. Abe, and M.K. Warmuth On the computational complexity of approximating distributions by probabilistic automata Mach. Learn. 0885-6125 9 2-3 1992 205 260 10.1007/BF00992677
    • (1992) Mach. Learn. , vol.9 , Issue.23 , pp. 205-260
    • Abe, N.1    Warmuth, M.K.2
  • 10
    • 0032049450 scopus 로고    scopus 로고
    • On the learnability and usage of acyclic probabilistic finite automata
    • D. Ron, Y. Singer, and N. Tishby On the learnability and usage of acyclic probabilistic finite automata J. Comput. Syst. Sci. 56 2 1998 133 152
    • (1998) J. Comput. Syst. Sci. , vol.56 , Issue.2 , pp. 133-152
    • Ron, D.1    Singer, Y.2    Tishby, N.3
  • 11
    • 33646529351 scopus 로고    scopus 로고
    • Learnability of Probabilistic Automata via Oracles
    • S. Jain, H.-U. Simon, E. Tomita, Lecture Notes in Computer Science Springer 3-540-29242-X
    • O. Guttman, S.V.N. Vishwanathan, and R.C. Williamson Learnability of Probabilistic Automata via Oracles S. Jain, H.-U. Simon, E. Tomita, ALT Lecture Notes in Computer Science vol. 3734 2005 Springer 3-540-29242-X 171 182
    • (2005) ALT , vol.3734 , pp. 171-182
    • Guttman, O.1    Vishwanathan, S.V.N.2    Williamson, R.C.3
  • 12
    • 34948854853 scopus 로고    scopus 로고
    • PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance
    • 0304-3975 10.1016/j.tcs.2007.07.023
    • N. Palmer, and P.W. Goldberg PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance Theoret. Comput. Sci. 0304-3975 387 1 2007 18 31 10.1016/j.tcs.2007.07.023
    • (2007) Theoret. Comput. Sci. , vol.387 , Issue.1 , pp. 18-31
    • Palmer, N.1    Goldberg, P.W.2
  • 13
    • 33750374571 scopus 로고    scopus 로고
    • PAC-learning of Markov models with hidden state
    • J. Fürnkranz, T. Scheffer, M. Spiliopoulou, Lecture Notes in Computer Science Springer 3-540-45375-X
    • R. Gavaldà, P.W. Keller, J. Pineau, and D. Precup PAC-learning of Markov models with hidden state J. Fürnkranz, T. Scheffer, M. Spiliopoulou, ECML Lecture Notes in Computer Science vol. 4212 2006 Springer 3-540-45375-X 150 161
    • (2006) ECML , vol.4212 , pp. 150-161
    • Gavaldà, R.1    Keller, P.W.2    Pineau, J.3    Precup, D.4
  • 14
    • 22944484114 scopus 로고    scopus 로고
    • Learning stochastic deterministic regular languages
    • Lecture Notes in Computer Science Springer Berlin/Heidelberg
    • F. Thollard, and A. Clark Learning stochastic deterministic regular languages Grammatical Inference: Algorithms and Applications Lecture Notes in Computer Science vol. 3264 2004 Springer Berlin/Heidelberg 248 259
    • (2004) Grammatical Inference: Algorithms and Applications , vol.3264 , pp. 248-259
    • Thollard, F.1    Clark, A.2
  • 15
    • 84988545491 scopus 로고
    • Learning stochastic regular grammars by means of a state merging method
    • R.C. Carrasco, J. Oncina, Lecture Notes in Computer Science Springer 3-540-58473-0
    • R.C. Carrasco, and J. Oncina Learning stochastic regular grammars by means of a state merging method R.C. Carrasco, J. Oncina, ICGI Lecture Notes in Computer Science vol. 862 1994 Springer 3-540-58473-0 139 152
    • (1994) ICGI , vol.862 , pp. 139-152
    • Carrasco, R.C.1    Oncina, J.2
  • 16
    • 0033295264 scopus 로고    scopus 로고
    • Learning deterministic regular grammars from stochastic samples in polynomial time
    • R.C. Carrasco, and J. Oncina Learning deterministic regular grammars from stochastic samples in polynomial time RAIRO Theor. Inform. Appl. 33 1 1999 1 20
    • (1999) RAIRO Theor. Inform. Appl. , vol.33 , Issue.1 , pp. 1-20
    • Carrasco, R.C.1    Oncina, J.2
  • 19
    • 85161996168 scopus 로고    scopus 로고
    • Probabilistic deterministic infinite automata
    • J. Lafferty, C.K.I. Williams, J. Shawe-Taylor, R. Zemel, A. Culotta
    • D. Pfau, N. Bartlett, and F. Wood Probabilistic deterministic infinite automata J. Lafferty, C.K.I. Williams, J. Shawe-Taylor, R. Zemel, A. Culotta, Advances in Neural Information Processing Systems 23 2010 1930 1938
    • (2010) Advances in Neural Information Processing Systems 23 , pp. 1930-1938
    • Pfau, D.1    Bartlett, N.2    Wood, F.3
  • 20
    • 0032202014 scopus 로고    scopus 로고
    • Efficient noise-tolerant learning from statistical queries
    • 0004-5411
    • M. Kearns Efficient noise-tolerant learning from statistical queries J. ACM 0004-5411 45 6 1998 983 1006 http://doi.acm.org/10.1145/293347.293351
    • (1998) J. ACM , vol.45 , Issue.6 , pp. 983-1006
    • Kearns, M.1
  • 21
    • 0032047249 scopus 로고    scopus 로고
    • Specification and simulation of statistical query algorithms for efficiency and noise tolerance
    • 0022-0000 10.1006/jcss.1997.1558 URL
    • J.A. Aslam, and S.E. Decatur Specification and simulation of statistical query algorithms for efficiency and noise tolerance J. Comput. Syst. Sci. 0022-0000 56 1998 191 208 10.1006/jcss.1997.1558 URL http://portal.acm.org/ citation.cfm?id=291953.291957
    • (1998) J. Comput. Syst. Sci. , vol.56 , pp. 191-208
    • Aslam, J.A.1    Decatur, S.E.2
  • 23
    • 0027869083 scopus 로고
    • Learning Decision Trees Using the Fourier Spectrum
    • 10.1137/0222080 URL
    • E. Kushilevitz, and Y. Mansour Learning Decision Trees Using the Fourier Spectrum SIAM J. Comput. 22 6 1993 1331 1348 10.1137/0222080 URL http://link.aip.org/link/?SMJ/22/1331/1
    • (1993) SIAM J. Comput. , vol.22 , Issue.6 , pp. 1331-1348
    • Kushilevitz, E.1    Mansour, Y.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.