import Image from "next/image";
import Link from "next/link";
import type { Metadata } from "next";
import architectureImage from "@/public/images/graph-attention-topology/model-architecture.png";
import simulationImage from "@/public/images/graph-attention-topology/simulation-dynamics.png";
import resultsImage from "@/public/images/graph-attention-topology/f1-results.png";
import attentionImage from "@/public/images/graph-attention-topology/attention-training.png";
const paperLinks = [
{ href: "https://arxiv.org/abs/2408.15449", label: "arXiv" },
{ href: "https://arxiv.org/pdf/2408.15449", label: "PDF" },
{ href: "https://doi.org/10.48550/arXiv.2408.15449", label: "DOI" },
];
const highlights = [
{
value: "No graph labels",
label: "Learns from trajectories without seeing adjacency examples.",
},
{
value: "Unknown dynamics",
label: "Works from observed state sequences, not hand-written dynamics.",
},
{
value: "Attention becomes edges",
label: "Uses attention scores as the topology estimate.",
},
];
const steps = [
"Put each agent in a shared latent space.",
"Build key/query pairs and compute attention between agents.",
"Use observed states as the values passed through attention.",
"Forecast the next state, then threshold attention to recover topology.",
];
export const metadata: Metadata = {
title: "Graph Attention Topology Inference",
description:
"A project page for inferring hidden multi-agent network topology with graph attention.",
openGraph: {
title: "Graph Attention Inference of Network Topology in Multi-Agent Systems",
description:
"Inferring hidden network topology from multi-agent trajectories with graph attention.",
type: "article",
publishedTime: "2024-10-26",
images: [
{
url: "/images/graph-attention-topology/model-architecture.png",
width: architectureImage.width,
height: architectureImage.height,
alt: "Graph attention model architecture",
},
],
},
};
function ExternalLink({ href, label }: { href: string; label: string }) {
return (
{label}
);
}
function Figure({
src,
alt,
caption,
className = "",
}: {
src: typeof architectureImage;
alt: string;
caption: string;
className?: string;
}) {
return (
We use next-state prediction to expose the interaction graph behind a multi-agent system.
{item.value}
{item.label}
Overview
In many multi-agent systems, you can watch agents move, synchronize, or settle, but you are not given who influences whom.
This project tests whether a predictor trained on trajectories can recover that missing adjacency matrix. On consensus dynamics and Kuramoto oscillators, the learned attention scores become a usable proxy for edges.
Method
The model learns the dynamics first. After training, we threshold the attention matrix and compare the inferred edges with the true graph.
Results
F1 scores beat a random baseline for both dynamics. Consensus is the easier case; Kuramoto needs more data as the number of agents grows.
training trace
Early training mostly finds self-dependencies. Later epochs start assigning weight to the agent-to-agent links.
Citation
Graph Attention Inference of Network Topology in Multi-Agent Systems. Akshay Kolli, Reza Azadeh, and Kshitij Jerath. Accepted at the Modeling and Estimation Control Conference, 2024.
{`@misc{kolli2024graphattentioninference,
title={Graph Attention Inference of Network Topology in Multi-Agent Systems},
author={Kolli, Akshay and Azadeh, Reza and Jerath, Kshitij},
year={2024},
eprint={2408.15449},
archivePrefix={arXiv},
primaryClass={cs.MA}
}`}