atlas

Research map / Graph learning / Knowledge and temporal graphs

AEGNN: Asynchronous Event-Based Graph Neural Networks

CVPR 2022 · Graph learning › Knowledge and temporal graphs · approach: Temporal graph neural architectures · 157 citations (OpenAlex)

Check your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use asynchronous sparse graph updates instead of dense GNN updatesGNN · N-Caltech101MFLOPs per event: 1.72\cdot 10^3 -> 4.29Helped
Use asynchronous sparse graph updates instead of dense GNN updatesGNN · N-Caltech101 (25,000 events)latency: 1014 ms -> 129 msHelped
Use AEGNN instead of AsyNetevent-based object detection · N-Caltech101mAP: 0.643 -> 0.595Hurt
Use AEGNN instead of AsyNetevent-based object detection · Gen1mAP: 0.129 -> 0.163Helped
Use AEGNN instead of AsyNetevent-based object detection · Gen1MFLOP/ev: 205 -> 5.26Helped
Use AEGNN instead of NVS-Sevent-based object detection · N-Caltech101mAP: 0.346$^*$ -> 0.595Helped
Use AEGNN instead of REDevent-based object detection · Gen1mAP: 0.40 -> 0.163Hurt
Uniformly subsample the input eventsAEGNN · object recognitionoverfittingHelped
Use non-uniform grid sampling instead of uniform samplingAEGNN · object recognitionperformanceNo clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy