Demo Data from VLDB 2026 / reviewers in the wild / expert
Olivier Coenen
dblp:375/1614
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Deep learning architectures and training · 91% 3D vision · 9% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Deep learning architectures and training
event-based neural networks |
0.9 | 1 | 2025 | PLEIADES: Building Temporal Kernels with Orthogonal Polynomials · NeurIPS 2025 |
Machine learning › Deep learning architectures and training
spiking neural network |
0.9 | 1 | 2025 | PLEIADES: Building Temporal Kernels with Orthogonal Polynomials · NeurIPS 2025 |
Machine learning › Deep learning architectures and training › convolutional neural network › convolutional neural network architecture
temporal convolutional network |
0.9 | 1 | 2025 | PLEIADES: Building Temporal Kernels with Orthogonal Polynomials · NeurIPS 2025 |
Computer vision › 3D vision
event-based vision |
0.3 | 1 | 2025 | PLEIADES: Building Temporal Kernels with Orthogonal Polynomials · NeurIPS 2025 |
Methods — techniques the papers use, named apart from their topics
temporal convolution · 0.9orthogonal polynomial basis functions · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | PLEIADES: Building Temporal Kernels with Orthogonal PolynomialsabstractWe introduce a class of neural networks named PLEIADES (PoLynomial Expansion In Adaptive Distributed Event-based Systems), which contains temporal convolution kernels generated from orthogonal polynomial basis functions. We focus on interfacing these networks with event-based data to perform online spatiotemporal classification and detection with low latency. By virtue of using structured temporal kernels and event-based data, we have the freedom to vary the sample rate of the data along with the discretization step-size of the network without additional finetuning. We experimented with three event-based benchmarks and obtained state-of-the-art results on all three by large margins with significantly smaller memory and compute costs. We achieved: 1) 99.59% accuracy with 192K parameters on the DVS128 hand gesture recognition dataset and 100\% with a small additional output filter; 2) 99.58% test accuracy with 277K parameters on the AIS 2024 eye tracking challenge; and 3) 0.556 mAP with 576k parameters on the PROPHESEE 1 Megapixel Automotive Detection Dataset. Yan Ru Pei, Olivier Coenen |
NeurIPS | 2 |