Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Xiangfei Yang

dblp:171/2403 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2026
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Emerging computing paradigms · 100%
Artificial intelligence
1 paper
3D vision · 50% Video understanding and tracking · 50%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Emerging computing paradigms
neuromorphic computing
1.012026
Activation-wise Propagation: A One-Timestep Strategy for Spiking Neural Networks · AAAI 2026
Emerging computing paradigms › neuromorphic computing
spiking neural network
1.012026
Activation-wise Propagation: A One-Timestep Strategy for Spiking Neural Networks · AAAI 2026
Computer vision › Video understanding and tracking
event-based perception
0.312026
Activation-wise Propagation: A One-Timestep Strategy for Spiking Neural Networks · AAAI 2026
Computer vision › 3D vision
point cloud processing
0.312026
Activation-wise Propagation: A One-Timestep Strategy for Spiking Neural Networks · AAAI 2026

Methods — techniques the papers use, named apart from their topics

spatial propagation · 2.0activation-wise propagation · 2.0
YearPublicationVenuePosition
2026 Activation-wise Propagation: A One-Timestep Strategy for Spiking Neural Networks
abstract
Spiking neural networks (SNNs) have demonstrated significant potential in real-time multi-sensor perception tasks due to their event-driven and parameter-efficient characteristics. A key challenge is the timestep-wise iterative update of neuronal hidden states (membrane potentials), which complicates the trade-off between accuracy and latency. SNNs tend to achieve better performance with longer timesteps, inevitably resulting in higher computational overhead and latency compared to artificial neural networks (ANNs). Moreover, many recent advances in SNNs rely on architecture-specific optimizations, which, while effective with fewer timesteps, often limit generalizability and scalability across modalities and models. To address these limitations, we propose Activation-wise Membrane Potential Propagation (AMP2), a unified hidden state update mechanism for SNNs. Inspired by the spatial propagation of membrane potentials in biological neurons, AMP2 enables dynamic transmission of membrane potentials among spatially adjacent neurons, facilitating spatiotemporal integration and cooperative dynamics of hidden states, thereby improving efficiency and accuracy while reducing reliance on extended temporal updates. This simple yet effective strategy significantly enhances SNN performance across various architectures, including MLPs and CNNs for point cloud and event-based data. Furthermore, ablation studies integrating AMP2 into Transformer-based SNNs for classification tasks demonstrate its potential as a general-purpose and efficient solution for spiking neural networks.
Xiangfei Yang, Shangke Lyu
AAAI2
2024 Calibrating the Converted Spiking Reinforcement Learning
Jian Song 0026, Xiangfei Yang
ICIC (2)2
2024 Adaptive Spiking TD3+BC for Offline-to-Online Spiking Reinforcement Learning
abstract
Spiking reinforcement learning (SRL) has gradually received attention because of its ultra-low energy consumption, but the current SRL algorithms are almost online algorithms that are sample inefficient. It is well known that pure offline spiking reinforcement (offline RL) learning has limited performance. Therefore, we study SRL in the offline-to-online setting, which simultaneously possesses the advantages of low energy consumption and sample efficiency. To the best of our knowledge, this is the first study for offline-to-online SRL. Like offline-to-online RL, offline-to-online SRL also has the policy collapse issue. To overcome this problem, we adaptively adjust the penalty of behavior cloning term of spiking TD3+BC (SpikTD3+BC) based on the adaptability of policy to environment and propose a stable offline-to-online SRL, named AdaSpikTD3+BC. Experimental results on the D4RL benchmark tasks show that AdaSpikTD3+BC can not only avoid policy collapse but also cost about 10% energy to approach the performance of offline-to-online RL based on DNN.
Xiangfei Yang, Xuetao Zhang 0001
IJCNN1