The study of emergent languages has become an important topic in cognitive science and artificial intelligence for years, as effective communication is the prerequisite for successful cooperation in both human societychristiansen2003language; ibsen2018language and multi-agent systems (MAS) goldman2007learning; foerster2016learning; lazaridou2018emergence. Communication, as Grice characterized in his original model of pragmatics grice1975logic, should follow cooperative principles, where listeners make exquisitely sensitive inferences about what utterances mean given their knowledge of the speaker, the language, and the context, and the speaker collaboratively makes contributions to the conversational goals vogel2013emergence; goodman2016pragmatic. For example, if there are three boys in a class and teacher told teacher that “some of the boys went to the party”, then teacher will legitimately infer that one or two of the boys went to the party grice1975logic; jager2012game. Although according to the literal meaning, it could be that all three of the boys went to the party, teacher is less likely to interpret the utterance that way, because teacher , a cooperative speaker, would have said “all of the boys went to the party” in that case to prevent ambiguity. This seemingly trivial example (called scalar implicature in pragmatics) illustrates that pragmatic conversation is, in most of the time, taken for granted in human communication, and shows how significant hidden information can be acquired from literal meanings. However, current MAS tend to model communication merely as information exchange between agents, among which messages are deciphered only by their literal meanings kinney1998learning; bernstein2002complexity; goldman2007learning; sukhbaatar2016learning. Even with perfect understanding among each other, this type of communication cannot achieve optimal efficiency, as the intention of the communicator implicitly suggested by the message is ignored.
To perform pragmatic communication, the listener needs to not only comprehend the speaker’s utterance, but also infer his mental states. It has been shown that humans, during an interaction, can reason about others’ beliefs, goals, intentions and predict opponent/partner’s behaviors premack1978does; yoshida2008game; baker2017rational, a capability called ToM. In some cases, people can even use ToM recursively, and form beliefs about the way others reason about themselves de2015higher. Thus, in order to collaborate and communicate with people smoothly, artificial agents must also bear similar potentially recursive mutual reasoning capability. Despite the recent surge of multi-agent collaboration modeling kinney1998learning; sukhbaatar2016learning; das2017learning; foerster2018counterfactual, integrating ToM is still a nontrivial challenge. A few approaches attempted to model nested belief of other agents in general multi-agent systems, but extensive computation restricts the scale of the solvable problems doshi2009monte; han2018learning. When an agent has an incomplete observation of the environment, it needs to form a belief, a distribution over the actual state of the environment, to take actions yoshida2008game; han2018learning. ToM agents, besides their own beliefs about the state, or 0-th level beliefs, also model other agents’ beliefs, forming 1-st level beliefs. They can further have beliefs about others’ 1-st level beliefs about their 0-th level belief, so on and so forth doshi2009monte; de2014theory; yoshida2008game; de2015higher; de2017estimating. The intractability of distribution over distribution makes exact solving for ToM agents’ nested beliefs extremely complicated doshi2009monte.
Therefore, an approach to acquire the sophistication of high-level recursions without getting entangled into the curse of intractability is needed. In this paper, we propose an adaptive training process, following which pragmatic communication protocol can emerge between cooperative ToM agents modeling only the 1-st level belief over belief. The complexity of higher level recursions can be preserved by the dynamic evolving of agents’ tractable belief estimation functions. We don’t assume agent has a certain level of recursions, which requires modeling nested beliefs from the 0-th level up to the desired leveldoshi2009monte; de2014theory; de2015higher; de2017estimating. Instead, we directly learn a function to approximate partners’ actual beliefs and how to react accordingly. In cooperative games, this learning becomes mutual adaptation, with controlled exploration rate, improving the performance of the multi-agent system claus1998dynamics. Intuitively, for a pair of agents, we update them alternatively, namely, fixing one while training the other, simulating the iterative best response (IBR) model, which proves to converge to a fixed point Nash equilibrium in strong and weak interpretation game jager2012game. We demonstrate the effectiveness and advantage of the pragmatic protocol with referential games, a communication game widely used in linguistic and cognitive studies in the context of language evolution lazaridou2016multi; cao2018emergent; lazaridou2018emergence. It provides a good playground for pragmatic and pedagogical interactions between a teacher and a student and can easily generalize to a comprehensive teaching task with a large concept space.
We tested our algorithm and evaluated the pragmatic teaching protocol with both symbolic and pixel data, and achieved significant performance gain over previous algorithms in terms of referential accuracy. Also, we found that if messages are grounded with human expertise before interaction, the emerged protocol achieves teaching complexity empirically approximates recursive teaching dimension (RTD) doliwa2014recursive, the worst-case number of examples required for cooperative agents concept learning chen2016recursive.
This paper makes two major contributions: 1) we showed that a pragmatic communication protocol can emerge between ToM agents through adaptive reinforcement learning. This protocol significantly improves the cooperative multi-agent communication by enabling the agents to extract hidden meanings from the context to enrich the literal information; 2) we proposed an algorithm to develop protocols empirically approximating the teaching complexity bound between cooperative agents provided by RTD. Extensive experiments on both the symbolic and 3D object datasets demonstrate the effectiveness of our proposed protocol.
2 Background: Referential Game
There are a teacher and a student in a referential game. The teacher has a target in mind and aims to send a message to the student so that the student can identify the target out of a set of distractors after receiving this message. The motivation of our algorithm is the rational speech act (RSA) model between ToM agents (also termed as bilateral optimality blutner2000some): in order to establish proper communication, the speaker has to take into account the perspective of the listener, while the listener has to take into account the perspective of the teacher goodman2016pragmatic. Figure 0(a) shows an example. There are three objects, a blue sphere, a red sphere, and a blue cone. Suppose the target is the blue sphere. If the only allowed messages are colors and shapes, then, for a literal student, there is no unique identifier for the blue sphere, because both “blue” and “sphere” have more than one consistent candidates. Nonetheless, a pragmatic student, after hearing “blue” from the teacher, should be able to do counterfactual reasoning and identify the blue sphere instead of the blue cone, because he knows the teacher is helpful and would have used cone to refer to the blue cone unambiguously. During pragmatic communication, a message conveys more information than the message itself. The usage of that message can usually suggest the intention of the teacher.
The referential game can be formally defined by a tuple , where and stand for a teacher and a student. is the instance space, where the distractors and targets are sampled from. is the message space and is the student’s action space. In a specific game, a set of instances is sampled from as candidates, and one of the candidates is designated as the target, while the rest, , are distractors. The candidates are available to both of the agents, while only the teacher knows the target, . Agents take turns in this game. In every round, the teacher first sends a message to the student, followed by an action taken by the student, where number 1 to represent "identify a certain instance as the target", means "wait for next message" and stamps the -th round. Every message comes with a message cost, , and the total gain for both the teacher and the student, given the first non action, is . Notice that the game ends when the student performs a non action. We define a protocol between and as a set of policies
is the power set of , where sampled from, and is the kleene star, standing for the history of message. Intuitively, the teacher selects a message based on the distractors, the target and communication history. The student chooses an action according to candidates, history and the latest message. The goal for both of the agents is to maximize the expected gain:
3 Related Work
Pragmatics grice1975logic has profound linguistic and cognitive science origin dating back to 1970s. However, the integration of this topic with multi-agent games only draws people’s attention in this decade. The RSA model was raised by Golland et al. golland2010game and developed in frank2012predicting; shafto2014rational; goodman2016pragmatic; andreas2016reasoning in later works. Yet, all of these works model only single utterance and require hand designed production rules for the agents, while in our algorithm, all policies are learned by the agents and multi-round of communication is allowed. frank2009informative; vogel2013emergence; khani2018planning model pragmatic reasoning for human action prediction, but they all require domain-specific engineering, and pragmatically annotated training data. In our work, all models are trained by self-playing with RL. vogel2013emergence needs human data to initialize the literal speaker and uses RL to train listener with pragmatic reasoning, but they assumes fixed literal speaker. On the contrary, we endow both the teacher and the student ToM and allow them to do mutual pragmatic reasoning. The discriminative best response algorithm in vogel2014learning is also inspired the IBR model jager2012game
, but they used supervised learning given language data instead of RL. Also, our game states are more complicated than their toy examples.
Emergence of language in communication games. Emergence of language is a topic about a group of agents developing a communication protocol to complete a task, which can either be cooperative or competitive. In most recent studies, agents start with a set of ungrounded symbols and first learn to ground these symbols using reinforcement learning approaches supervised by the task rewards. The major novelty of our work comparing with previous methods is that pragmatic reasoning can emerge from our protocols without explicit rules coded.
In lazaridou2018emergence, two agents try to develop a protocol through playing the referential game, in which the teacher sees only the target but no distractors, eliminating the possibility of taking advantage of ToM, as no counterfactual reasoning can happen at the student side. In lazaridou2016multi the teacher sends a message according to the context of candidates, but no student reaction is simulated before the selection. In bogin2018emergence; choi2018compositional, the teacher can simulate the reaction of a fixed student, who does not model teacher’s mind and cannot benefit from counterfactual reasoning about teacher’s intention behind messages, terminating the recursive process after only one cycle.
A variation of the referential game was played in evtimova2017emergent, where the teacher sees an image and the student sees a set of descriptions. The goal is for the student to identify a suitable description for the teacher’s image by multi-round communication. A similar multi-round communication game using natural language was also played in das2017learning. In these games, the student can ask further questions after receiving the first message and is in charge of the final decision making, while the teacher will answer the question based on the target and the communication history. These works focus on learning shared embedding between objects and messages instead of grounding messages to attributes that reappear across the object space. Also, neither of these papers include agents who model their partner’s minds.
Multiagent communication. Modelling multiagent communication dates back to 1998 when Kinney et al. kinney1998learning
proposed adaptive learning of multiagent communication strategy as a predefined rule-based control system. To scale up from rule-based systems, decentralized partially observable Markov decision process (DEC-PODMP) was used to model multiagent interaction with communication as a special type of action among agentsbernstein2002complexity; goldman2003optimizing. Solving DEC-POMDP exactly is a NEXP-complete problem bernstein2002complexity requiring agents to remember the complete observation history for their policy. In recent works, a more compact representation of the history is often used for action selection. In sukhbaatar2016learning; foerster2016learning, agents maintain a memory variable and refer to it when act and speak. However, the centralized training process in these work needs channels with large bandwidth to pass gradients across different agents. Also, the messages in sukhbaatar2016learning
are not discrete symbols, but continuous outputs of neural networks. Other extension of single agent value based algorithms to multiagent problemslowe2017multi; foerster2016learning usually suffers from non-stationariy induced by simultaneous updates of agents.
While DEC-POMDP considers other agents as part of the environment and learns the policy as a mapping from local observation to action, LOLA in foerster2018learning learns the best response to evolving opponents. Yet, opponent/partners’ real-time belief is not considered into policy. Interactive-POMDP (I-POMDP) doshi2009monte; han2018learning
moves one more step forward by actually modeling opponents’ mental states at the current moment and integrates other’s belief into the agent’s own policy. However, I-POMDP requires extensive sampling to approximate the nested integration over the belief space, action space and observation space, limiting its scalability. Because whenever the teacher sends a message, she thinks about not only the student’s current belief but also current distractor sets, the value iteration process in I-POMDP needs to be repeated for every single game. In our algorithm, training only needs to be performed once for one pair of agents and reusable to all games. The Bayesian action decoder (BAD)-MDP proposed by Foerster et al.foerster2018bayesian also yields counterfactual reasoning in their belief update, but their method is more centralized in the testing process than ours. The BAD-agent is a super-agent controlling all other agents collectively. Deterministic partial policies can easily reveal agents’ private information to the BAD-agent and make it public. Instead, our model doesn’t depend on any implicit information flowing between agents during testing.
4 Adaptive Emergence of Pragmatic Protocol
Emergence of Pragmatic Protocol: Our goal is to learn a protocol for agent and so that they can communicate with the contextual information being considered. To avoid tracking the message history, which scales exponentially with the time, we use beliefs as sufficient statistics for the past. Hence, ToM can be embodied as estimating partner’s current and future belief, then choose the most ideal action to manipulate them as needed. In the referential game, since the teacher knows the target, only the student holds a belief, , about the target. Utilizing the obverter technique bogin2018emergence; choi2018compositional, we let the teacher holds a belief as her estimation of student’s belief. As
is an estimation of the student’s belief, it should be a belief over belief, i.e. a distribution over a distribution over the candidates. Since a distribution is a continuous random variable, distribution over a continuous variable can be represented as a set of particles. However, to avoid the complexity we only use one particle to approximate. That is,is still a distribution over the candidates. This is reasonable because the belief update process is deterministic for rational agents following the Bayesian rule vogel2013emergence; fisac2017pragmatic. Given a uniform distribution over candidates, is a single mode distribution and can be approximated with a particle.
Before speaking, teacher traverses all messages and predicts the student’s new belief after receiving each message. She then sends the message leading to the most optimal student’s new belief. Hearing the message, student updates his belief and takes action. This process is visualized in figure 0(b) and formalized in algorithm 1 line 11 to 20. The recursive mutual modeling in ToM is integrated within the belief update process. are belief update functions parameterized by , taking in candidates, current belief, message and returning a new belief. The beliefs in our model are semantically meaningful hidden variables in teacher’s Q-function and student’s policy network, as the student directly samples an action according to his belief. The evolving of the belief update function reflects the protocol dynamics between the agents. Within , we code in the Bayesian rule with the likelihood function varying across different training phases. Our implementation detail can be found in section B. In each phase, we first train the teacher for a fixed student, then adapt the student to the teacher.
Difference from multiagent Q-learning: Our algorithm considers both the physical state and agent’s mental state in the value function, and has a dynamic belief update function. Moreover, since agents are never trained simultaneously, our algorithm doesn’t suffer from non-stationarity lowe2017multi; foerster2016learning.
Teacher: The teacher selects messages according to her Q-values and belief update function. We use to denote teacher’s belief update function, which takes in the candidates set, current belief estimation and a message. The return value of this function is a new belief estimation . represents all probabilistic distributions over the candidates. This function can be parameterized as a neural network with weighted candidates encoding and messages as inputs and softmax as the output layer. The return value of the belief update function is directly fed into the Q-function. In practice, we implement it as a submodule of the Q-net. That is, the output of the belief update function is used in ’s Q-function and to predict student’s belief in next step during testing. The teacher chooses messages according to her Q-value following equation 2.
Equation 3 defines the teacher’s Q-function. indicates whether the student makes a correct prediction. indicates if the game is still ongoing. Student’s belief is the state of teacher’s MDP. Since student’s actions determine the game states, the expectation is over the student’s policy. By definition, the teacher’s Q-function relies on student’s policy and belief update function. She has no access to these student’s functions, but since we never train the teacher and student simultaneously, the expectation can be approximated through Monte-Carlo (MC) sampling. To form a protocol, agent needs to learn two functions, her belief update function and . In the training phase, every time the student receives a message, he returns his new belief to the teacher. During testing, she needs to use the output of to approximate student’s new belief. We train by minimizing the cross-entropy, , between and teacher’s prediction, denoted as , the obverter loss. Teacher’s Q-function is learned with Q-learning watkins1989learning. The in line 33 controls the scale of the two losses.
Student: We directly learn the belief update function and policy of the student through the REINFORCE algorithm williams1992simple. In the referential game, student’s policy is quite simple. If his belief is certain enough, he will choose the target based on his belief; otherwise, wait for further messages. The output of the policy network is a distribution with dimensions. The last dimension is a function of the entropy of the original belief. If the belief is uncertain, this value will be dominant after normalization. has the same structure as . and can be parameterized as an end-to-end trainable neural network, with the candidates encoding, original belief and received a message as the input and returning an action distribution.
Adaptive Training: The whole training process can then be summarized as Algorithm 1. Both the teacher and student are adaptively trained to maximize their expected gain defined in Eq. (1). The training details for the teacher and the student are illustrated in Line 28-34 and Line 35-39 of Algorithm 1 respectively.
4 distractors referential game example. Number set on the left (candidates listed in the title with the target in bold fonts) and 3D objects on the right. Due to the space limit, we only show the message distribution for the target and student’s new belief after receiving the most probable message. As for the teacher’s message distribution for distractors, all probability weights concentrate on the unique identifiers after the first phase of training. Student’s belief illustrates that teacher’s most probable message, though consistent with multiple candidates, can successfully indicate the target with more confidence as training goes. In general, both agents’ behavior becomes more certain, and the certainty coordinates.
|No. Set||3D objects||7||No. Set||3D Objects|
|79.1 3.3||86.9 4.1||L. A. ||64.2 6.0||77.3 2.8|
|96.8 0.2||97.0 0.5||L. A. ||80.8 3.1||88.2 1.7|
|98.9 0.1||99.6 0.2||Pragmatics||93.2 1.0||97.4 1.2|
|79.3 3.1||86.9 4.5||L. A. ||67.2 5.8||77.2 2.6|
|91.5 0.4||88.0 1.9||L. A. ||66.2 3.1||68.2 2.7|
|98.1 0.3||98.8 0.3||Pragmatics||88.3 0.6||94.1 2.3|
measure the accuracy for difficult games (numbers in percentage). We define game difficulty with average cosine similarity between the target and the distractors. The larger the cosine similarity, the harder the game is. We report the accuracy for tophard games. L.A. stands for Lazaridou et el. To verify the generalization of our algorithm, we form training sets with of all instances and test using the rest unseen instances. The performance doesn’t exhibit noticeable degradation: 99.1 0.1 and 93.0 1.7 for 4 and 7 candidates number set respectively (comparable with the No. Set results in the third line). Mean and std calculated using 3 different random splits, 2 experiments per split.
We evaluated our algorithm with two datasets, number set and 3D objects, and played referential games with four or seven candidates. The number set is a symbolic dataset, with an instance as a set of categorical numbers. For example, consists a referential game with four candidates. Notice that the numbers are merely symbols without numerical order. If there are four candidates, we randomly choose numbers from 0 to 9, with maximum four numbers in a set; if seven candidates, we choose from 0 to 11, with maximum five numbers in a set. Each set is encoded by multi-hot encoding. There are 385 and 1585 different possible number sets, consisting up to and different games with four and seven candidates. Number sets make a generic referential game prototype, where each instance can be disentangled into independent attributes perfectly. To verify the generality of our algorithm on more complicated candidates, we used MoJoCo physical engine to synthesize RGB images of resolution depicting single 3D object scenes. For each object, we pick one of six colors (blue, red, yellow, green, cyan, magenta), six shapes (box, sphere, cylinder, pyramid, cone, ellipsoid), two sizes and four locations, resulting in 288 combinations. In every game, candidates are uniformly sampled from the instances space. We use a message space with the same size as the number of attributes appeared in the dataset, i.e., 10 or 12 for number set, and 18 for 3D objects. In every game, we only allow one round of communication with one message. To prevent collusion using trivial position indicator, candidates are presented to the agents in different orders.
5.1 Referential Game with Symbolic and Pixel Input
For number set, we encode candidates with multi-hot vectors and messages with one-hot vectors. For 3D objects, we used a convolutional neural network (CNN) to extract features of the candidates. For all datasets, we manually generated 600k and 100k mutually exclusive games for training and testing. Namely, the same instances can appear in both datasets, but not any identical candidates combinations. To win a game, the same instance needed to be handled differently given different contexts, so, as long as the games are exclusive between training and testing sets, sharing instances won’t cause over-fitting. To test the robustness, we also report results using exclusive testing instances in table1. We compared the pragmatic protocol developed using our algorithm against previous works on referential game lazaridou2016multi; lazaridou2018emergence. Both utilized RL to train a protocol, but neither modeled recursive mind reasoning between agents. In lazaridou2016multi, only the teacher considers the context, while no context is included in lazaridou2018emergence. We trained our model for 3 phases, with 20k iterations for each phase and switch the training agent in the middle of every phase. Both benchmarks were trained for 100k iterations. Since there is no official code released by the authors, we implemented their model by ourselves and did thorough hyper-parameter grid search. Results shown in table 1
. Our experimental results in all settings are significantly better than both of the benchmarks. Using the paired T-test, the one-tail-value is smaller than 0.001 for all settings in table1. We found that even with simpler representation, number set games are more difficult than 3D objects, because we don’t have any limitations generating the instances in number sets. 3D objects, on the other hand, form special cases of number sets, as some attributes can never coexist. E.g. a shape cannot be a sphere and a cone simultaneously.
5.2 Connection with RTD
The iterative adaptive idea of our algorithm is similar to the definition of RTD, which measures the number of examples needed for concept learning between a pair of cooperative and rational agents chen2016recursive. We included the formal definition of RTD in section A of the appendix. Intuitively, in a concept class, there is a subset of concepts which are the simplest to learn i.e. has the minimum sized teaching set among all concepts. One can first learn those concepts and remove them from the concept class. Now, for the remaining set of concepts, one can recursively learn the simplest concepts and so on. The teaching complexity of this learning schema lower bounds classic teaching dimension doliwa2014recursive. In every phase of our iterative training, the agent learns to identify the optimal teaching set for the “simplest” remaining candidates. In our experiments, candidates identifiable with a unique message are the simplest. If a candidate becomes the simplest after times of removal, then we call it a level candidate. To better illustrate the connection, we show two example referential games in figure 2 and the accuracy improvement after each phase of training in figure 3. We can see from figure 3 that after one phase of training all level 0 targets can be perfectly identified. Thus, the student, if shown the four 3D objects in figure 2, will know that the teacher will send “Blue” for distractor 1, “Large” for distractor 2 and “magenta” for distractor 3. Hence, “Upper Right” and “Ellipsoid”, though consistent with multiple objects, must indicate the target. The accuracy for higher-level targets in figure 3 keeps increasing as they become uniquely identifiable after lower-level targets are pruned out. We can observe the emergence of pragmatics from these results. From the student’s perspective, the messages from the teacher are no longer merely comprehended by their literal meanings, and from the teacher’s perspective, she selects the most helpful message to teach. In the 4-candidate scenario, most questions with level 0 and 1 are correctly answered, a similar capability shown in human one-shot referential game study bergen2012s.
Notice that RTD is derived under the assumption that both agents only decipher the candidates as sets of discrete attributes. To eliminate the usage of other hidden patterns in the candidates, we need to pretrain the agents to ground messages to instances attributes. This can be easily achieved by initializing agents’ belief update function as Bayesian belief update. That is, before running algorithm 1, we train the belief neural network with cross-entropy loss between the generated new belief and ground truth Bayesian belief. Afterward, every message grounds to an attribute.
Bayesian pretraining provides human decipherable examples for failure cases. Most of our model’s mistakes are on targets with or but requiring high () level unique identifiers (hard games). Since we only allow one message, targets with are theoretically impossible to be certainly identified, even between cooperative agents with ToM. As for the hard games, their relatively low frequency in the training set may impinge the acquiring of high-level best response. Failure to handle a certain type of scenarios is a common empirical defect of the current RL algorithms, in our case, the hard games. Another benefit of Bayesian pretrain is that the initial message grounding is decipherable to human. In the next section, we show this interpretability can be preserved by our algorithm.
5.3 Stability of the Protocol
We also explored how much the communication changes after the mutual adaptation process. Suppose the agents are initialized with human-understandable message groundings, ideally, we want the emerged protocol preserves its human interpretability. To test this property, we give the teacher and student different but equivalent candidates. Namely, we randomly generate a one-to-one mapping from attributes to attributes, such as replacing all 1 with 7 in number sets or replacing all red with blue in 3D objects. After the teacher sends a message to the student, both the message and candidates are converted with the same mapping before presented to the student. The converted candidates form an equivalent game for the original one. For example, if the teacher sees and sends 4. Converted by a mapping which adds 1 to all attributes, the student gets and 5.
|No. Set||3D Objects||7||No. Set||3D objects|
|59.5 0.4||53.3 1.8||L. A. ||35.0 0.2||37.7 1.8|
|52.3 2.9||60.8 2.9||L. A. ||33.3 2.0||46.0 1.4|
|97.5 0.4||98.7 0.5||Pragmatics||73.9 0.3||84.2 0.1|
|81.5 2.6||83.7 3.4||L. A. ||74.9 0.5||75.3 2.9|
|98.6 1.0||98.1 0.2||L. A. ||93.0 0.5||91.2 0.5|
|98.1 0.3||99.7 0.3||Pragmatics||88.2 0.8||91.2 0.1|
We pretrain agents with Bayesian belief update separately, then train them together without equivalent games but test them with equivalent games. See table 2 for the results. We can see that our algorithm preserves human interpretability the most. The iterative adaptation contributes to stability because, in every phase, one agent is fixed while optimizing the other. Hence, the evolving of the protocol is not arbitrary and will maintain the effective part of the existing protocol while improving the rest. This property can facilitate human-robot communication, as we only need to provide natural language grounding to robots, and they can self-evolve to take the best advantage of this grounding without developing human undecipherable protocols.
5.4 Global Mapping and Local Selection
|Pragmatics||98.8 0.29||98.1 0.36||98.6 0.08||87.9 0.61|
|L.A. ||74.5 5.69||79.1 4.73||97.0 0.02||88.8 0.25|
The core of pragmatics is the consideration of the context while comprehending the language. In this experiment, we want to show that the teacher using a pragmatic protocol can learn global mappings from instances to messages and select messages dynamically according to the context. First, we test global mapping by checking if messages used by the teacher for a target are consistent with this target’s attributes. Then we evaluate message selection through seeing whether the same target yields different messages given different distractors. To make the message grounding easier to understand, we still pretrain agents with Bayesian belief update. We took 80% of the instances to generate training data. In the testing phase, the rest 20% of images are used as targets with 3/6 distractors randomly selected from all images. Results in table 3 justify that the pragmatic protocols achieve the best balance between message validity and referential accuracy. Then we calculated covariance between messages and distractors attributes given the same target but changing distractors. For a target, the covariance is calculated using 100 games. In figure 4, we visualized mean covariance for 58 targets. Since the teacher doesn’t have access to distractors in lazaridou2018emergence, we only compared our model and lazaridou2016multi.
In this paper we propose an end-to-end trainable adaptive training algorithm integrating ToM in multi-agent communication protocol emergence. The pragmatic protocol developed by our algorithm yields significant performance gain over non-pragmatic protocols. With human knowledge pre-grounding, the teaching complexity using the pragmatic protocol approximates RTD. Our algorithm incorporates a global mapping from instances to messages with a local message selection mechanism sensitive to the context. In future research, we hope to generalize the referential game to a new communicative learning framework, where students, instead of learning from data or an oracle, learn from a helpful teacher with ToM. We also plan to apply our algorithm to more generic communication settings, where agents have more symmetric roles. Namely, we have agents each holding some information unknown to the group and need communication to accomplish a task. We also want to relax the need of exchanging beliefs directly in the training phase, replacing it with discrete feedback requiring smaller channel bandwidth.
Appendix A Recursive Teaching Dimension
In computational learning theory, the teaching dimension (TD) measures the minimum number of examples required to uniquely identify all concepts within a concept class. We draw a comparison between identifying a concept using examples and identifying the target using messages. Formally, given an instance spaceand a concept class , a teaching set for a concept with respect to is a subset such that s.t. . Intuitively, the teaching set is a subset of instance space that can uniquely identify in . TD of in , denoted by , is the size of the smallest teaching sets. TD of the whole concept class is . However, this definition of TD often overestimates the number of examples needed for cooperative agents, who teach and learn using "helpful" examples. For instance, the game in figure 0(a) in the main text has TD = 2, but all concepts can be taught with one message.
The recursive teaching dimension (RTD), a variation of the classic TD, can model the behavior between cooperative agents. Define the teaching hierarchy for as the sequence such that for all , where and for all , . RTD of in is defined as . RTD of is . Intuitively, one can first learn simplest concepts, , and remove them from the concept class. Then, for the remaining set of concepts, , recursively learn the simplest concepts and so on. RTD lower bounds the classic teaching dimension, i.e. doliwa2014recursive. Also, measures the worst-case number of labeled examples needed to learn any target concept in , and the teaching hierarchy can be derived by the teacher and student separately without any communication chen2016recursive.
Appendix B Network Structure
Our network consists of 3 modules: a belief update network, teacher’s Q-net and student’s policy network. The teacher and student share the same structure for the belief update network but initialized differently. The output of the belief update network will feed into the Q-net or policy network for message and action selection. Figure 0(b) shows the structure of our models. When dealing with image inputs, we have an additional perceptual module to process the visual inputs. We use a convolutional neural network to extract features from images.
We align candidates embedding (multi-hot vectors or dense features) into a tensor and apply convolution to every candidate, where is the candidate embedding dimension. We sum the candidates embedding as the context embedding and concatenate it after each candidate’s embedding, followed by another convolution. This structure can be repeated as needed. Figure 5 shows the structure. The final embedding of the candidates forms a tensor with shape , where is the dimension of the message encoding. Then we do another convolution with the message encoding of as the only tensor and get numbers, which is then fed into a sigmoid layer and returns the likelihood for all . This likelihood then multiplies with the input prior and returns posterior after normalization.
Teacher’s Q-net reuses candidates last embedding layer. The tensor is weighted by the return value of teacher’s belief update function and teacher’s ground truth belief (one-hot vector in referential games). We then sum the weighted tensors with respect to the second dimension and get two vectors. The concatenation of these vectors is passed into a fully connected layer and outputs a real number as the Q-value.
Student’s policy network is relatively simple. We first pass in the output of student’s belief update network to a fully connected layer followed by a sigmoid function, outputting the probability of waiting. Then action is sampled directly from the new belief. If wait, this action will be discarded, otherwise, it becomes the student’s prediction of the target.