Active Learning of Group-Structured Environments

The question investigated in this paper is to what extent an input representation influences the success of learning, in particular from the point of view of analyzing agents that can interact with their environment. We investigate learning environments that have a group structure. We introduce a learning model in different variants and study under which circumstances group structures can be learned efficiently from experimenting with group generators (actions). Negative results are presented, even without efficiency constraints, for rather general classes of groups showing that even with group structure, learning an environment from partial information is far from trivial. However, positive results for special subclasses of Abelian groups turn out to be a good starting point for the design of efficient learning algorithms based on structured representations.

[1]  J. Rotman.  An Introduction to the Theory of Groups , 1965 .

[2]  E. Mark Gold,et al.  Language Identification in the Limit , 1967, Inf. Control..

[3]  George W. Polites,et al.  An introduction to the theory of groups , 1968 .

[4]  Larry S. Davis,et al.  Pattern Databases , 1979, Data Base Design Techniques II.

[5]  Endre Szemerédi,et al.  On the Complexity of Matrix Group Problems I , 1984, FOCS.

[6]  Ronald L. Rivest,et al.  Diversity-based inference of finite automata , 1994, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[7]  László Babai,et al.  Approximate representation theory of finite groups , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[8]  Richard E. Korf,et al.  Finding Optimal Solutions to Rubik's Cube Using Pattern Databases , 1997, AAAI/IAAI.

[9]  N. V. Vinodchandran.  Counting complexity and computational group theory , 1998 .

[10]  Herbert Jaeger,et al.  Observable Operator Models for Discrete Stochastic Time Series , 2000, Neural Computation.

[11]  Richard S. Sutton,et al.  Predictive Representations of State , 2001, NIPS.

[12]  Frank Stephan,et al.  Learning algebraic structures from text , 2001, Theor. Comput. Sci..

[13]  Miklos Santha,et al.  Efficient testing of groups , 2005, STOC '05.

[14]  Brian Tanner,et al.  Hierarchical Heuristic Search Revisited , 2005, SARA.

[15]  Michael L. Littman,et al.  Efficient Structure Learning in Factored-State MDPs , 2007, AAAI.

[16]  Alexander L. Strehl,et al.  Model-Based Reinforcement Learning in Factored-State MDPs , 2007, 2007 IEEE International Symposium on Approximate Dynamic Programming and Reinforcement Learning.

[17]  Richard E. Korf.  Analyzing the Performance of Pattern Database Heuristics , 2007, AAAI.

[18]  Y. Lafont.  Word Problem , 2019, 99 Variations on a Proof.