Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 24 of the 26 references it cites were found in a registry or an index.

FDML: A Collaborative Machine Learning Framework for Distributed Features

Hu, Yaochen, Niu, Di, Yang, Jianming, Zhou, Shengping · 2019 · Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining

Abstract

Most current distributed machine learning systems try to scale up model training by using a data-parallel architecture that divides the computation for different samples among workers. We study distributed machine learning from a different motivation, where the information about the same samples, e.g., users and objects, are owned by several parities that wish to collaborate but do not want to share raw data with each other. We propose an asynchronous stochastic gradient descent (SGD) algorithm for such a feature distributed machine learning (FDML) problem, to jointly learn from distributed features, with theoretical convergence guarantees under bounded asynchrony. Our algorithm does not require sharing the original features or even local model parameters between parties, thus preserving the data locality. The system can also easily incorporate differential privacy mechanisms to preserve a higher level of privacy. We implement the FDML system in a parameter server architecture and compare our system with fully centralized learning (which violates data locality) and learning based on only local features, through extensive experiments performed on both a public data set a9a, and a large dataset of 5,000,000 records and 8700 decentralized features from three collaborating apps at Tencent including Tencent MyApp, Tecent QQ Browser and Tencent Mobile Safeguard. Experimental results have demonstrated that the proposed FDML system can be used to significantly enhance app recommendat…

Overview

Integrity signals

Registry

Crossref · 10.1145/3292500.3330765

Cites

24 of 24 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Citations

Cites

Show all 26 references

Research works printed but not linked: 14

  1. Abadi Mart'in, 2016, Proc. USENIX Symposium on Operating System Design and Implementation (OSDI) .
  2. Ben-Nun Tal, 2018, Demystifying Parallel and Distributed Deep Learning: An In-Depth Concurrency Analysis. arXiv preprint arXiv:1802.09941 · arXiv
  3. Bradley Joseph K, 2011, Parallel coordinate descent for l1-regularized loss minimization. arXiv preprint arXiv:1105.5379 · arXiv
  4. Dean Jeffrey, 2012, et almbox
  5. 10.5555/2503308.2188391 · doi:10.5555/2503308.2188391
  6. 10.5555/1791834.1791836 · doi:10.5555/1791834.1791836
  7. Gilad-Bachrach Ran, 2016, International Conference on Machine Learning . 201--210
  8. Ho Qirong, 2013, Phillip B Gibbons, Garth A Gibson, Greg Ganger, and Eric P Xing.
  9. Hsieh Kevin, 2017, Gaia: Geo-Distributed Machine Learning Approaching LAN Speeds.. In NSDI. 629--647.
  10. Lee Seunghak, 2014, Xun Zheng, Qirong Ho, Garth A Gibson, and Eric P Xing.
  11. Xiangru Lian Yijun Huang Yuncheng Li and Ji Liu. 2015. Asynchronous parallel stochastic gradient for nonconvex optimization. In Advances in Neural Information Processing Systems. 2737--2745. Xiangru Lian Yijun Huang Yuncheng Li and Ji Liu. 2015. Asynchronous parallel stochastic gradient for nonconvex optimization. In Advances in Neural Information Processing Systems. 2737--2745.
  12. McMahan H Brendan, 2016, et almbox
  13. Chad Scherrer Ambuj Tewari Mahantesh Halappanavar and David Haglin. 2012. Feature clustering for accelerating parallel coordinate descent. In Advances in Neural Information Processing Systems. 28--36. Chad Scherrer Ambuj Tewari Mahantesh Halappanavar and David Haglin. 2012. Feature clustering for accelerating parallel coordinate descent. In Advances in Neural Information Processing Systems. 28--36.
  14. Takabi Hassan, 2016, 29th Annual Conference on Neural Information Processing Systems (NIPS) .

Cited by

See all 171

Metadata

Authors
Hu, Y., Niu, D., Yang, J., & Zhou, S.
Affiliations
  • University of Alberta (CA)
  • Tencent (China) (CN)
Venue
Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining
Publisher
ACM
Published
2019-07-25
Pages
2232-2240
OpenAlex
W2951059495
Cited by
163
References
26
Citations by year
2026: 7 · 2025: 21 · 2024: 29 · 2023: 30 · 2022: 33 · 2021: 28 · 2020: 12 · 2019: 3
FWCI
7.27
Type
conference paper
Language
en
Open access
closed
Locations
ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
  • Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
  • Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
Keywords
distributed learning, privacy-preserving machine learning, data ownership

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: FDML: A Collaborative Machine Learning Framework for Distributed Features. https://app.cochat.ai/papers/10.1145/3292500.3330765
The paper
Hu, Y., Niu, D., Yang, J., & Zhou, S. (2019). FDML: A Collaborative Machine Learning Framework for Distributed Features. Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. https://doi.org/10.1145/3292500.3330765

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.