default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhaoxian Wu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c5]Yue Huang, Zhaoxian Wu, Qing Ling:
On the Convergence of Single-Timescale Multi-Sequence Stochastic Approximation Without Fixed Point Smoothness. ICASSP 2024: 9581-9585- [i6]Zhaoxian Wu, Tayfun Gokmen, Malte J. Rasch, Tianyi Chen:
Towards Exact Gradient-based Training on Analog In-memory Computing. CoRR abs/2406.12774 (2024) - [i5]Ying Cao, Zhaoxian Wu, Kun Yuan, Ali H. Sayed:
On the Trade-off between Flatness and Optimization in Distributed Learning. CoRR abs/2406.20006 (2024) - 2023
- [j5]Zhaoxian Wu
, Tianyi Chen, Qing Ling:
Byzantine-Resilient Decentralized Stochastic Optimization With Robust Aggregation Rules. IEEE Trans. Signal Process. 71: 3179-3195 (2023) - [c4]Xingrong Dong, Zhaoxian Wu, Qing Ling, Zhi Tian:
Distributed Online Learning With Adversarial Participants In An Adversarial Environment. ICASSP 2023: 1-5 - [i4]Xingrong Dong, Zhaoxian Wu, Qing Ling, Zhi Tian:
Byzantine-Robust Distributed Online Learning: Taming Adversarial Participants in An Adversarial Environment. CoRR abs/2307.07980 (2023) - 2022
- [j4]Jie Peng, Zhaoxian Wu, Qing Ling, Tianyi Chen:
Byzantine-robust variance-reduced federated learning over distributed non-i.i.d. data. Inf. Sci. 616: 367-391 (2022) - [j3]Weiyu Li, Zhaoxian Wu, Tianyi Chen, Liping Li, Qing Ling:
Communication-Censored Distributed Stochastic Gradient Descent. IEEE Trans. Neural Networks Learn. Syst. 33(11): 6831-6843 (2022) - [c3]Kun Yuan, Zhaoxian Wu, Qing Ling:
A Byzantine-Resilient Dual Subgradient Method for Vertical Federated Learning. ICASSP 2022: 4273-4277 - [i3]Zhaoxian Wu, Tianyi Chen, Qing Ling:
Byzantine-Resilient Decentralized Stochastic Optimization with Robust Aggregation Rules. CoRR abs/2206.04568 (2022) - 2021
- [j2]Zhaoxian Wu, Han Shen, Tianyi Chen, Qing Ling:
Byzantine-Resilient Decentralized Policy Evaluation With Linear Function Approximation. IEEE Trans. Signal Process. 69: 3839-3853 (2021) - [c2]Zhaoxian Wu, Han Shen, Tianyi Chen, Qing Ling:
Byzantine-Resilient Decentralized TD Learning with Linear Function Approximation. ICASSP 2021: 5040-5044 - 2020
- [j1]Zhaoxian Wu, Qing Ling, Tianyi Chen, Georgios B. Giannakis:
Federated Variance-Reduced Stochastic Gradient Descent With Robustness to Byzantine Attacks. IEEE Trans. Signal Process. 68: 4583-4596 (2020) - [c1]Zhaoxian Wu, Qing Ling, Tianyi Chen, Georgios B. Giannakis:
Resilient to Byzantine Attacks Finite-Sum Optimization Over Networks. ICASSP 2020: 5910-5914 - [i2]Jie Peng, Zhaoxian Wu, Qing Ling:
Byzantine-Robust Variance-Reduced Federated Learning over Distributed Non-i.i.d. Data. CoRR abs/2009.08161 (2020)
2010 – 2019
- 2019
- [i1]Zhaoxian Wu, Qing Ling, Tianyi Chen, Georgios B. Giannakis:
Federated Variance-Reduced Stochastic Gradient Descent with Robustness to Byzantine Attacks. CoRR abs/1912.12716 (2019)
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-10-07 22:22 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:
