Institution profile

Synopsys Inc.

Industry researchnorthamerica · us
Official website
Research library22linked papers
Opportunities0open roles
Selected work

Representative Papers

Attacking the Spike: On the Transferability and Security of Spiking Neural Networks to Adversarial Examples

Sep 07, 2022

This work systematically investigates the underexplored problem of adversarial robustness in Spiking Neural Networks (SNNs). We find that white-box attacks against SNNs heavily rely on surrogate gradient techniques and exhibit severely limited transferability of adversarial examples across architectures (e.g., between SNNs and ViTs/CNNs). To address this, we first uncover a strong coupling mechanism between SNNs’ adversarial vulnerability and surrogate gradient estimation. Building on this insight, we propose Auto-SAGA—a cross-architecture universal white-box attack method that jointly optimizes adaptive self-attention gradient estimation and surrogate gradient approximation. Evaluated on CIFAR-10, CIFAR-100, and ImageNet, Auto-SAGA achieves a 91.1% improvement in attack success rate on SNN-ViT ensembles and attains three times the effectiveness of Auto-PGD on adversarially trained SNN ensembles, significantly outperforming existing baselines.

13 citationsRead paper

DiffPower: GPU-Accelerated Differentiable Switching Power Analysis and Optimization

Aug 04, 2026

This work addresses the longstanding trade-off between speed and accuracy in switching power analysis for physical design by introducing a differentiable power analysis framework based on a process-agnostic bytecode representation. By integrating reverse-mode automatic differentiation, GPU acceleration, and hybrid propagation—combining analytical modeling with parallel simulation—the proposed method enables, for the first time, gradient-based optimization for power consumption. This framework supports novel applications such as cell sizing optimization and power virus generation. Experimental results demonstrate up to a 1002× speedup in power analysis (with a switching activity correlation coefficient of 0.96) and a 904× acceleration in gradient computation compared to single-threaded CPU execution. Furthermore, cell sizing optimization reduces power by up to 2.98×, and power virus generation achieves a 2.13× improvement in efficiency.

0 citationsRead paper

SPHERICAL KV: Angle-Domain Attention and Rate-Distortion Retention for Efficient Long-Context Inference

May 13, 2026

This work addresses the memory bottleneck in long-context inference caused by the linear growth of KV cache, which severely limits decoding efficiency. To overcome this challenge, the authors propose a joint optimization framework combining Angular-Domain Attention (ADA) and Rate-Distortion Retention (RDR). By parameterizing key vectors on a hypersphere, ADA computes attention scores directly in the angular domain, eliminating the need for dense reconstruction. RDR dynamically allocates precision and storage resources based on estimated future utility, enabling block-fusion-friendly computation. Under a fixed memory budget, the proposed method substantially reduces KV cache footprint and HBM traffic while preserving high decoding quality, achieving superior long-context inference performance in real-world deployment scenarios.

0 citationsRead paper
Recent publications

Latest Papers

DiffPower: GPU-Accelerated Differentiable Switching Power Analysis and Optimization

Aug 04, 2026

This work addresses the longstanding trade-off between speed and accuracy in switching power analysis for physical design by introducing a differentiable power analysis framework based on a process-agnostic bytecode representation. By integrating reverse-mode automatic differentiation, GPU acceleration, and hybrid propagation—combining analytical modeling with parallel simulation—the proposed method enables, for the first time, gradient-based optimization for power consumption. This framework supports novel applications such as cell sizing optimization and power virus generation. Experimental results demonstrate up to a 1002× speedup in power analysis (with a switching activity correlation coefficient of 0.96) and a 904× acceleration in gradient computation compared to single-threaded CPU execution. Furthermore, cell sizing optimization reduces power by up to 2.98×, and power virus generation achieves a 2.13× improvement in efficiency.

0 citationsRead paper

SPHERICAL KV: Angle-Domain Attention and Rate-Distortion Retention for Efficient Long-Context Inference

May 13, 2026

This work addresses the memory bottleneck in long-context inference caused by the linear growth of KV cache, which severely limits decoding efficiency. To overcome this challenge, the authors propose a joint optimization framework combining Angular-Domain Attention (ADA) and Rate-Distortion Retention (RDR). By parameterizing key vectors on a hypersphere, ADA computes attention scores directly in the angular domain, eliminating the need for dense reconstruction. RDR dynamically allocates precision and storage resources based on estimated future utility, enabling block-fusion-friendly computation. Under a fixed memory budget, the proposed method substantially reduces KV cache footprint and HBM traffic while preserving high decoding quality, achieving superior long-context inference performance in real-world deployment scenarios.

0 citationsRead paper

NSPOD: acceleratingthe convergence ofKrylov-based iterative linearsolvers via approximated PODs

May 08, 2026

This work addresses the high sensitivity of Krylov iterative solvers to geometry, boundary conditions, and material parameters when solving parametric partial differential equations, as well as the limited generalization and acceleration capabilities of existing neural operator-based preconditioners. The authors propose NSPOD, a multigrid-like deep operator network preconditioner that, for the first time, integrates neural operators with Proper Orthogonal Decomposition (POD) subspaces. By approximating solutions within a low-dimensional POD subspace, NSPOD effectively accelerates Krylov solvers without requiring retraining, even on unstructured meshes derived from complex CAD geometries. Demonstrated on linear PDEs in solid mechanics, the method significantly reduces iteration counts and outperforms state-of-the-art preconditioners such as algebraic multigrid, thereby overcoming key performance bottlenecks in current approaches.

0 citationsRead paper