SiMCa: Sinkhorn Matrix Factorization with Capacity Constraints
Eric Daoud, Luca Ganassali, Antoine Baker, Marc Lelarge

TL;DR
This paper introduces SiMCa, a matrix factorization method incorporating optimal transport to learn item embeddings considering geographical and capacity constraints, with applications in hospital recommendation.
Contribution
The paper proposes a novel algorithm combining matrix factorization and optimal transport to handle complex recommendation scenarios with spatial and capacity constraints.
Findings
Effective in modeling user-item affinities with geographical constraints
Able to recover item embeddings from observed allocations
Demonstrated on synthetic hospital data
Abstract
For a very broad range of problems, recommendation algorithms have been increasingly used over the past decade. In most of these algorithms, the predictions are built upon user-item affinity scores which are obtained from high-dimensional embeddings of items and users. In more complex scenarios, with geometrical or capacity constraints, prediction based on embeddings may not be sufficient and some additional features should be considered in the design of the algorithm. In this work, we study the recommendation problem in the setting where affinities between users and items are based both on their embeddings in a latent space and on their geographical distance in their underlying euclidean space (e.g., ), together with item capacity constraints. This framework is motivated by some real-world applications, for instance in healthcare: the task is to recommend hospitals to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRecommender Systems and Techniques · Human Mobility and Location-Based Analysis · Advanced Graph Neural Networks
