1 citations · 1 across the 7 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
math.OC2024
Time-Varying Convex Optimization with Computational Complexity
M. Rostami, S. S. Kia
In this article, we consider the problem of unconstrained time-varying convex optimization, where the cost function changes with time. We provide an in-depth technical analysis of…
cs.LG2024★ 1 cited
FedScalar: Federated Learning with Scalar Communication for Bandwidth-Constrained Networks
M. Rostami, S. S. Kia
In bandwidth-constrained federated learning~(FL) settings, the repeated upload of high-dimensional model updates from agents to a central server constitutes the primary bottleneck,…