Models of active learning in group-structured state spaces

Information and Computation

Volumn 208, Issue 4, 2010, Pages 364-384

  Bartók, Gábor ^a   Szepesvári, Csaba ^a   Zilles, Sandra ^b  

^a UNIVERSITY OF ALBERTA   (Canada)

^b UNIVERSITY OF REGINA   (Canada)

Author keywords

Active learning; Algebraic structures; Groups; Learning theory

Indexed keywords

ABELIAN GROUP; ACTION SEQUENCES; ACTIVE LEARNING; ALGEBRAIC GROUP; ALGEBRAIC STRUCTURES; EFFICIENT LEARNING; FINITE SET; GENERAL CLASS; GROUP STRUCTURE; LEARNING MODELS; LEARNING THEORY; PARTIAL INFORMATION; STATE SPACE; STRUCTURED ENVIRONMENT; TRANSITION DYNAMICS;

ALGEBRA; POINT GROUPS; SET THEORY;

LEARNING ALGORITHMS;

EID: 76349090438     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2009.09.001     Document Type: Article

References (18)

1. Angluin D. Learning regular sets from queries and counterexamples. Information and Computation 75 2 (1987) 87-106
2. L. Babai, E. Szemerédi, On the complexity of matrix group problems I, in: IEEE Symposium on Foundations of Computer Science, 1984, pp. 229-240.
3. G. Bartók, C. Szepesvári, S. Zilles, Active learning of group-structured environments, in: Proceedings of the 19th International Conference on Algorithmic Learning Theory, Lecture Notes in Computer Science, vol. 5254, Springer-Verlag, 2008, pp. 329-343.
4. Barzdin J. Two theorems on the limiting synthesis of functions. Theory of Algorithms and Programs (1974), Latvian State University, Riga 82-88
5. Boone W.W. The word problem. Annals of Mathematics 70 (1959) 207-265
6. Chen T., and Skiena S. Sorting with fixed-length reversals. Discrete Applied Mathematics 71 (1996) 269-295
7. Gold E.M. Language identification in the limit. Information and Control 10 (1967) 447-474
8. R. Holte, J. Grajkowski, B. Tanner, Hierarchical heuristic search revisited, in: Symposium on Abstraction, Reformulation and Approximation, 2005, pp. 121-133.
9. Jaeger H. Observable operator models for discrete stochastic time series. Neural Computation 12 (2000) 1371-1398
10. R.E. Korf, Finding optimal solutions to Rubik's cube using pattern databases, in: AAAI/IAAI, 1997, pp. 700-705.
11. M.L. Littman, R. Sutton, S. Singh, Predictive representations of state, in: Advances in Neural Information Processing Systems 14 (NIPS), 2002, pp. 1555-1561.
12. Ljung L. System Identification Theory For the User (1999), Prentice Hall, Upper Saddle River, NJ
13. P.S. Novikov, On the algorithmic undecidability of the word problem in group theory, in: Proceedings of the Steklov Institute of Mathematics, vol. 44, 1955, pp. 1555-1561 (in Russian).
14. Rivest R.L., and Schapire R.E. Diversity-based inference of finite automata. Journal of the ACM (1994) 555-589
15. Rothman J.J. An Introduction to the Theory of Groups (1995), Springer
16. Stephan F., and Ventsov Y. Learning algebraic structures from text. Theoretical Computer Science 268 2 (2001) 221-273
17. A.L. Strehl, C. Diuk, M.L. Littman, Efficient structure learning in factored-state MDPs, in: Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence (AAAI-07), 2007, pp. 645-650.
18. N.V. Vinodchandran, Counting Complexity and Computational Group Theory, Ph.D. thesis, Institute of Mathematical Sciences, Chennai, India, 1999.