]>
2022-01-25T07:28:16+00:00
A group-theoretic approach to formalizing bootstrapping problems
0
en
The bootstrapping problem consists in designing agents that laern a model of themsleves and the world, and utilize it to achieve useful tasks. It is different from other learning problems as the agent starts with uninterpreted observaions and commands, and with minimal prior information about the world. In this paper, we give a mathematical formalizatoin of this aspect of the problem. We argue that the vague constraint of having Ã¢no prior informationÃ¢ can be recast as a precise algebraic condition on the agent: that its behavior is invariant to particular classes of nuisances on the world, which we show can be well represented by actions of groups (diffeomorphisms, permutatations, linear transformations) on observations and commands. We then introduce the class of bilinear gradient dynamics sensors (DGDS) as a candidate for learning generic rootic sensorimotor cascades. We show how framing the problem as rejections of group nuisances allows a compact and modular analysis of typical preprocessing stages, such as learning the toplogy of sensors. We demonstrate learning and using such models on real-world range-finder and camera data from publicly available datasets.
Andrea Censi and Richard M. Murray
2011a
2011 International Conference on Intelligent Robots and Systems (IROS)
cm11-iros
Conference Paper
2016-05-15T06:16:09Z
2457523.7612153
A group-theoretic approach to formalizing bootstrapping problems
Title
102
en
Title