The DOI matches its Crossref record; 70 of the 70 references it cites were found in a registry or an index.
Supervised Learning Under Distributed Features
Open accessAbstract
This paper studies the problem of learning under both large datasets and large-dimensional feature space scenarios. The feature information is assumed to be spread across agents in a network, where each agent observes some of the features. Through local cooperation, the agents are supposed to interact with each other to solve an inference problem and converge towards the global minimizer of an empirical risk. We study this problem exclusively in the primal domain, and propose new and effective distributed solutions with guaranteed convergence to the minimizer with linear rate under strong convexity. This is achieved by combining a dynamic diffusion construction, a pipeline strategy, and variance-reduced techniques. Simulation results illustrate the conclusions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Consensus algorithms were also developed in [158] to jointly learn a model under the decentralized network while keeping the distributed data features locally.”
From Edge artificial intelligence for 6g: vision, enabling technologies, and applications (2022) · cites this paper as [158]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
The Elements of Statistical Learning
Hastie, T., Tibshirani, R., & Friedman, J. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-84858-7 · Cited by 25,970
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
Computer Architecture: A Quantitative Approach
Hennessy, J. L., & Patterson, D. A. (1989) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 9,375
(2010) · Cited by 8,261
Parallel and Distributed Computation: Numerical Methods
Bertsekas, D. P., & Tsitsiklis, J. N. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 5,293
Distributed Subgradient Methods for Multi-Agent Optimization
Nedic, A., & Ozdaglar, A. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.2009515 · Cited by 3,719
Large Scale Distributed Deep Networks
Dean, J. B., Corrado, G. S., Monga, R., Chen, K., Devin, M., Mao, M., Ranzato, M., Senior, A., Tucker, P. A., Yang, K., et al. (2012) · Cited by 3,199
Research works printed but not linked: 2
- 10.1109/tsp.2018.2875883 · DOI
- horn, 1990, Matrix Analysis
Cited by
Edge artificial intelligence for 6g: vision, enabling technologies, and applications
Letaief, K. B., Shi, Y., Lu, J., & Lu, J. (2022) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3126076 · Cited by 829
“Consensus algorithms were also developed in [158] to jointly learn a model under the decentralized network while keeping the distributed data features locally.”
MethodFedBCD: A Communication-Efficient Collaborative Learning Framework for Distributed Features
Liu, Y., Zhang, X., Kang, Y., Li, L., Chen, T., Hong, M., & Yang, Q. (2022) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2022.3198176 · Cited by 257
A Sharp Estimate on the Transient Time of Distributed Stochastic Gradient Descent
Pu, S., Olshevsky, A., & Paschalidis, I. C. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2021.3126253 · Cited by 72
Pu, S., Olshevsky, A., & Paschalidis, I. C. (2020) · IEEE Signal Processing Magazine · doi:10.1109/msp.2020.2975212 · Cited by 61
Hierarchical Federated Learning for Hybrid Data Partitioning Across Multitype Sensors
Su, L., & Lau, V. K. N. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3051382 · Cited by 37
Metadata
- Authors
- Ying, B., Yuan, K., & Sayed, A. H.
- Affiliations
- École Polytechnique Fédérale de Lausanne (CH)
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2019-02-15
- Volume
- 67
- Issue
- 4
- Pages
- 977-992
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2805185133
- Cited by
- 50
- References
- 67
- Citations by year
- 2026: 2 · 2025: 3 · 2024: 4 · 2023: 4 · 2022: 8 · 2021: 13 · 2020: 7 · 2019: 9
- FWCI
- 4.49
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- Locations
- IEEE Transactions on Signal Processing (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- Infoscience (Ecole Polytechnique Fédérale de Lausanne) (submittedVersion, cc-by-nc-nd)
- arXiv (Cornell University)
- Funders
- National Science Foundation (CCF-1011918)
- Topics
- Physical Sciences › Engineering › Control and Systems Engineering › Distributed Control Multi-Agent Systems
- Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
- Physical Sciences › Computer Science › Computer Networks and Communications › Distributed Sensor Networks and Detection Algorithms
- Keywords
- distributed learning, supervised learning, large-scale datasets, high-dimensional feature space, multi-agent systems, strong convexity, linear convergence, variance reduction, empirical risk minimization
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Supervised Learning Under Distributed Features. https://app.cochat.ai/papers/10.1109/tsp.2018.2881661
- The paper
- Ying, B., Yuan, K., & Sayed, A. H. (2019). Supervised Learning Under Distributed Features. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2018.2881661
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.