Sign inGet started
Paper · arXiv

DegreeSpar: Structured Degree Sparsity for Efficient Secure Transformer Inference

Secure Transformer inference protects sensitive inputs but incurs substantial cryptographic overhead, with nonlinear operations such as Softmax and GeLU becoming major bottlenecks. Existing compression methods reduce nonlinear complexity, sequence-dependent computation, or model structure through separately defined compression variables. Under aggressive compression, however, these independently optimized perturbations can accumulate: at a matched compression level, stacking representative approximation, token-pruning, and model-pruning methods reduces ViT-S accuracy from 80.20% to 76.41%. We introduce DegreeSpar, which formulates secure Transformer compression as structured sparsificatio...

AuthorsYifei Cai, Zhuoran Li, Xiaozuo Shen et al.
Primary categorycs.CR
Published26 September 2026
Last updated at source26 September 2026
cs.CRcs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/e758cccc-da8a-432e-902a-5ed089e0c80d" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.