Demo Data from EDBT 2026 / reviewers in the wild / expert
Wenqian Du 0005
dblp:410/2481
· 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 |
Efficient and distributed learning · 50% Deep learning architectures and training · 50% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning › distributed training › parallelization
parallel training |
0.9 | 1 | 2025 | Efficient Parallel Training Methods for Spiking Neural Networks with Constant Time Complexity · ICML 2025 |
Machine learning › Deep learning architectures and training
spiking neural network |
0.9 | 1 | 2025 | Efficient Parallel Training Methods for Spiking Neural Networks with Constant Time Complexity · ICML 2025 |
Methods — techniques the papers use, named apart from their topics
leaky integrate-and-fire neurons · 0.9fixed-point iteration · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Efficient Parallel Training Methods for Spiking Neural Networks with Constant Time ComplexityabstractSpiking Neural Networks (SNNs) often suffer from high time complexity $O(T)$ due to the sequential processing of $T$ spikes, making training computationally expensive.
In this paper, we propose a novel Fixed-point Parallel Training (FPT) method to accelerate SNN training without modifying the network architecture or introducing additional assumptions.
FPT reduces the time complexity to $O(K)$, where $K$ is a small constant (usually $K=3$), by using a fixed-point iteration form of Leaky Integrate-and-Fire (LIF) neurons for all $T$ timesteps.
We provide a theoretical convergence analysis of FPT and demonstrate that existing parallel spiking neurons can be viewed as special cases of our approach.
Experimental results show that FPT effectively simulates the dynamics of original LIF neurons, significantly reducing computational time without sacrificing accuracy.
This makes FPT a scalable and efficient solution for real-world applications, particularly for long-duration simulations. Wanjin Feng, Xingyu Gao 0001, Wenqian Du 0005, Hailong Shi, Peilin Zhao, Chunyan Miao |
ICML | 3 |