HyperAIHyperAI

Command Palette

Search for a command to run...

5 months ago

TENNs-PLEIADES: Building Temporal Kernels with Orthogonal Polynomials

Pei Yan Ru ; Coenen Olivier

TENNs-PLEIADES: Building Temporal Kernels with Orthogonal Polynomials

Abstract

We introduce a neural network named PLEIADES (PoLynomial Expansion InAdaptive Distributed Event-based Systems), belonging to the TENNs (TemporalNeural Networks) architecture. We focus on interfacing these networks withevent-based data to perform online spatiotemporal classification and detectionwith low latency. By virtue of using structured temporal kernels andevent-based data, we have the freedom to vary the sample rate of the data alongwith the discretization step-size of the network without additional finetuning.We experimented with three event-based benchmarks and obtained state-of-the-artresults on all three by large margins with significantly smaller memory andcompute costs. We achieved: 1) 99.59% accuracy with 192K parameters on theDVS128 hand gesture recognition dataset and 100% with a small additional outputfilter; 2) 99.58% test accuracy with 277K parameters on the AIS 2024 eyetracking challenge; and 3) 0.556 mAP with 576k parameters on the PROPHESEE 1Megapixel Automotive Detection Dataset.

Code Repositories

peabrane/pleiades
Official
pytorch
Mentioned in GitHub

Benchmarks

BenchmarkMethodologyMetrics
gesture-recognition-on-dvs128-gestureTENNs-PLEIADES
Accuracy (%): 100.00

Build AI with AI

From idea to launch — accelerate your AI development with free AI co-coding, out-of-the-box environment and best price of GPUs.

AI Co-coding
Ready-to-use GPUs
Best Pricing
Get Started

Hyper Newsletters

Subscribe to our latest updates
We will deliver the latest updates of the week to your inbox at nine o'clock every Monday morning
Powered by MailChimp
TENNs-PLEIADES: Building Temporal Kernels with Orthogonal Polynomials | Papers | HyperAI