default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSulaiman A. Alghunaim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Sulaiman A. Alghunaim
, Kun Yuan:
An enhanced gradient-tracking bound for distributed online stochastic convex optimization. Signal Process. 217: 109345 (2024)- [j9]Sulaiman A. Alghunaim:
Local Exact-Diffusion for Decentralized Optimization and Learning. IEEE Trans. Autom. Control. 69(11): 7371-7386 (2024) - [c11]H. Cai, Sulaiman A. Alghunaim, Ali H. Sayed:
Diffusion Optimistic Learning for Min-Max Optimization. ICASSP 2024: 5535-5539 - [i9]Haoyuan Cai, Sulaiman A. Alghunaim, Ali H. Sayed:
Diffusion Stochastic Optimization for Min-Max Problems. CoRR abs/2401.14585 (2024) - [i8]Haoyuan Cai, Sulaiman A. Alghunaim, Ali H. Sayed:
Accelerated Stochastic Min-Max Optimization Based on Bias-corrected Momentum. CoRR abs/2406.13041 (2024) - 2023
- [j8]Kun Yuan, Sulaiman A. Alghunaim, Xinmeng Huang:
Removing Data Heterogeneity Influence Enhances Network Topology Dependence of Decentralized SGD. J. Mach. Learn. Res. 24: 280:1-280:53 (2023) - [c10]Hao Yuan, Sulaiman A. Alghunaim, Kun Yuan:
Achieving Linear Speedup with Network-Independent Learning Rates in Decentralized Stochastic Optimization. CDC 2023: 139-144 - [c9]Edward Duc Hien Nguyen, Sulaiman A. Alghunaim, Kun Yuan, César A. Uribe:
On the Performance of Gradient Tracking with Local Updates. CDC 2023: 4309-4313 - [i7]Luyao Guo, Sulaiman A. Alghunaim, Kun Yuan, Laurent Condat, Jinde Cao:
RandCom: Random Communication Skipping Method for Decentralized Stochastic Optimization. CoRR abs/2310.07983 (2023) - 2022
- [j7]Sulaiman A. Alghunaim, Kun Yuan:
A Unified and Refined Convergence Analysis for Non-Convex Decentralized Learning. IEEE Trans. Signal Process. 70: 3264-3279 (2022) - [i6]Edward Duc Hien Nguyen, Sulaiman A. Alghunaim, Kun Yuan, César A. Uribe:
On the Performance of Gradient Tracking with Local Updates. CoRR abs/2210.04757 (2022) - 2021
- [j6]Sulaiman A. Alghunaim, Ernest K. Ryu, Kun Yuan, Ali H. Sayed:
Decentralized Proximal Gradient Algorithms With Linear Convergence Rates. IEEE Trans. Autom. Control. 66(6): 2787-2794 (2021) - [j5]Sulaiman A. Alghunaim, Qi Lyu, Ming Yan, Ali H. Sayed:
Dual Consensus Proximal Algorithm for Multi-Agent Sharing Problems. IEEE Trans. Signal Process. 69: 5568-5579 (2021) - [i5]Kun Yuan, Sulaiman A. Alghunaim:
Removing Data Heterogeneity Influence Enhances Network Topology Dependence of Decentralized SGD. CoRR abs/2105.08023 (2021) - [i4]Sulaiman A. Alghunaim, Kun Yuan:
A Unified and Refined Convergence Analysis for Non-Convex Decentralized Learning. CoRR abs/2110.09993 (2021) - 2020
- [j4]Sulaiman A. Alghunaim, Ali H. Sayed:
Linear convergence of primal-dual gradient methods and their performance in distributed optimization. Autom. 117: 109003 (2020) - [j3]Sulaiman A. Alghunaim, Ali H. Sayed:
Distributed Coupled Multiagent Stochastic Optimization. IEEE Trans. Autom. Control. 65(1): 175-190 (2020) - [j2]Sulaiman A. Alghunaim, Kun Yuan, Ali H. Sayed:
A Proximal Diffusion Strategy for Multiagent Optimization With Sparse Affine Constraints. IEEE Trans. Autom. Control. 65(11): 4554-4567 (2020) - [j1]Kun Yuan, Sulaiman A. Alghunaim, Bicheng Ying, Ali H. Sayed:
On the Influence of Bias-Correction on Distributed Stochastic Optimization. IEEE Trans. Signal Process. 68: 4352-4367 (2020) - [c8]Sulaiman A. Alghunaim, Ming Yan, Ali H. Sayed:
A Multi-Agent Primal-Dual Strategy for Composite Optimization over Distributed Features. EUSIPCO 2020: 2095-2099 - [i3]Sulaiman A. Alghunaim, Ming Yan, Ali H. Sayed:
A Multi-Agent Primal-Dual Strategy for Composite Optimization over Distributed Features. CoRR abs/2006.08722 (2020)
2010 – 2019
- 2019
- [c7]Kun Yuan, Sulaiman A. Alghunaim, Bicheng Ying, Ali H. Sayed:
On the Performance of Exact Diffusion over Adaptive Networks. CDC 2019: 4898-4903 - [c6]Lucas Cassano, Sulaiman A. Alghunaim, Ali H. Sayed:
Team Policy Learning for Multi-agent Reinforcement Learning. ICASSP 2019: 3062-3066 - [c5]Sulaiman A. Alghunaim, Kun Yuan, Ali H. Sayed:
A Linearly Convergent Proximal Gradient Algorithm for Decentralized Optimization. NeurIPS 2019: 2844-2854 - [i2]Kun Yuan, Sulaiman A. Alghunaim, Bicheng Ying, Ali H. Sayed:
On the Performance of Exact Diffusion over Adaptive Networks. CoRR abs/1903.10956 (2019) - [i1]Sulaiman A. Alghunaim, Kun Yuan, Ali H. Sayed:
A Linearly Convergent Proximal Gradient Algorithm for Decentralized Optimization. CoRR abs/1905.07996 (2019) - 2018
- [c4]Sulaiman A. Alghunaim, Kun Yuan, Ali H. Sayed:
Dual Coupled Diffusion for Distributed Optimization with Affine Constraints. CDC 2018: 829-834 - [c3]Sulaiman A. Alghunaim, Ali H. Sayed:
Distributed Coupled Learning Over Adaptive Networks. ICASSP 2018: 6353-6357 - 2017
- [c2]Sulaiman A. Alghunaim, Kun Yuan, Ali H. Sayed:
Decentralized exact coupled optimization. Allerton 2017: 338-345 - [c1]João Y. Ishihara, Sulaiman A. Alghunaim:
Diffusion LMS filter for distributed estimation of systems with stochastic state transition and observation matrices. ACC 2017: 5199-5204
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-12-02 22:31 CET 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:
