A mini-batch, parallelized form of the IPFP stable matching algorithm lets reciprocal recommender systems process up to 10^6 users on one GPU while keeping the match count close to the exact algorithm.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IR 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Parallel and Mini-Batch Stable Matching for Large-Scale Reciprocal Recommender Systems
A mini-batch, parallelized form of the IPFP stable matching algorithm lets reciprocal recommender systems process up to 10^6 users on one GPU while keeping the match count close to the exact algorithm.