一种基于差分隐私的张量填充算法
A Tensor Completion Algorithm Based on Differential Privacy
摘要: 针对高维张量数据填充过程中存在的隐私泄露问题,本文提出一种融合拉普拉斯机制的差分隐私张量填充算法(DP-ADMM-t-SVD)。该算法以ADMM-t-SVD低秩张量填充算法为基础,引入了ε-差分隐私框架,先对观测张量进行逐切片归一化以统一全局敏感度,再对张量在观测位置注入与隐私预算ε相关的拉普拉斯噪声,通过交替方向乘子法迭代求解带隐私约束的张量填充优化问题,实现数据隐私保护与填充精度的双重兼顾。为验证算法可行性,分别在不同尺寸的人工低秩张量数据集和篮球视频现实张量数据集上开展实验,实验结果表明,所提算法在人工和现实数据集上均表现出良好性能:隐私预算ε较小时,算法具备优异的隐私保护效果且恢复精度处于可控范围;ε较大时,恢复精度接近无扰动的基线算法,同时用户可通过调节ε的取值适配不同的隐私保护与恢复精度需求。
Abstract: To address the privacy leakage issue in the completion of high-dimensional tensor data, this paper proposes a differential privacy-preserving tensor completion algorithm integrated with the Laplacian mechanism, denoted as DP-ADMM-t-SVD. Based on the ADMM-t-SVD low-rank tensor completion algorithm, the proposed algorithm introduces the ε-differential privacy framework. It first performs per-slice normalization on the observed tensor to unify the global sensitivity, and then injects Laplacian noise associated with the privacy budget ε only at the observed positions of the tensor. Furthermore, it iteratively solves the privacy-constrained tensor completion optimization problem via the Alternating Direction Method of Multipliers (ADMM), thus realizing a balanced trade-off between data privacy protection and completion accuracy. To verify the feasibility of the proposed algorithm, experiments are carried out on synthetic low-rank tensor datasets with different dimensions and a real-world tensor dataset from a basketball video. Experimental results show that the proposed algorithm achieves favorable performance on both synthetic and real-world datasets: when the privacy budget ε is small, the algorithm provides an excellent privacy protection effect while keeping the completion accuracy within a controllable range; when ε is large, the completion accuracy is close to that of the non-perturbed baseline algorithm. Meanwhile, users can adjust the value of ε to adapt to different requirements for privacy protection and completion accuracy.
文章引用:戴森立. 一种基于差分隐私的张量填充算法[J]. 应用数学进展, 2026, 15(5): 25-34. https://doi.org/10.12677/aam.2026.155205

参考文献

[1] Kolda, T.G. and Bader, B.W. (2009) Tensor Decompositions and Applications. SIAM Review, 51, 455-500. [Google Scholar] [CrossRef
[2] Yang, J., Fu, C., Liu, X. and Walid, A. (2022) Recommendations in Smart Devices Using Federated Tensor Learning. IEEE Internet of Things Journal, 9, 8425-8437. [Google Scholar] [CrossRef
[3] Zhang, J. and Jiang, J. (2016) Decomposition-Based Tensor Learning Regression for Improved Classification of Multimedia. Journal of Visual Communication and Image Representation, 41, 260-271. [Google Scholar] [CrossRef
[4] Zhu, M., Liu, X., Tang, F., Qiu, M., Shen, R., Shu, W., et al. (2016) Public Vehicles for Future Urban Transportation. IEEE Transactions on Intelligent Transportation Systems, 17, 3344-3353. [Google Scholar] [CrossRef
[5] Liu, J., Musialski, P., Wonka, P. and Ye, J. (2013) Tensor Completion for Estimating Missing Values in Visual Data. IEEE Transactions on Pattern Analysis and Machine Intelligence, 35, 208-220. [Google Scholar] [CrossRef] [PubMed]
[6] Wei, Z., Li, Z., Mao, X. and Wang, J. (2022) Applying Differential Privacy to Tensor Completion. ICASSP 2022-2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Singapore, 23-27 May 2022, 3923-3927. [Google Scholar] [CrossRef
[7] Carroll, J.D. and Chang, J. (1970) Analysis of Individual Differences in Multidimensional Scaling via an N-Way Generalization of “Eckart-Young” Decomposition. Psychometrika, 35, 283-319. [Google Scholar] [CrossRef
[8] Harshman, R.A. (1970) Foundations of the PARAFAC Procedure: Models and Conditions for an “Explanatory” Multi-Modal Factor Analysis. UCLA Working Papers in Phonetics, 16, 1-84.
[9] Hitchcock, F.L. (1927) The Expression of a Tensor or a Polyadic as a Sum of Products. Journal of Mathematics and Physics, 6, 164-189. [Google Scholar] [CrossRef
[10] De Lathauwer, L., De Moor, B. and Vandewalle, J. (2000) A Multilinear Singular Value Decomposition. SIAM Journal on Matrix Analysis and Applications, 21, 1253-1278. [Google Scholar] [CrossRef
[11] Kroonenberg, P.M. and de Leeuw, J. (1980) Principal Component Analysis of Three-Mode Data by Means of Alternating Least Squares Algorithms. Psychometrika, 45, 69-97. [Google Scholar] [CrossRef
[12] Tucker, L.R. (1966) Some Mathematical Notes on Three-Mode Factor Analysis. Psychometrika, 31, 279-311. [Google Scholar] [CrossRef] [PubMed]
[13] Zhang, Z., Ely, G., Aeron, S., Hao, N. and Kilmer, M. (2014) Novel Methods for Multilinear Data Completion and De-Noising Based on Tensor-SVD. 2014 IEEE Conference on Computer Vision and Pattern Recognition, Columbus, 23-28 June 2014, 3842-3849. [Google Scholar] [CrossRef
[14] Friedland, S. and Lim, L.H. (2018) Nuclear Norm of Higher-Order Tensors. Mathematics of Computation, 87, 1255-1281. [Google Scholar] [CrossRef
[15] Dwork, C., McSherry, F., Nissim, K. and Smith, A. (2006) Calibrating Noise to Sensitivity in Private Data Analysis. In: Halevi, S. and Rabin, T., Eds., Lecture Notes in Computer Science, Springer, 265-284. [Google Scholar] [CrossRef
[16] Dwork, C. and Roth, A. (2014) The Algorithmic Foundations of Differential Privacy. Foundations and Trends® in Theoretical Computer Science, 9, 211-487. [Google Scholar] [CrossRef
[17] Yang, Y., Mehrkanoon, S. and Suykens, J.A.K. (2015) Higher Order Matching Pursuit for Low Rank Tensor Learning. arXiv:1503.02216.
[18] Zheng, Y. and Xu, A. (2021) Tensor Completion via Tensor QR Decomposition and L2,1-Norm Minimization. Signal Processing, 189, Article 108240. [Google Scholar] [CrossRef