Followup to: Improving event detectors.
States of event detectors indicate events in the environment. When event detector changes, so do the events it indicates. If detector changes too much, its states can start indicating something different, or even nonexistent, becoming misleading or useless.
Events in the mind rely on each other. Semantics of most of the events depends on semantics of other events. Only few events are states of input/output, other events are computed through many levels of intermediate events. These intermediate events both depend on events that define them, and provide the foundation for other events that are defined in terms of them.
When an event detector changes, it results not just in change to that detector, but also in changes to all the other detectors depending on it. And since in environment everything is connected to almost everything else (given sufficiently long inferential chains), change in semantics of one event results in implicit change in most of the other events. These changes need to be contained, to preserve correspondence between existing event detectors and the structure of environment. Model of environment can change incrementally, incorporating new facts and repairing the errors, but it doesn’t change all at once, doesn’t break all the time.
Consider a binary detector that is defined in terms of a number of other detectors. It activates in a subset of joint state space of these detectors, elements of which are expected to appear according to some probability distribution. If few of the detectors change (modifying the conditions for assuming different states, not states themselves), so does the probability distribution. Clusters in this distribution (assuming that they hold most of the probability mass) can move around as a result of change, but not too far from their original locations (unchanged detectors keep them in place). Thus, if our detector keeps a sufficient margin around these clusters, shifted clusters won’t cross its boundary and will activate or deactivate the detector the same way as they did before change, more or less preserving its resulting behavior. After the change, detector again needs to shift the boundary away from the clusters, to be prepared to the subsequent changes. For example, learning detectors to keep maximum margin from the decision surface to exemplars on both sides takes care of this issue (but not of others). This way, change could be absorbed by the network; if the first layer of detectors can’t do that, subsequent layers will.
Posted by Vladimir Nesov
Posted by Vladimir Nesov
Posted by Vladimir Nesov