为增强隐私保护,提出高效加密推理方案,让KAN模型在安全环境下仍保持高精度与速度。
Efficient Privacy-Preserving KAN Inference Using Homomorphic Encryption
- 针对SiLU和B样条函数设计专用多项式近似与加密计算方法
- 在CIFAR-10上推理延迟比原始方法快7倍以上,精度接近明文模型
- 适合需保护数据隐私的边缘设备或云服务场景使用
最近提出的柯尔莫哥洛夫-阿诺德网络(KANs)具备更强的可解释性和模型表达能力。然而,其推理过程存在隐私泄露风险。同态加密(HE)可实现深度学习模型的隐私保护推理,使资源受限用户也能安全使用深度学习服务。但KAN复杂的结构,包括SiLU激活函数和B样条函数等非线性组件,使得现有隐私保护推理技术难以适用。为此,本文提出一种专用于KAN的精确且高效的隐私保护推理方案。该方案引入任务相关的SiLU函数多项式近似,并动态调整近似区间以保证真实数据集上的高精度;同时,设计了在同态加密域内高效计算B样条函数的方法,融合重复打包、延迟合并及比较函数等技术。我们在符号公式评估与图像分类任务上验证了该方案的有效性。实验结果表明,所提模型在多个数据集上精度接近明文KAN,优于明文MLP;在CIFAR-10上,推理延迟较朴素方法提升超7倍。
原文摘要 · Abstract (English)
The recently proposed Kolmogorov-Arnold Networks (KANs) offer enhanced interpretability and greater model expressiveness. However, KANs also present challenges related to privacy leakage during inference. Homomorphic encryption (HE) facilitates privacy-preserving inference for deep learning models, enabling resource-limited users to benefit from deep learning services while ensuring data security. Yet, the complex structure of KANs, incorporating nonlinear elements like the SiLU activation function and B-spline functions, renders existing privacy-preserving inference techniques inadequate. To address this issue, we propose an accurate and efficient privacy-preserving inference scheme tailored for KANs. Our approach introduces a task-specific polynomial approximation for the SiLU activation function, dynamically adjusting the approximation range to ensure high accuracy on real-world datasets. Additionally, we develop an efficient method for computing B-spline functions within the HE domain, leveraging techniques such as repeat packing, lazy combination, and comparison functions. We evaluate the effectiveness of our privacy-preserving KAN inference scheme on both symbolic formula evaluation and image classification. The experimental results show that our model achieves accuracy comparable to plaintext KANs across various datasets and outperforms plaintext MLPs. Additionally, on the CIFAR-10 dataset, our inference latency achieves over 7 times speedup compared to the naive method.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。