Interaction Modeling with Multiplex Attention
Abstract
Modeling multi-agent systems requires understanding how agents interact.
Such systems are often difﬁcult to model because they can involve a variety of types of interactions that layer together to drive rich social behavioral dynamics.
Here we introduce a method for accurately modeling multi-agent systems.
We present
Interaction Modeling with Multiplex Attention (IMMA) 1 , a forward prediction model that uses a multiplex latent graph to represent multiple independent types of interactions and attention to account for relations of different strengths.
We also introduce Progressive Layer Training, a training strategy for this architecture.
We show that our approach outperforms state-of-the-art models in trajectory forecasting and relation inference, spanning three multi-agent scenarios: social navigation, cooperative task achievement, and team sports.
We further demonstrate that our approach can improve zero-shot generalization and allows us to probe how different interactions impact agent behavior.
Introduction
Modeling multi-agent systems is important for a wide variety of applications, including self-driving cars, crowd navigation, and human-machine collaboration.
The dynamics of multi-agent systems can be challenging to model as they are usually governed by various independent types of interactions.
Consider modeling crowd navigation at a social gathering, where agents’ behaviors might be governed by at least two types of interactions: target destinations (e g. a person trying to meet up with a friend) and collision avoidance (e g. navigating a busy sidewalk).
In social scenarios like this, humans often appear to navigate and make predictions based on estimated high-level intentions and relations among the other people [16, 45, 46].
Motivated by this observation, we aim to build a forecasting model for multi-agent systems that infers high-level abstractions in the form of graphs, entirely through the task of predicting agent trajectories.
Leading approaches in modeling multi-agent systems, such as Neural Relational Inference (NRI) [22],
Relational Forward Model (RFM) [8] and their extensions [12, 27], use graph neural networks (GNNs) to infer edge types for every pair of entities in the interacting systems.
However, this inductive bias does not explicitly handle the multiple layers of interactions present in social multiagent systems and, as shown empirically in Section 4, has led to at least two shortcomings: reduced performance on long-term predictions and decreased interpretability.
Our approach, Interaction
Modeling with Multiplex Attention (IMMA), overcomes these issues by using a multiplex graphlatent structure to model multiple interaction types, with attention graph layers that can capture the strength of relations.
Furthermore, we propose a training approach for IMMA that we call Progressive Layer Training (PLT).
Learning in high-dimensional space often leads to highly-entangled representations that are uninterpretable [44], but adding explicit disentanglement objectives often leads to decreased model performance [10, 18].
Inspired by the concept of “starting easy” and curriculum learning [5], we train our model to learn progressively, one latent layer at a time.
In addition to improving performance, training IMMA with PLT also improves interpretability—offering the potential to answer questions such as: "Who causes an agent to behave this way?"
Using our method, we conduct experiments in a range of social multi-agent environments inspired by real-world scenarios: social navigation, cooperative task achievement, and team sports.
We evaluate models on trajectory prediction, we analyze the relations inferred by our model, and we explore the important role these inferred relations play in making accurate predictions.
Additionally, we show that IMMA is effective at zero-shot generalization and conditional generation.
To summarize,
• We propose Interaction Modeling with Multiplex Attention (IMMA), a model that uses a new latent space structure which we call Multiplex Attentional Graph.
It models relations and utilizes these relations to make forecasting predictions.
• We propose a training technique that is enabled by the multiplexed latent structure: Progressive Layer Training (PLT).
PLT enables our model to learn types of interactions one at a time and furthers the performance and interpretability of IMMA.
• Empirically, we show that our method (IMMA w/ PLT) outperforms the state-of-the-art models on three different social multi-agent environments.
To understand the interpretability of our approach, we evaluate our method on relational inference and conduct
a conditional generation experiment.
We also compare various ablated and modiﬁed versions of our method, including incorporation of a well-established approach for learning disentangled representations, to understand the contribution of each components.
Furthermore, we showcase the superior sample efﬁciency and generalization ability of our model.
Related Work
Many approaches have been proposed to model multi-agent interactions, especially as a crucial step toward achieving better performance in tasks such as model-based reinforcement learning [37, 48], trajectory prediction [34], and motion planning [40].
In particular, social dynamics modeling has been studied in domains such as human crowds [34], team sports [12, 22, 27], and trafﬁc participants [35] where the interactions between entities lead to highly complicated motion or behavior patterns.
Many earlier works, such as Social Forces [17], are deterministic regression models that model humans as objects affected by forces.
The rise of deep learning ushered in various neural network based models such as Social-LSTM [1]—an LSTM model with a social pooling layer, social-GAN [13]—a
GAN combined with sequence-to-sequence model, Social-Attention [42]—a recurrent neural network that makes use of attention mechanism, and others [11, 25].
Researchers also proposed to model interactions with networks that were inspired by a Theory of Mind framework [32, 33].
Our work is different as we explicitly infer an interpretable discrete structure and perform inference over it.
In recent years, graph representation learning has been investigated for relational reasoning in multiagent systems, where nodes represent interacting entities and edges represent their relations [4].
Most existing graph-based methods infer interactions implicitly [3, 7, 19, 26, 29, 35, 36], meaning that little to no interpretable abstractions can be extracted from the models.
Other works take pre-deﬁned graph topology based on heuristics as input [1, 23].
NRI [22], DNRI [12], RFM [39], and EvolveGraph [27] takes a step forward to reason about relations by inferring the topology of the underlying interaction graphs.
NRI [22] takes the form of a variational auto-encoder while RFM[39], having near-identical architecture as NRI, simply uses a forward prediction framework.
All these methods model interactions as latent interaction graphs and leverage them to make future predictions.
Our work falls into this line of research with signiﬁcant improvements to performance in terms of both relational inference and trajectory prediction because of (1) the novel multiplexed latent structure, (2) the incorporation of an attention mechanism, and (3) a progressive training strategy.
Methods
In this section, we deﬁne our problem and introduce our proposed model (IMMA) and training strategy (PLT).
Our input consists of trajectories of N agents.
We denote by x ti the feature vector of agent i at time t , e.g. location.
We denote by x t = { x t 1 , ..., x tN } the set of features of all N agents at time t and by X T 1 : T 2 = { x T 1 : T 2 i , i = 1 , ..., N } the set of features covering time steps from T 1 to T 2 .
The task is to take trajectory observations as input and learn to predict successive trajectories of all agents.
We aim to estimate p ( X T h
+1:
T h + T f | X 1: T h ) , where T h is the historical horizon and T f is the forecasting horizon.
Note that even though agents can have relations and goals that vary in different instances, these must be inferred entirely through the supervision signals of the trajectory prediction task (with no supervision of the relations themselves).
3.1 Interaction Modeling with Multiplex Attention
We propose Interaction Modeling with Multiplex Attention (IMMA) - a model that consists of an encoder and a decoder trained jointly.
The encoder takes a sequence of observations (i.e. trajectories) as input and outputs a latent interaction graph.
Subsequently, the decoder predicts future trajectories by performing message passing among agents (nodes) with the inferred latent interaction graph.
IMMA assumes that the dynamics of multi-agent systems can be abstracted to a latent graph structure (i.e. a vector of categorical latent variables)
z = { z ij } , where z ij represents relations between agents i and j .
We optimize the variational lower bound, as in the conditional variational autoencoder (CVAE) [38, 21]:
[Equation]
The encoder (approximated posterior) q φ ( z | X 1: T h + T f ) is a neural network with parameters φ , the decoder (likelihood) p θ ( X T h
+1:
T h + T f | X 1: T h , z ) is a neural network with parameters θ , and p ( z ) denotes the prior 3 .
In previous works [22, 27, 39, 12], the latent graph z is inferred by performing edge-type classiﬁcation.
That is, z represents the likelihoods of edges in the latent graph belonging to a set of classes.
However, in social dynamical systems multiple types of independent interactions can coexist, with different strengths of relations within an interaction type.
In this case, representing the interactions with a single graph with many edge types requires many more edge types to accommodate all possible combinations of interactions.
More concretely, consider a navigational environment consisting of two independent types of relations: friendship (i.e. target-seeking interaction) and proximity (i.e. collision-avoidance interaction).
To model this environment with a single graph with many edge types, intuitively we might expect to need at least four edge classes to represent the interactions ( none , only friendship , only proximity , and friendship + proximity ) and many more if we want to model the interactions with higher ﬁdelity (e.g. treating strong friendship differently from weak friendship ).
Furthermore, since z is learned to encode likelihood of an edge belonging to a particular class, it may struggle to capture relative strengths of interactions between agents.
In the following, we describe how IMMA (depicted in Fig. 2) tackles these limitations, as we introduce the encoder and decoder in more detail.
Encoder with
Multiplex Attentional Latent
Graphs The goal of the encoder is to infer a latent interaction graph.
To achieve this, we use a GNN on a fully-connected directed graph without self-loops, where each vertex represents an agent.
Let x
j denote the feature vector of agent j across all input frames ( x 1 j , ..., x T h j ) .
The GNN embeds agent trajectories (e.g. x j ) into edge embeddings, which are then passed through a MLP to derive unnormalized edge weights (e.g. e ( i,j ) ).
e ( i,j ) is a vector with dimensionality K , a hyperparameter that determines the number of layers in the latent graph.
Details of the GNN can be found in the Appendix.
Previous approaches attempt to classify edges into one out of the K possible edge types.
They derive z ij by applying a softmax on e ( i,j ) such that (cid:80) k
= K k
=1 z kij
= 1 with z k the k -th layer of the latent graph.
We propose a novel way to construct the latent space using a multiplex attentional graph.
Instead of performing edge-type classiﬁcation, we perform multi-class prediction on edge embeddings, yielding multiplexed layers, and introduce an attention mechanism between agents within each of these layers.
That is,
[Equation]
where N j denotes the neighbors of
agent j
(we assume a fully connected graph; thus, N j includes all other agents except j itself).
Note that z ij is different than z ji .
With Eq. 2, layers of the latent graph are separable by construction.
By separable, we mean that individual layers of the latent graph (e.g. z 1 and z 2 ) can be inferred by separate encoders that does not share any parameters.
Intuitively, a multiplex latent space allows us to model independent interactions naturally, and the attention mechanism captures strengths of relations.
Decoder The task of the decoder is to predict the dynamics of the system using the latent interaction graph z and the past dynamics.
That is, we want to model p θ ( X T h
+1:
T h + T f | X 1: T h , z ) .
One common issue when training such a decoder is that it might learn to ignore the latent variables while achieving only a marginally worse prediction loss.
To avoid this problem, our decoder ﬁrst learns agent-centric representations ˜ h tj = ˜ f emb ( x j ) (i.e. representations are embedded individually for each agent), and then uses these as node embeddings to perform message passing.
The decoder thus has to rely on the inferred latent graph to exchange information between agents.
After learning agent-centric representations, we use GraphGRU [39] and a readout function to decode future trajectories:
[Equation]
The details of a GraphGRU block are elaborated in the Appendix.
Unlike a typical Graph Attention
Network [41] where the graph at every message passing layer is inferred, the same (multiplex) graph is used across all decoding steps.
can re-evaluate the encoder for every time step to obtain a dynamically changing latent graph, however we leave this to future work.
3.2 Progressive Layer Training
The role of the encoder is to infer a set of graph bases ( z 1 , z 2 ... )
that reﬂect the underlying dynamics of the environment.
Since the messages are ﬁrst passed within layers before summing up at the end, it would be useful for the latent graph layers to represent different types of interactions between agents.
However, it is difﬁcult for the model to learn all the interactions, let alone have them be disentangled.
Disentanglement is typically achieved by imposing additional loss, yet these approaches tend to come with the trade-off of decreased reconstruction quality [10, 18, 24].
Motivated by curriculum learning [5] and progressive learning [28] (or more broadly the concept of “starting easy”), we propose to overcome this trade-off with Progressive Layer Training (PLT) — a strategy of learning a set of good graph bases by learning the high-level and most consequential interactions ﬁrst and then progressively growing the network to model lower-level and more intricate interactions.
We ﬁrst train a IMMA with a single-layered latent graph z 1 , then add a second layer z 2 by training a second encoder while freezing the weights of the ﬁrst.
This process can be repeated until no further improvement is observed.
The fact that we can choose to have a separable latent space and do not have to share any parameters between these encoders is a result of our latent space being multiplexed.
Directly adding new components to a trained network can introduce a sudden shock to the gradient.
To stabilize training, we adopt “fade-in” [20] to smoothly blend the new and existing network components.
Refer to the Appendix for more details.
Experiments
We design our experiments to answer the following questions:
Q1 :
Does our approach (IMMA w/ PLT) consistently outperform prior methods across a diverse set of social multi-agent environments and benchmarks?
Q2 :
Does the use of multiplex attentional latent graph give more interpretable abstractions?
Q3 :
How much does each component contribute to the ﬁnal performance?
Q4 :
Is our approach sample efﬁcient?
Can it generalize well to novel environments?
To answer Q1 , we test our approach in three multi-agent environments that each exhibited multiple types of social interaction: our simulated Social Navigation Environment, PHASE [30], and the NBA dataset (used in [22, 27, 49, 47, 15]).
We develop the ﬁrst benchmark ourselves, while the latter two are established benchmarks.
For each environment, the model receives multi-agent trajectories of length 24 as observation and predicts 10 future time steps.
For Social Navigation we use 100k multi-agent trajectories (in total for training, validation, and testing), for NBA dataset we use 300k multi-agent trajectories, and for PHASE we use 836 multi-agent trajectories.
We also perform data augmentation, as described in the Appendix.
To answer Q2 , we evaluate the inferred interaction graphs for the Social Navigation Environment and PHASE, since we have the ground truth interaction graph.
Note that we are not supervising on any explicit relations of agents.
We further conduct qualitative experiments to understand the abstractions provided by the latent graph.
To answer Q3 , we conduct an ablation study.
For Q4 , we perform a sample efﬁciency experiment and an experiment of zero-shot generalization.
Experiments for Q3 and Q4 are conducted on the Social Navigation
Environment as we have full control over it.
4.1 Experiment Setup
Here we describe the environments and baselines.
More details are in the Appendix.
Social Navigation Environment The Social Navigation Environment simulates a socially interactive crowd where agents seek to meet up with other agents while simultaneously navigating to avoid collisions within the crowd (as schematized in Fig. 1).
This environment allows ﬁne-grained control by simulating lower-level interaction dynamics using Optimal Reciprocal Collision Avoidance (ORCA, [6]) like many other crowd navigation works [8, 9].
With this environment, we can easily vary environmental parameters to generate diverse trajectories for our generalization experiment.
We experiment primarily with an environment consisting of ﬁve agents.
For each simulated episode, a social interaction graph of the agents is randomly generated: each agent is assigned to be the follower of another agent.
Agents are initialized to positions along the edge of a circle.
Dynamics is simulated using ORCA by assigning the position of each agent’s leader (at each time step) as the target destination of that agent.
These environment settings yield reasonably complex trajectories that were clearly inﬂuenced by the social interaction graph and collision avoidance, as seen in example trajectories of Fig. 3.
PHASE dataset PHASE [30] is a simulator for physically-grounded abstract social events, in which social recognition and social prediction algorithms can be benchmarked.
In PHASE, two animated agents move in a continuous 2D space and interact with each other and other objects ( balls).
Their actions are generated using a physics engine and a hierarchical planner [30].
We choose the “collaboration” task for our experiment, in which two agents collaborate to move one of the balls to a pre-speciﬁed landmark location.
Diverse trials are generated by randomizing the agents’ and balls’ starting locations as well as orientations, target ball, and target landmark.
Note that this dataset is substantially smaller than the two other datasets.
NBA dataset
The National Basketball Association (NBA) dataset consists of position trajectories for ten interacting basketball players and the ball and uses real-world player tracking data.
The task
[Table] [Table]
is to predict 10 future time steps (4s) based on a history of 24 time steps (10s).
Team information is an additional input feature.
The unit reported is meters.
Baselines We consider the following baselines and ablations.
MLP : a large MLP network that takes the concatenated features of all agents across all timesteps as input and output trajectory predictions of all agents at the same time.
• GAT_LSTM : a network with Graph Attention layers [41] followed by LSTMs.
• NRI [22]: a VAE model with recurrent GNN modules.
• EvolveGraph
[19]:a model that expands upon the framework of NRI and introduces a doublestage training pipeline to account for an evolving interaction graph.
• RFM [39]: a recurrent GNN model of similar architecture to NRI, but with a supervised loss instead of a variational lower bound loss.
• RFM (skip 1) : a RFM model with the ﬁrst edge type is “hard-coded” as “non-edge” (i
e. no messages are passed along edges of the ﬁrst layer).
• fNRI [43]: a NRI model that uses a multiplex latent graph structure (i.e., sigmoid activation).
• IMMA (SG) :
IMMA with a single layer of attentional latent graph.
• IMMA (MG) : IMMA with multiple layers of attentional latent graphs (a multiplex graph) trained simultaneously, without PLT.
We are aware that there are other relevant baselines such as Social-LSTM [1], Social-GAN [13], and
Trajectron++ [35] etc.
We choose to compare with EvolveGraph, because it consistently outperforms these models across datasets [27].
4.2 Trajectory Prediction
To answer Q1 , we evaluate all models on their prediction performance of agent position on future trajectories with two metrics: average displacement error (ADE) and ﬁnal displacement error (FDE).
Both of these are metrics widely used in trajectory prediction literature: ADE is deﬁned as the average deviated distance of all entities within the prediction horizon, and FDE is deﬁned as the deviated distance of all entities at the last predicted time step.
The results on the Social Navigation Environment, PHASE, and the NBA dataset are shown in table 1.
We found that using multiplex attentional latent graph with progressive layer training (MG w/ PLT) yields the best performance on all three datasets, outperforming previous state-of-the-art models.
On the Social Navigation Environment and the NBA dataset, IMMA without progressive layer training (MG) still performs better than all baselines, showing the effectiveness of using multiplex attentional graph as latent structure.
We visualize the prediction results of our method and the best performing baseline (RFM) in Fig.
3 on the Social Navigation Environment.
Visualizations of PHASE and the
NBA dataset are shown in Fig.
4 (more can be found in the Appendix).
4.3 Relational Analysis and Interpretability
To answer Q2 , we conduct experiments to understand what abstractions can be extracted from the inferred multiplex attentional graph.
We ﬁrst compare the performance of our approach to the same set of baselines used in the previous experiment on relational inference.
Intuitively, this is to evaluate how well models can answer the question “What causes an agent to behave this way?”
Refer to the Appendix for details on how we calculate the graph accuracy.
We conduct this experiment in the Social Navigation Environment and PHASE, since we have access to the ground-truth social interaction graph for these two environments.
IMMA more accurately estimates the underlying social interaction graph (Table 2).
The results can also explain the beneﬁts of training IMMA with PLT: by leveraging the graph accuracy prediction that arises from using a single graph layer, but with the expressive power of a full multiplex graph.
To further understand how IMMA uses the inferred social graph, we assess how the trajectory predictions are altered if we manually manipulate the latent graph.
More formally, we ask our decoder to generate new trajectories conditioned on the new latent graph p θ ( X T h
+1:
T h + T f | X 1: T h , z new ) .
In
Fig.
5, we see that with IMMA, changing the leader of an agent clearly alters the predicted trajectory to target that new leader while keeping the predictions for other agents intact, whereas the generated trajectories of the baseline consist of unrealistic turns (red agent 0) and the predicted trajectories of other agents deteriorates at the same time.
Using the trajectories shown in Fig.
5, we ran a human study and our model’s prediction is judged as more reasonable than the RFM model’s in 76.67% of the trials.
Find more details of the human study in Appendix section C.
4.4 Ablation Study
To answer Q3 , we experiment with three ablated versions of our model.
We ensure that all ablated versions have around the same amount of total parameters and have two layers of latent graphs.
Additionally, we measure the information dependency between the two layers of latent graph with
Normalized Mutual Information (NMI) score (details in the Appendix).
Results are shown in Table 3.
The ﬁrst column in the table shows the performance of a model where the latent graph structure are edge types between all pairs of agents.
It has an NMI score of 1.0 (complete dependency) because the second layer of latent graph is simply one minus the ﬁrst layer of latent graph.
We observe that the biggest gain arose from using a multiplex attention graph and Progressive Layer Training furthers the performance.
We also see that both components contribute to decreased information dependency
[Table] [Table]
[Figure]
between two latent graph layers without explicitly encouraging disentanglement.
Although imposing an additional loss to disentangle between two latent graph layers does yield the smallest NMI score, it comes with the trade-off of decreased forecasting accuracy as observed in other works [10, 18, 24].
4.5 Sample Efﬁciency and Generalization
To answer Q4 , we investigate sample efﬁciency and observe that our method consistently outperforms the strongest baseline (RFM) on smaller sample complexity regimes (Fig. 6).
We test zero-shot generalization performance in response to three environment modiﬁcations: agents moving twice as fast (2x speed), crowding the agents into half as much space (2x smaller environment), and doubling the number of agents (2x more agents).
As shown in Table 4, MG and MG+PLT versions of IMMA outperform the baselines in all metrics.
Additionally, as shown in Appendix Table 5, the change in performance on the generalization scenarios relative to the original environment was similar to or better than the baselines in all metrics
Conclusion
Multi-agent dynamics can often be complex as a result of many layers of underlying social interactions.
Agents can be inﬂuenced by multiple independent types of relationships with each agent, leading to properties (such as intentionality or cooperation) that are often absent in simpler physical systems.
We developed a method that uses multiplex attentional graphs as latent representations to model the dynamics that can arise from such multi-layered multi-agent interactions.
Addressing key aspects of social interaction, our method consistently outperforms other state-of-the-art methods in modeling the dynamics of social multi-agent systems.
We foresee minimal direct negative societal impact — please see Appendix for further discussion.
Future work will extend this approach to active learning settings and investigate using our method to guide model-based reinforcement learning agents.
Acknowledgements
I.K. is a Merck Awardee of the Life Sciences Research Foundation, and a Wu Tsai Stanford Neurosciences Institute Interdisciplinary Scholar.
This work is also in part funded by the Toyota Research
Institute (TRI), the Stanford Institute for Human-Centered AI (HAI), ONR MURI N00014-22-12740, Meta, Salesforce and Samsung.
N.H. is further funded by the GSE Transforming Learning
Accelerator.
A Societal Impact
This work has the potential for wide-ranging applications in human-in-the-loop (e.g. assistive and social robotics, self-driving vehicles) and completely autonomous systems.
Such systems have the potential for negative societal impact (e.g. harmful dual use), and as researchers we must critically evaluate such applications and promote beneﬁcial ones.
B Additional details of our method
Conditional VAE Formulation Note that in the formulation (1), the approximated posterior is conditioned on all frames.
However, if we train the encoder on all frames, we would need to sample latent variables from the prior at test time.
As we would not be able to infer the most likely latent variables based on the historical trajectories (i.e. could not infer relations) [2], that would be undesirable.
Thus, we use the form q φ ( z | X 1: T h ) in place of q φ ( z | X 1: T h + T f ) .
GNN The GNNs used in the encoder consist of the following message passing operations:
[Equation]
where x j is the input trajectory of agent j and f ( ... ) are MLPs.
In our experiments we only perform two rounds as message passing even though the above message passing operations can be performed for more than two rounds.
h ( m ) i and e ( m ) ( i,j ) denote the embedding of agent i and embeddings of edge ( i, j ) after m rounds of message passing, respectively.
Note that this is not to be confused with e k ( i,j ) , which is used to denote the k -th element of the vector e (2)( i,j ) in section 3.
In a single pass, Eqs.
(6)–(8), the resulting edge embedding e (1)( i,j ) only depends on x i and x j , ignoring interactions with other nodes, while e (2)( i,j ) uses information from the whole graph.
Multiplex Attentional Graph
In previous works [22, 27, 39, 12], the latent graph (posterior) is inferred by performing edge type classiﬁcation on the edge embeddings.
That is,
[Equation]
where z 1 denotes the ﬁrst layer-graph and z 1 ij denotes the relational strength of agents i and j in the ﬁrst layer-graph.
(cid:80) a z aij = 1 directly follows from the above equation for all ( i, j ) pairs.
We propose a novel way to construct the latent space through multiplex attentional graphs.
Instead of performing edge-type classiﬁcation on edge embeddings, we learn layers of disentangled attentional graph from edge embeddings.
Contrast Eq.
(2), the latent space construction of our model, to Eq.
(10), latent space construction of previous works.
GraphGRU In this paper, we will use h to represent embeddings in the encoder and ˜ h for embeddings in the decoder.
Recall that ˜ h tj = ˜
f emb ( x j ) is the agent-centric representations inferred by a
MLP ˜ f emb .
It is used as the input to the GraphGRU in the decoder and K is the number of latent graph layers.
The GraphGRU used in our decoder consists of the following operation:
[Equation]
The input to the message passing operation is the recurrent hidden state at the previous time step.
f
out denotes an output transformation.
For each node/agent j the input to the GRU update is the concatenation of the aggregated messages MSG t +1 j , the current input x t +1 j , and the previous hidden state ˜ h tj .
Progressive Layer Training we propose Progressive Layer Training (PLT) - a strategy of learning interactions (i.e. latent graphs) of the highest signiﬁcance to the lowest in a progressive manner.
More speciﬁcally, we start by only allowing the network to use one layer of latent graph to conduct message passing, and then progressively release more latent graph layers while ﬁxing the previously learned latent layers and their corresponding network components.
To do this, we introduce a coefﬁcient α to
Eq.
(11) when growing new components:
[Equation]
where z new is the newly introduced latent graph layer and all the other latent graph layers z a and their corresponding encoders have their weights ﬁxed.
A new encoder q φ new ( X 1: T h ) with parameters φ new is introduced to infer z new .
We increase α linearly from 0 to 1 within a certain number of iterations (500 epochs in our experiments).
C Human Experiment on the Realism of Figure
Using the trajectories shown in Fig.
5, we ran a two-alternative forced (2AFC) choice human study with 20 subjects, in which subjects were asked to choose which model’s prediction is more reasonable (RFM vs. ours).
In each of the three trials, the order of the predictions is randomized and the subjects do not have access to which prediction is generated by which model.
The results show that our model’s prediction is judged as more reasonable than the RFM model’s in 76.67% of the trials.
D Additional Experimental Details and Results D.1 Experiment Details
For the Social Navigation Environment, we follow the environmental conﬁgurations set in [8, 9] 4 .
In this simulation, agents are controlled by ORCA [6].
We set the radius of agents to 0.3, the radius of the circular environment to 8, the safety space to 0.09, calculation time horizon (for ORCA) to 1, preferred speed of agents to 1.
For Social Navigation we use 100k multi-agent trajectories, in total for training, validation, and testing.
We simulate 100k samples in total for training, validation, and testing.
For PHASE 5 , we choose the “collaboration" task, use environment layout
(no walls), and follow the default simulation conﬁguration in [30].
Since the ofﬁcial dataset of PHASE is small, we resort to generating our own dataset with their simulator.
836 multi-agent trajectories are generated by randomizing the agents’ and balls’ starting locations as well as orientations, target ball, and target landmark, resulting in a diverse set of behaviors.
The dataset will be made public.
When training models on PHASE, we do data augmentation on the training set by ﬂipping the environment and rotating it by 90%, 180%, and 270%, resulting in a training set with 8x more instances.
For the NBA dataset, we use 300k multi-agent trajectories in total 6 for training, validation, and testing.
For all dataset, we use 80% for training, 10% for validation, and 10% for testing.
For all experiments and all models, we use a batch size of 64 and use the same convergence criteria: terminate when the performance of the model on the validation dataset has not improved for more than 100 epochs.
We use Adam optimizer with an initial learning rate of 1e-6 and decays the learning rate by a factor of 0.9 if the validation performance has not improved in 5 epochs.
For the Social Navigation
Environment and PHASE experiment, we use all (graph-based) models with 2 latent graph layers and for the NBA dataset we use 5 for all graph-based models (NRI [22],RFM [39],EvolveGraph [27], and IMMA).
We use a hidden size of 96, 156, 256 for the Social Navigation Environment, PHASE, and the NBA dataset, respectively.
We implement all models and simulations of all environments in PyTorch [31].
All graph-based models use MLP encoders and RNN decoders, both of which are elaborately described in the Appendix of [22] (section C).
The only difference of our model’s architecture to theirs is that we use agent-centric representations ˜ h tj = ˜
f emb ( x j ) before decoding future trajectories with GraphGRU.
We implement ˜ f emb as a 3-layer MLP with batch normalization, dropout, and ELU activations.
All trainings are done on a workstation with 8 Nvidia A40 GPUs and 1008G of RAM.
We only referenced Github repositories with none or MIT license.
To calculate relational inference accuracy (graph accuracy) used in Table 2 and 4, we ﬁrst ﬁnd out the agent that corresponds to the column with the largest weight for each row (“column agent”) of the adjacency matrices.
Then, we construct an edge from the agent that corresponds to the row to the “column agent” then compare this with the ground truth graph.
This comparison is fair to the baselines because we are constructing the same amount of edges for all models (i.e. one outbound edge for each agent).
Note that ground truth graphs exist only for the Social Navigation Environment and PHASE.
To avoid complications in calculating the mutual information betweeen two continuous vectors for the ablation study, we adopt the following procedure to calculate a “discrete” NMI score (used in Table 3): (1) label each element in the graph by their ordering within the row (e.g. [0.1, 0.9, 0.4, 0.5, 0.3] is transformed into [5, 1, 3, 2, 4]) and (2) calculate the averaged normalized mutual information between rows in graph one and rows in graph two.
Intuitively, this metric measures “how much information does knowing about the ﬁrst graph tell me about the second graph?”
D.2 Relative Zero-shot Generalization Performance
The top-most two metrics demonstrate that the change in performance of IMMA on generalization scenarios relative to the original environment is similar, and in many cases better, than the baselines; lower numbers are better, as they mean that the performance dropped less.
The bottom-most four metrics demonstrate that IMMA (MG+PLT) outperforms the baselines by a similar, and in many cases better, percentage across generalization scenarios; higher numbers indicate better IMMA generalization performance, as they mean that IMMA (MG+PLT) more outperforms that baseline on the generalization scenario, relative to on the original environment
[Table]
[Figure] [Figure]
is essentially Figure 3 but with the second latent layer visualized, demonstrating that the second layer captures different interactions than the ﬁrst layer