Arsalan Sharif-Nassab

19 papers A* 2Journal 16Unranked 1
YearRankTypeTitle / Venue / Authors
2024 J jnl
Order Optimal Bounds for One-Shot Federated Learning Over Non-Convex Loss Functions.
IEEE Trans. Inf. Theory
Arsalan Sharif-Nassab, Saber Salehkaleybar, S. Jamaloddin Golestani
2021 J jnl
Jumping Fluid Models and Delay Stability of Max-Weight Dynamics under Heavy-Tailed Traffic.
CoRR
Arsalan Sharif-Nassab, John N. Tsitsiklis
2021 J jnl
One-Shot Federated Learning: Theoretical Limits and Algorithms to Achieve Them.
J. Mach. Learn. Res.
Saber Salehkaleybar, Arsalan Sharif-Nassab, S. Jamaloddin Golestani
2021 J jnl
Order Optimal One-Shot Federated Learning for non-Convex Loss Functions.
CoRR
Arsalan Sharif-Nassab, Saber Salehkaleybar, S. Jamaloddin Golestani
2020 A* conf
Bounds on Over-Parameterization for Guaranteed Existence of Descent Paths in Shallow ReLU Networks.
ICLR
Arsalan Sharif-Nassab, Saber Salehkaleybar, S. Jamaloddin Golestani
2020 J jnl
Sensitivity to Cumulative Perturbations for a Class of Piecewise Constant Hybrid Systems.
IEEE Trans. Autom. Control.
Arsalan Sharif-Nassab, John N. Tsitsiklis, S. Jamaloddin Golestani
2019 J jnl
Nonexpansive Piecewise Constant Hybrid Systems are Conservative.
CoRR
Arsalan Sharif-Nassab, John N. Tsitsiklis, S. Jamaloddin Golestani
2019 A* conf
Order Optimal One-Shot Distributed Learning.
NeurIPS
Arsalan Sharif-Nassab, Saber Salehkaleybar, S. Jamaloddin Golestani
2019 J jnl
Order Optimal One-Shot Distributed Learning.
CoRR
Arsalan Sharif-Nassab, Saber Salehkaleybar, S. Jamaloddin Golestani
2019 J jnl
Theoretical Limits of One-Shot Distributed Learning.
CoRR
Saber Salehkaleybar, Arsalan Sharif-Nassab, S. Jamaloddin Golestani
2019 J jnl
When do Trajectories have Bounded Sensitivity to Cumulative Perturbations.
CoRR
Arsalan Sharif-Nassab, S. Jamaloddin Golestani
2018 J jnl
Fluctuation Bounds for the Max-Weight Policy, with Applications to State Space Collapse.
CoRR
Arsalan Sharif-Nassab, John N. Tsitsiklis, S. Jamaloddin Golestani
2018 J jnl
Sensitivity to Cumulative Perturbations for a Class of Piecewise Constant Hybrid Systems.
CoRR
Arsalan Sharif-Nassab, John N. Tsitsiklis, S. Jamaloddin Golestani
2017 J jnl
Distributed Voting/Ranking with Optimal Number of States per Node.
CoRR
Saber Salehkaleybar, Arsalan Sharif-Nassab, S. Jamaloddin Golestani
2017 J jnl
Invariancy of Sparse Recovery Algorithms.
IEEE Trans. Inf. Theory
Milad Kharratzadeh, Arsalan Sharif-Nassab, Massoud Babaie-Zadeh
2017 J jnl
On the Possibility of Network Scheduling With Polynomial Complexity and Delay.
IEEE/ACM Trans. Netw.
Arsalan Sharif-Nassab, S. Jamaloddin Golestani
2015 J jnl
Distributed Voting/Ranking With Optimal Number of States per Node.
IEEE Trans. Signal Inf. Process. over Networks
Saber Salehkaleybar, Arsalan Sharif-Nassab, S. Jamaloddin Golestani
2012 J jnl
Connectivity Analysis of One-Dimensional Ad Hoc Networks with Arbitrary Spatial Distribution for Variable and Fixed Number of Nodes.
IEEE Trans. Mob. Comput.
Arsalan Sharif-Nassab, Farid Ashtiani
2012 — conf
How to use real-valued sparse recovery algorithms for complex-valued sparse recovery?
EUSIPCO
Arsalan Sharif-Nassab, Milad Kharratzadeh, Massoud Babaie-Zadeh, Christian Jutten