Fast Differentially Private Matrix Factorization
Open accessThe DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
Differentially private collaborative filtering is a challenging task, both in terms of accuracy and speed. We present a simple algorithm that is provably differentially private, while offering good performance, using a novel connection of differential privacy to Bayesian posterior sampling via Stochastic Gradient Langevin Dynamics. Due to its simplicity the algorithm lends itself to efficient implementation. By careful systems design and by exploiting the power law behavior of the data to maximize CPU cache bandwidth we are able to generate 1024 dimensional models at a rate of 8.5 million recommendations per second on a single PC.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Calibrating Noise to Sensitivity in Private Data Analysis
Dwork, C., McSherry, F., Nissim, K., & Smith, A. (2006) · Lecture Notes in Computer Science · doi:10.1007/11681878_14 · Cited by 7,272
The Algorithmic Foundations of Differential Privacy
Dwork, C., & Roth, A. (2014) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000042 · Cited by 5,557
The Algorithmic Foundations of Differential Privacy
Dwork, C., & Roth, A. (2013) · doi:10.1561/9781601988195 · Cited by 3,856
MCMC Using Hamiltonian Dynamics
Neal, R. M. (2011) · Handbook of Markov Chain Monte Carlo · doi:10.1201/b10905-6 · Cited by 2,574
Robust De-anonymization of Large Sparse Datasets
Narayanan, A., & Shmatikov, V. (2008) · 2008 IEEE Symposium on Security and Privacy (sp 2008) · doi:10.1109/sp.2008.33 · Cited by 2,372 · cited 2×
“Moreover, when we want to set the privacy loss to another number, we can easily do this by simply rescaling the entire expression by /4B.”
BackgroundRestricted Boltzmann machines for collaborative filtering
Salakhutdinov, R., Mnih, A., & Hinton, G. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273596 · Cited by 1,885
Hogwild: A Lock-Free Approach to Parallelizing Stochastic Gradient Descent
Niu, F., Recht, B., Re, C., & Wright, S. J. (2011) · arXiv · doi:10.48550/arxiv.1106.5730 · Cited by 1,211 · cited 2×
“Movie parameters are updated in a Hogwild fashion [27].”
Background
Cited by
Certified Data Removal from Machine Learning Models
Guo, C., Goldstein, T., Hannun, A., & van der Maaten, L. (2019) · arXiv · doi:10.48550/arxiv.1911.03030 · Cited by 160
“Many classical machine learning algorithms have been shown to support differentially private versions, including PCA (Chaudhuri et al., 2012), matrix factorization (Liu et al., 2015), linear models (Chaudhuri et al., 2011), and neural networks (Abadi et al., 2016).”
Zhang, M., Chen, Y., & Lin, J. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3051060 · Cited by 120
Comprehensive Privacy Analysis on Federated Recommender System Against Attribute Inference Attacks
Zhang, S., Yuan, W., & Yin, H. (2024) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2023.3295601 · Cited by 97
Privacy-Preserving Tensor Factorization for Collaborative Health Data Analysis
Ma, J., Zhang, Q., Lou, J., Ho, J. C., Xiong, L., & Jiang, X. (2019) · Proceedings of the 28th ACM International Conference on Information and Knowledge Management · doi:10.1145/3357384.3357878 · Cited by 51
Differentially private user-based collaborative filtering recommendation based on k-means clustering
Chen, Z., Wang, Y., Zhang, S., Zhong, H., & Chen, L. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.114366 · Cited by 42
Self-citation
Metadata
- Authors
- Liu, Z., Wang, Y.-X., & Smola, A.
- Venue
- Proceedings of the 9th ACM Conference on Recommender Systems
- Publisher
- ACM
- Published
- 2015-09-16
- Pages
- 171-178
- OpenAlex
- W2009952684
- Cited by
- 96
- References
- 7
- FWCI
- 3.79
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Fast Differentially Private Matrix Factorization. https://app.cochat.ai/papers/10.1145/2792838.2800191
- The paper
- Liu, Z., Wang, Y.-X., & Smola, A. (2015). Fast Differentially Private Matrix Factorization. Proceedings of the 9th ACM Conference on Recommender Systems. https://doi.org/10.1145/2792838.2800191
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.