Nikos Parotsidis

Online Reciprocal Recommendation with Theoretical Performance Guarantees

2018 · arXiv (Cornell University)

A reciprocal recommendation problem is one where the goal of learning is not just to predict a user's preference towards a passive item (e.g., a book), but to recommend the targeted user on one side …

Multi-Swap $k$-Means++

2023 · arXiv (Cornell University)

The $k$-means++ algorithm of Arthur and Vassilvitskii (SODA 2007) is often the practitioners' choice algorithm for optimizing the popular $k$-means clustering objective and is known to give an $O(\log k)$-approximation in expectation. To obtain higher …