Arsalan Sharif-Nassab

According to our database, Arsalan Sharif-Nassab authored at least 16 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Order Optimal Bounds for One-Shot Federated Learning Over Non-Convex Loss Functions.

Arsalan Sharif-Nassab, Saber Salehkaleybar, S. Jamaloddin Golestani

IEEE Trans. Inf. Theory, April, 2024

2021

One-Shot Federated Learning: Theoretical Limits and Algorithms to Achieve Them.

Saber Salehkaleybar, Arsalan Sharif-Nassab, S. Jamaloddin Golestani

J. Mach. Learn. Res., 2021

Jumping Fluid Models and Delay Stability of Max-Weight Dynamics under Heavy-Tailed Traffic.

Arsalan Sharif-Nassab, John N. Tsitsiklis

CoRR, 2021

Order Optimal One-Shot Federated Learning for non-Convex Loss Functions.

Arsalan Sharif-Nassab, Saber Salehkaleybar, S. Jamaloddin Golestani

CoRR, 2021

2020

Sensitivity to Cumulative Perturbations for a Class of Piecewise Constant Hybrid Systems.

Arsalan Sharif-Nassab, John N. Tsitsiklis, S. Jamaloddin Golestani

IEEE Trans. Autom. Control., 2020

Bounds on Over-Parameterization for Guaranteed Existence of Descent Paths in Shallow ReLU Networks.

Arsalan Sharif-Nassab, Saber Salehkaleybar, S. Jamaloddin Golestani

Proceedings of the 8th International Conference on Learning Representations, 2020

2019

Nonexpansive Piecewise Constant Hybrid Systems are Conservative.

Arsalan Sharif-Nassab, John N. Tsitsiklis, S. Jamaloddin Golestani

CoRR, 2019

When do Trajectories have Bounded Sensitivity to Cumulative Perturbations.

Arsalan Sharif-Nassab, S. Jamaloddin Golestani

CoRR, 2019

Theoretical Limits of One-Shot Distributed Learning.

Saber Salehkaleybar, Arsalan Sharif-Nassab, S. Jamaloddin Golestani

CoRR, 2019

Order Optimal One-Shot Distributed Learning.

Arsalan Sharif-Nassab, Saber Salehkaleybar, S. Jamaloddin Golestani

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2018

Fluctuation Bounds for the Max-Weight Policy, with Applications to State Space Collapse.

Arsalan Sharif-Nassab, John N. Tsitsiklis, S. Jamaloddin Golestani

CoRR, 2018

2017

On the Possibility of Network Scheduling With Polynomial Complexity and Delay.

Arsalan Sharif-Nassab, S. Jamaloddin Golestani

IEEE/ACM Trans. Netw., 2017

Invariancy of Sparse Recovery Algorithms.

Milad Kharratzadeh, Arsalan Sharif-Nassab, Massoud Babaie-Zadeh

IEEE Trans. Inf. Theory, 2017

2015

Distributed Voting/Ranking With Optimal Number of States per Node.

Saber Salehkaleybar, Arsalan Sharif-Nassab, S. Jamaloddin Golestani

IEEE Trans. Signal Inf. Process. over Networks, 2015

2012

Connectivity Analysis of One-Dimensional Ad Hoc Networks with Arbitrary Spatial Distribution for Variable and Fixed Number of Nodes.

Arsalan Sharif-Nassab, Farid Ashtiani

IEEE Trans. Mob. Comput., 2012

How to use real-valued sparse recovery algorithms for complex-valued sparse recovery?

Arsalan Sharif-Nassab, Milad Kharratzadeh, Massoud Babaie-Zadeh, Christian Jutten

Proceedings of the 20th European Signal Processing Conference, 2012