Pith. sign in

REVIEW 1 cited by

Privacy Threats Against Federated Matrix Factorization

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2007.01587 v1 pith:CKPFWHQI submitted 2020-07-03 cs.CR cs.LGstat.ML

classification cs.CRcs.LGstat.ML
keywords federatedfactorizationmatrixprivacydatalearningthreatsbuild
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Matrix Factorization has been very successful in practical recommendation applications and e-commerce. Due to data shortage and stringent regulations, it can be hard to collect sufficient data to build performant recommender systems for a single company. Federated learning provides the possibility to bridge the data silos and build machine learning models without compromising privacy and security. Participants sharing common users or items collaboratively build a model over data from all the participants. There have been some works exploring the application of federated learning to recommender systems and the privacy issues in collaborative filtering systems. However, the privacy threats in federated matrix factorization are not studied. In this paper, we categorize federated matrix factorization into three types based on the partition of feature space and analyze privacy threats against each type of federated matrix factorization model. We also discuss privacy-preserving approaches. As far as we are aware, this is the first study of privacy threats of the matrix factorization method in the federated learning framework.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Federated Majorize-Minimization: Beyond Parameter Aggregation

    cs.LG 2025-07 conditional novelty 6.0 of 10

    By averaging surrogate-function parameters across clients and then minimizing the aggregated surrogate on the server, federated learning can converge under heterogeneity where parameter averaging diverges.

Pith tools