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 known graph",
label: "Learns topology without prior adjacency examples.",
},
{
value: "Unknown dynamics",
label: "Uses observed states instead of hand-specified equations.",
},
{
value: "Attention as edges",
label: "Interprets learned attention scores as the graph estimate.",
},
];
const steps = [
"Embed every agent into a shared latent space.",
"Project embeddings into key/query vectors and compute pairwise attention.",
"Translate observed agent states into values.",
"Predict the next state and read the attention matrix as topology.",
];
export const metadata: Metadata = {
title: "Graph Attention Topology Inference",
description:
"Project page for Graph Attention Inference of Network Topology in Multi-Agent Systems.",
openGraph: {
title: "Graph Attention Inference of Network Topology in Multi-Agent Systems",
description:
"A graph-attention approach for inferring hidden network topology from multi-agent trajectories.",
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 (
Inferring the hidden graph behind a multi-agent system by training attention to predict what each agent does next.
{item.value}
{item.label}
Overview
The paper studies a practical problem in networked multi-agent systems: the agents move, synchronize, or converge, but the interaction graph behind that behavior is not given.
The model is trained on state trajectories from consensus dynamics and Kuramoto oscillators. During prediction, attention scores between agent embeddings become an interpretable approximation of the adjacency matrix.
Method
Instead of supervising the graph directly, the model learns to forecast the system. The attention matrix is then thresholded and compared with the true graph.
Results
F1 link-prediction scores are above a random baseline for both tested dynamics. Consensus dynamics are easier than Kuramoto oscillators, while additional simulation data improves larger-agent inference.
training behavior
Attention first learns the obvious self-dependencies, then gradually recovers inter-agent structure as training progresses.
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}
}`}