A hierarchy of learning automata in the sense of Thathachar and Ramakrishnan activates one root-to-leaf path per round, and every automaton on that path updates from the environment response. Analyses of this hierarchy deliver the response to every level. In many deployed hierarchies only the root observes it. The interfaces below carry requests but no feedback channel. This paper shows that the response can be recovered at every level without one. An active child receives one bit, the sign of the change in the action probability its parent assigns to it, and reads the response from that sign. For any update rule in which the selected action's probability rises on reward and does not rise on penalty, the decoded bit equals the response at every depth. This class includes linear reward-penalty, reward-epsilon-penalty and reward-inaction. The protocol hierarchy and the broadcast hierarchy therefore generate identical sample paths, so any convergence result proved for the broadcast hierarchy under these rules holds for the protocol hierarchy as well. The paper then analyses a proportional reward-penalty rule that keeps the allocation interior. For two actions it coincides with symmetric linear reward-penalty. For three or more it lies outside the classical schemes and balances each action's failure rate against its remaining allocation, not its penalty rate. Its mean flow converges globally to a closed-form allocation and drops actions below a computable threshold. High-precision replays on hierarchies of up to 16,384 leaves show zero decoding errors.

翻译：暂无翻译