Generalised f-Mean Aggregation for Graph Neural Networks

Graph Neural Network (GNN) architectures are defined by their implementations of update and aggregation modules. While many works focus on new ways to parametrise the update modules, the aggregation modules receive comparatively little attention. Because it is difficult to parametrise aggregation functions, currently most methods select a ``standard aggregator'' such as $\mathrm{mean}$, $\mathrm{sum}$, or $\mathrm{max}$. While this selection is often made without any reasoning, it has been shown that the choice in aggregator has a significant impact on performance, and the best choice in aggregator is problem-dependent. Since aggregation is a lossy operation, it is crucial to select the most appropriate aggregator in order to minimise information loss. In this paper, we present GenAgg, a generalised aggregation operator, which parametrises a function space that includes all standard aggregators. In our experiments, we show that GenAgg is able to represent the standard aggregators with much higher accuracy than baseline methods. We also show that using GenAgg as a drop-in replacement for an existing aggregator in a GNN often leads to a significant boost in performance across various tasks

Generalising Multi-Agent Cooperation through Task-Agnostic Communication

Existing communication methods for multi-agent reinforcement learning (MARL) in cooperative multi-robot problems are almost exclusively task-specific, training new communication strategies for each unique task. We address this inefficiency by introducing a communication strategy applicable to any task within a given environment. We pre-train the communication strategy without task-specific reward guidance in a self-supervised manner using a set autoencoder. Our objective is to learn a fixed-size latent Markov state from a variable number of agent observations. Under mild assumptions, we prove that policies using our latent representations are guaranteed to converge, and upper bound the value error introduced by our Markov state approximation. Our method enables seamless adaptation to novel tasks without fine-tuning the communication strategy, gracefully supports scaling to more agents than present during training, and detects out-of-distribution events in an environment. Empirical results on diverse MARL scenarios validate the effectiveness of our approach, surpassing task-specific communication strategies in unseen tasks. Our implementation of this work is available at https://github.com/proroklab/task-agnostic-comms.Comment: 12 pages, 6 figures, submitted to Distributed Autonomous Robotic Systems (DARS 2024

Reinforcement Learning with Fast and Forgetful Memory

Nearly all real world tasks are inherently partially observable, necessitating the use of memory in Reinforcement Learning (RL). Most model-free approaches summarize the trajectory into a latent Markov state using memory models borrowed from Supervised Learning (SL), even though RL tends to exhibit different training and efficiency characteristics. Addressing this discrepancy, we introduce Fast and Forgetful Memory, an algorithm-agnostic memory model designed specifically for RL. Our approach constrains the model search space via strong structural priors inspired by computational psychology. It is a drop-in replacement for recurrent neural networks (RNNs) in recurrent RL algorithms, achieving greater reward than RNNs across various recurrent benchmarks and algorithms without changing any hyperparameters. Moreover, Fast and Forgetful Memory exhibits training speeds two orders of magnitude faster than RNNs, attributed to its logarithmic time and linear space complexity. Our implementation is available at https://github.com/proroklab/ffm

A search for resonances decaying into a Higgs boson and a new particle X in the XH→qqbb final state with the ATLAS detector

A search for heavy resonances decaying into a Higgs boson ($H$) and a new particle ($X$) is reported, utilizing 36.1 fb$^{-1}$ of proton-proton collision data at $\sqrt{s} =$ 13 TeV collected during 2015 and 2016 with the ATLAS detector at the CERN Large Hadron Collider. The particle $X$ is assumed to decay to a pair of light quarks, and the fully hadronic final state $XH \rightarrow q\bar q'b\bar b$ is analysed. The search considers the regime of high $XH$ resonance masses, where the $X$ and $H$ bosons are both highly Lorentz-boosted and are each reconstructed using a single jet with large radius parameter. A two-dimensional phase space of $XH$ mass versus $X$ mass is scanned for evidence of a signal, over a range of $XH$ resonance mass values between 1 TeV and 4 TeV, and for $X$ particles with masses from 50 GeV to 1000 GeV. All search results are consistent with the expectations for the background due to Standard Model processes, and 95% CL upper limits are set, as a function of $XH$ and $X$ masses, on the production cross-section of the $XH\rightarrow q\bar q'b\bar b$ resonance