Michal Yemini

Michal Yemini

Auto-generated profile, based on publicly available information

Michal Yemini

Faculty of Engineering, Bar-Ilan University, Ramat Gan, Israel

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 June 2021 in IEEE Transactions on Robotics
Verified
Journal Article
Closed access
MYMichal Yemini
Michal Yemini
ANAngelia Nedic
Angelia Nedic
AGAndrea J. Goldsmith
Andrea J. Goldsmith
SGStephanie Gil
Stephanie Gil
This work considers the problem of resilient consensus, where stochastic values of trust between agents are available. Specifically, we derive a unified mathematical framework to characterize convergence, deviation of the consensus from the true consensus value, and expected convergence rate, when there exists additional information of trust between agents. We show that under certain conditions on the stochastic trust values and consensus protocol: First, almost sure convergence to a common limit value is possible even when malicious agents constitute more than half of the network connectivity; second, the deviation of the converged limit, from the case where there is no attack, i.e., the true consensus value, can be bounded with probability that approaches 1 exponentially; and third correct classification of malicious and legitimate agents can be attained in finite time almost surely. Furthermore, the expected convergence rate decays exponentially as a function of the quality of the trust observations between agents.

22 January 2025 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
MYMichal Yemini
Michal Yemini
ANAngelia Nedić
Angelia Nedić
AGAndrea J. Goldsmith
Andrea J. Goldsmith
SGStephanie Gil
Stephanie Gil
This work focuses on the problem of distributed optimization in multi-agent cyberphysical systems, where a legitimate agent's iterates are influenced both by the values it receives from potentially malicious neighboring agents, and by its own self-serving target function. We develop a new algorithmic and analytical framework to achieve resilience for the class of problems where stochastic values of trust between agents exist and can be exploited. In this case, we show that convergence to the true global optimal point can be recovered, both in mean and almost surely, even in the presence of malicious agents. Furthermore, we provide expected convergence rate guarantees in the form of upper bounds on the expected squared distance to the optimal value. Finally, numerical results are presented that validate our analytical convergence guarantees even when the malicious agents compose the majority of agents in the network and where existing methods fail to converge to the optimal nominal points.

19 December 2023 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
MYMichal Yemini
Michal Yemini
RSRajarshi Saha
Rajarshi Saha
EOEmre Ozfatura
Emre Ozfatura
DGDeniz Gunduz
Deniz Gunduz
AGAndrea J. Goldsmith
Andrea J. Goldsmith
Intermittent connectivity of clients to the parameter server (PS) is a major bottleneck in federated edge learning frameworks. The lack of constant connectivity induces a large generalization gap, especially when the local data distribution amongst clients exhibits heterogeneity. To overcome intermittent communication outages between clients and the central PS, we introduce the concept of collaborative relaying wherein the participating clients relay their neighbors’ local updates to the PS in order to boost the participation of clients with poor connectivity to the PS. We propose a semi-decentralized federated learning framework in which at every communication round, each client initially computes a local averaging of a subset of its neighboring clients’ updates, and eventually transmits to the PS a weighted average of its own update and those of its neighbors’. We appropriately optimize these local averaging weights to ensure that the global update at the PS is unbiased with minimal variance – consequently improving the convergence rate. Numerical evaluations on the CIFAR-10 dataset demonstrate that our collaborative relaying approach outperforms federated averaging-based benchmarks for learning over intermittently-connected networks such as when the clients communicate over millimeter wave channels with intermittent blockages.

25 November 2022 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
TGTomer Gafni
Tomer Gafni
MYMichal Yemini
Michal Yemini
KCKobi Cohen
Kobi Cohen
We consider an extension to the restless multi-armed bandit (RMAB) problem with unknown arm dynamics, where an unknown exogenous global Markov process governs the rewards distribution of each arm. Under each global state, the rewards process of each arm evolves according to an unknown Markovian rule, which is non-identical among different arms. At each time, a player chooses an arm out of $N$ arms to play, and receives a random reward from a finite set of reward states. The arms are restless, that is, their local state evolves regardless of the player's actions. Motivated by recent studies on related RMAB settings, the regret is defined as the reward loss with respect to a player that knows the dynamics of the problem, and plays at each time $t$ the arm that maximizes the expected immediate value. The objective is to develop an arm-selection policy that minimizes the regret. To that end, we develop the Learning under Exogenous Markov Process (LEMP) algorithm. We analyze LEMP theoretically and establish a finite-sample bound on the regret. We show that LEMP achieves a logarithmic regret order with time. We further analyze LEMP numerically and present simulation results that support the theoretical findings and demonstrate that LEMP significantly outperforms alternative algorithms.

18 March 2021 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
MYMichal Yemini
Michal Yemini
AGAndrea J. Goldsmith
Andrea J. Goldsmith
The deployment of small cells in cellular networks increases their overall capacity, however, the proximity of small cells to one another also causes significant interference. To reduce interference and increase capacity, this work proposes a new resource allocation optimization and network management framework for wireless networks using neighborhood-based optimization rather than fully centralized or fully decentralized methods. We first utilize hierarchical clustering with a minimax linkage criterion for forming the virtual cells. Once the virtual cells are formed we consider two cooperation models: the interference coordination model and the coordinated multi-point decoding model. In the first model, base stations in a virtual cell decode their signals independently but allocate the communication resources cooperatively. In the second model, base stations in the same virtual cell allocate the communication resources and decode their signals cooperatively. We address the resource allocation problem for each of these cooperation models. Our numerical results indicate that the proper design of the neighborhood-based optimization leads to significant gains in sum rate over fully decentralized optimization. Nonetheless, they may have a significant sum rate penalty compared to fully centralized optimization. In particular, neighborhood-based optimization has a significant sum rate penalty compared to fully centralized optimization in the coordinated multi-point model, but not in the interference coordination model.

9 July 2019 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
MYMichal Yemini
Michal Yemini
ASAnelia Somekh-Baruch
Anelia Somekh-Baruch
RCReuven Cohen
Reuven Cohen
ALAmir Leshem
Amir Leshem
In this work we consider the simultaneous connectivity of primary and secondary networks forming a cognitive model. It is assumed that the cognitive model includes guard zones that prevent nodes of the secondary network from being active in the vicinity of primary nodes, to limit interference. Under these assumptions we characterize the region of densities, the transmission radii of the nodes in each of the networks, and the guard zones for which the two networks both have a unique unbounded connected component. We prove that this model is feasible, that is, there exists simultaneous connectivity with a unique unbounded connected component in each of the networks. We also provide necessary and sufficient conditions for the simultaneous connectivity of this cognitive model.