Arsalan Sharif-Nassab

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 17

Top Topics

Distributed Learning

Piecewise Constant

Top Venues

IEEE Trans. Inf. Theory

J. Mach. Learn. Res.

IEEE/ACM Trans. Netw.

Publications

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