default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArsalan Sharif-Nassab
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]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): 2807-2830 (2024)- 2021
- [j6]Saber Salehkaleybar, Arsalan Sharif-Nassab, S. Jamaloddin Golestani:
One-Shot Federated Learning: Theoretical Limits and Algorithms to Achieve Them. J. Mach. Learn. Res. 22: 189:1-189:47 (2021) - [i9]Arsalan Sharif-Nassab, Saber Salehkaleybar, S. Jamaloddin Golestani:
Order Optimal One-Shot Federated Learning for non-Convex Loss Functions. CoRR abs/2108.08677 (2021) - [i8]Arsalan Sharif-Nassab, John N. Tsitsiklis:
Jumping Fluid Models and Delay Stability of Max-Weight Dynamics under Heavy-Tailed Traffic. CoRR abs/2111.07420 (2021) - 2020
- [j5]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): 1057-1072 (2020) - [c3]Arsalan Sharif-Nassab, Saber Salehkaleybar, S. Jamaloddin Golestani:
Bounds on Over-Parameterization for Guaranteed Existence of Descent Paths in Shallow ReLU Networks. ICLR 2020
2010 – 2019
- 2019
- [c2]Arsalan Sharif-Nassab, Saber Salehkaleybar, S. Jamaloddin Golestani:
Order Optimal One-Shot Distributed Learning. NeurIPS 2019: 2165-2174 - [i7]Saber Salehkaleybar, Arsalan Sharif-Nassab, S. Jamaloddin Golestani:
Theoretical Limits of One-Shot Distributed Learning. CoRR abs/1905.04634 (2019) - [i6]Arsalan Sharif-Nassab, S. Jamaloddin Golestani:
When do Trajectories have Bounded Sensitivity to Cumulative Perturbations. CoRR abs/1905.11746 (2019) - [i5]Arsalan Sharif-Nassab, John N. Tsitsiklis, S. Jamaloddin Golestani:
Nonexpansive Piecewise Constant Hybrid Systems are Conservative. CoRR abs/1905.12361 (2019) - [i4]Arsalan Sharif-Nassab, Saber Salehkaleybar, S. Jamaloddin Golestani:
Order Optimal One-Shot Distributed Learning. CoRR abs/1911.00731 (2019) - 2018
- [i3]Arsalan Sharif-Nassab, John N. Tsitsiklis, S. Jamaloddin Golestani:
Sensitivity to Cumulative Perturbations for a Class of Piecewise Constant Hybrid Systems. CoRR abs/1807.08139 (2018) - [i2]Arsalan Sharif-Nassab, John N. Tsitsiklis, S. Jamaloddin Golestani:
Fluctuation Bounds for the Max-Weight Policy, with Applications to State Space Collapse. CoRR abs/1810.09180 (2018) - 2017
- [j4]Milad Kharratzadeh, Arsalan Sharif-Nassab, Massoud Babaie-Zadeh:
Invariancy of Sparse Recovery Algorithms. IEEE Trans. Inf. Theory 63(6): 3333-3347 (2017) - [j3]Arsalan Sharif-Nassab, S. Jamaloddin Golestani:
On the Possibility of Network Scheduling With Polynomial Complexity and Delay. IEEE/ACM Trans. Netw. 25(6): 3850-3862 (2017) - [i1]Saber Salehkaleybar, Arsalan Sharif-Nassab, S. Jamaloddin Golestani:
Distributed Voting/Ranking with Optimal Number of States per Node. CoRR abs/1703.08838 (2017) - 2015
- [j2]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): 259-267 (2015) - 2012
- [j1]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): 1425-1435 (2012) - [c1]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: 849-853
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 00:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
