50 citations · 53 across the 9 of their papers we have counts for
10 papers
Exploiting Trust for Resilient Hypothesis Testing with Malicious Robots
Matthew Cavorsi, Orhan Eren Akgün, Michal Yemini +2
We develop a resilient binary hypothesis testing framework for decision making in adversarial multi-robot crowdsensing tasks. This framework exploits stochastic trust observations…
Multi-Armed Bandits with Self-Information Rewards
Nir Weinberger, Michal Yemini
This paper introduces the informational multi-armed bandit (IMAB) model in which at each round, a player chooses an arm, observes a symbol, and receives an unobserved reward in the…
Semi-Decentralized Federated Learning with Collaborative Relaying
Michal Yemini, Rajarshi Saha, Emre Ozfatura +2
We present a semi-decentralized federated learning algorithm wherein clients collaborate by relaying their neighbors' local updates to a central parameter server (PS). At every com…
Exploiting Local and Cloud Sensor Fusion in Intermittently Connected Sensor Networks
Michal Yemini, Stephanie Gil, Andrea Goldsmith
We consider a detection problem where sensors experience noisy measurements and intermittent communication opportunities to a centralized fusion center (or cloud). The objective of…
Virtual Cell Clustering with Optimal Resource Allocation to Maximize Capacity
Michal Yemini, Andrea J. Goldsmith
This work proposes a new resource allocation optimization and network management framework for wireless networks using neighborhood-based optimization rather than fully centralized…
The Restless Hidden Markov Bandit with Linear Rewards and Side Information
Michal Yemini, Amir Leshem, Anelia Somekh-Baruch
In this paper we present a model for the hidden Markovian bandit problem with linear rewards. As opposed to current work on Markovian bandits, we do not assume that the state is kn…