Let us consider the following simple interaction matrix with the corresponding inverse: That is, when a mistake is made at time t, the rate of update is 2/(K + 1) for task i t and half as large for the other K − 1 tasks.
a defines all tasks as "equally related" to any other task.