Parameter-efficient fine-tuning adapts pre-trained language models to downstream tasks with reduced training cost, but widely used methods such as Low-Rank Adaptation (LoRA) still rely on conventional multiply-accumulate computation in the adapter path. This paper proposes Hybrid Spiking LoRA, an asymmetric spiking adapter that replaces the LoRA down-projection with a one-bit spiking encoder while retaining a full-precision up-projection. The design introduces sparse event-driven computation into the low-rank adapter while preserving continuous reconstruction capacity for language model adaptation. We evaluate the method on Korean natural language understanding tasks covering topic classification, relation extraction, natural language inference, and extractive question answering. Across timestep, rank, membrane time constant, and bit-width ablations, the encoder-only spiking design consistently outperforms fully spiking alternatives and remains competitive with standard LoRA. Hybrid Spiking LoRA retains 95.9% of standard LoRA performance on KLUE topic classification at rank 16 and 96.8% in a matched five-seed KorQuAD 2.1 comparison, where Hybrid- $T{=}4$ achieves $79.92~\pm ~0.30$ F1. On relation extraction, it underperforms standard LoRA on average but clearly exceeds fully spiking variants, and single-seed bit-width gains over FP32 are interpreted as seed-dependent preliminary observations rather than a general performance claim. Operation-level analysis indicates substantial theoretical adapter-path energy-saving potential from sparse accumulate operations, although current graphics processing unit simulation introduces latency overhead. These results position asymmetric spiking adapters as a feasible neuromorphic-compatible direction for language model adaptation, while motivating future hardware-level validation.
Jae-Hwan Kim, Dae-Yeol Kim, Chae-Bong Sohn· IEEE Access· 0 citations
The parity problem--deciding whether the number of ones in a binary vector is odd or even--remains challenging for standard neural networks due to linear inseparability and the need for global interactions. We propose TESLA, an activation defined as a learnable combination of sine and cosine terms, enabling explicit control over polynomial degree and selective amplification of high-order components. Theoretically, we show that constraining TESLA's coefficients yields Lipschitz/Rademacher complexity bounds and shapes the training dynamics to emphasize higher-frequency structure. Empirically, on parity with input length n = 32, TESLA attains strong generalization with 100K training samples (approximately 0.002% of the 2^32 input space) and remains robust under heavy corruption, retaining high accuracy with up to 30% label noise. We also compare against periodic and frequency-based baselines (SIREN, SNAKE, and Fourier feature embeddings) on parity and Forrelation. Beyond synthetic structure, TESLA delivers comparable performance on ImageNet-100, indicating that activation-level degree control transfers to more general vision workloads. Code: https://github.com/KAU-QuantumAILab/TESLA
Daehwa Ko, Jae-Hwan Kim, Seunghyun Ham et al.· 0 citations