BASC : Behavior-Aligned Quantization and Pruning for Low-Bit Spiking Neural Networks
- URL: http://arxiv.org/abs/2608.19239v1
- Date: Wed, 12 Aug 2026 03:39:24 GMT
- Title: BASC : Behavior-Aligned Quantization and Pruning for Low-Bit Spiking Neural Networks
- Abstract summary: Spiking Neural Networks (SNNs) encode information through binary spikes and compute in an event-driven manner.<n>High-performance SNNs incur substantial memory and timestep-wise costs that hinder deployment on resource-constrained devices.<n>We propose Behavior-Aligned SNN Compression (BASC), a unified framework with two lightweight modules.
- Score: 6.5713207503171285
- License: http://creativecommons.org/licenses/by-sa/4.0/
- Abstract: Spiking Neural Networks (SNNs) encode information through binary spikes and compute in an event-driven manner, offering an energy-efficient paradigm for machine intelligence. However, high-performance SNNs incur substantial memory and timestep-wise computation costs that hinder deployment on resource-constrained devices. Quantization and pruning provide complementary routes to reducing these costs, yet both make their decisions with local criteria that overlook temporal task feedback in quantization and inter-channel dependencies in pruning. Consequently, optimizing either criterion can still yield suboptimal compression performance. We refer to this discrepancy as criterion-behavior mismatch and propose Behavior-Aligned SNN Compression (BASC), a unified framework with two lightweight modules. For quantization, the scale is applied to synaptic current at every timestep and therefore shifts spike timing. Temporal-Behavior Scale Correction (TSC) makes the scale learnable under a temporal loss, allowing firing behavior to inform scale optimization. For pruning, channel importance depends on how channels jointly drive the membrane potential across the firing threshold. Boundary-Level Inter-Channel Correction (BIC) uses channelwise importance scores for initial selection and inter-channel information to re-evaluate only channels near the pruning threshold. Extensive experiments on static and neuromorphic benchmarks show that lower-bit BASC models match or outperform higher-bit baselines and retain this accuracy advantage after structured pruning, while further reducing model storage and synaptic operations.
Related papers
- PTQ4SNN: Membrane-Aware Post-Training Quantization for Spiking Neural Networks [51.21235018272886]
Spiking neural networks (SNNs) enable sparse and event-driven computation, but their low-bit deployment remains incomplete.<n>We propose PTQ4SNN, a membrane-aware post-training quantization framework that jointly quantizes weights and recurrent membrane states using only a small calibration set.<n>Experiments on static and event-based classification and semantic segmentation show that PTQ4SNN effectively preserves model accuracy under W4 quantization and approximately 4-bit membrane precision.
arXiv Detail & Related papers (2026-08-07T10:16:25Z) - Message Passing Based Two-Timescale Bayesian Learning for Joint Channel and Memory Hardware Impairments Tracking [15.722477105805256]
Hardware impairments in massive multiple-input multiple-output (MIMO) receivers introduce inter-symbol memory and inter-element coupling.<n>This paper proposes a message-passing-based two-timescale Bayesian deep learning (MP-TTBDL) framework for joint channel and impairment tracking.<n> Simulation results show that the proposed framework robustly achieves lower channel estimation error than conventional compensators.
arXiv Detail & Related papers (2026-07-02T03:39:56Z) - SCOPE: A Syndrome-Driven Control Plane for QEC-Enabled Quantum Networks [7.746657732894142]
We present SCOPE, a network-layer architecture that enables joint routing and coding optimization using purely passive telemetry.<n>SCOPE reduces estimation error by more than 60% relative to a standard EM baseline.<n>In large-scale networks, this precision reduces logical error rates by 30-35% (up to 65%) against topology-aware baselines.
arXiv Detail & Related papers (2026-06-07T23:00:09Z) - OScaR: The Occam's Razor for Extreme KV Cache Quantization in LLMs and Beyond [50.440302567029654]
Multi-modal intelligence has made the Key-Value cache a dominant memory bottleneck for efficient deployment.<n>In this work, we revisit the inherent limitations of the per-channel quantization paradigm.<n>We propose OScaR, an accurate and lightweight KV cache compression framework for X-LLMs.
arXiv Detail & Related papers (2026-05-19T10:53:03Z) - QB-LIF: Learnable-Scale Quantized Burst Neurons for Efficient SNNs [18.0608697536269]
Quantized Burst-LIF neuron reformulates burst spiking as a saturated uniform quantization of membrane potentials with a learnable scale.<n> QB-LIF consistently outperforms binary and fixed-burst SNNs, achieving higher accuracy under ultra-low latency.
arXiv Detail & Related papers (2026-04-28T14:18:53Z) - ISCS: Parameter-Guided Channel Ordering and Grouping for Learned Image Compression [11.645256028223272]
We propose a dataset-agnostic method to identify and organize important channels in pretrained LIC models.<n>Our method effectively reduces computation while maintaining reconstruction quality, providing a practical and modular enhancement to existing learned compression frameworks.
arXiv Detail & Related papers (2025-09-21T00:44:15Z) - DA-Flow: Dual Attention Normalizing Flow for Skeleton-based Video Anomaly Detection [52.74152717667157]
We propose a lightweight module called Dual Attention Module (DAM) for capturing cross-dimension interaction relationships in-temporal skeletal data.
It employs the frame attention mechanism to identify the most significant frames and the skeleton attention mechanism to capture broader relationships across fixed partitions with minimal parameters and flops.
arXiv Detail & Related papers (2024-06-05T06:18:03Z) - Ultra-low Latency Spiking Neural Networks with Spatio-Temporal
Compression and Synaptic Convolutional Block [4.081968050250324]
Spiking neural networks (SNNs) have neuro-temporal information capability, low processing feature, and high biological plausibility.
Neuro-MNIST, CIFAR10-S, DVS128 gesture datasets need to aggregate individual events into frames with a higher temporal resolution for event stream classification.
We propose a processing-temporal compression method to aggregate individual events into a few time steps of NIST current to reduce the training and inference latency.
arXiv Detail & Related papers (2022-03-18T15:14:13Z) - CATRO: Channel Pruning via Class-Aware Trace Ratio Optimization [61.71504948770445]
We propose a novel channel pruning method via Class-Aware Trace Ratio Optimization (CATRO) to reduce the computational burden and accelerate the model inference.
We show that CATRO achieves higher accuracy with similar cost or lower cost with similar accuracy than other state-of-the-art channel pruning algorithms.
Because of its class-aware property, CATRO is suitable to prune efficient networks adaptively for various classification subtasks, enhancing handy deployment and usage of deep networks in real-world applications.
arXiv Detail & Related papers (2021-10-21T06:26:31Z) - GDP: Stabilized Neural Network Pruning via Gates with Differentiable
Polarization [84.57695474130273]
Gate-based or importance-based pruning methods aim to remove channels whose importance is smallest.
GDP can be plugged before convolutional layers without bells and whistles, to control the on-and-off of each channel.
Experiments conducted over CIFAR-10 and ImageNet datasets show that the proposed GDP achieves the state-of-the-art performance.
arXiv Detail & Related papers (2021-09-06T03:17:10Z) - DAIS: Automatic Channel Pruning via Differentiable Annealing Indicator
Search [55.164053971213576]
convolutional neural network has achieved great success in fulfilling computer vision tasks despite large computation overhead.
Structured (channel) pruning is usually applied to reduce the model redundancy while preserving the network structure.
Existing structured pruning methods require hand-crafted rules which may lead to tremendous pruning space.
arXiv Detail & Related papers (2020-11-04T07:43:01Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.