Salim El Rouayheb

Single-Server Multi-Message Individually-Private Information Retrieval with Side Information

2019

We consider a multi-user variant of the private information retrieval problem described as follows. Suppose there are D users, each of which wants to privately retrieve a distinct message from a server with the help …

Self-Regulating Random Walks for Resilient Decentralized Learning on Graphs

2024 · arXiv (Cornell University)

Consider the setting of multiple random walks (RWs) on a graph executing a certain computational task. For instance, in decentralized learning via RWs, a model is updated at each iteration based on the local data …