8bb5f66371c7e4cbf6c223162c62c0f4-Supplemental-Conference.pdf

Here we prove the variational bound on the informativeness loss term (second term in Eq. (4)) that Recall that the speaker's belief states, Therefore, any other decoder would lend an upper bound on the informativeness loss term. In this case, the speaker's belief states are given by While Eq. (A.1) follows from [ Eq. (A.2) is equivalent to assuming that the listener's The main paper is available at https://openreview.net/pdf?id=O5arhQvBdH. Therefore, we treat it here as a discrete set. We therefore aim to bias our agents toward these systems. One way of achieving that is by regularizing the entropy of the speaker's communication vectors.