Active Learning of Group-Structured Environments

Authors:
Gábor Bartók;Csaba Szepesvári;Sandra Zilles
Affiliations:
Department of Computing Science, University of Alberta, Edmonton, Canada;Department of Computing Science, University of Alberta, Edmonton, Canada;Department of Computing Science, University of Alberta, Edmonton, Canada
Venue:
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
Year:
2008

Citing 10
Cited 0

Approximate representation theory of finite groups

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Diversity-based inference of finite automata

Journal of the ACM (JACM)
Learning algebraic structures from text

Theoretical Computer Science - Algorithmic learning theory
Efficient testing of groups

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Observable Operator Models for Discrete Stochastic Time Series

Neural Computation
On The Complexity Of Matrix Group Problems I

SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Efficient structure learning in factored-state MDPs

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Analyzing the performance of pattern database heuristics

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Finding optimal solutions to Rubik's cube using pattern databases

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Hierarchical heuristic search revisited

SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.