CoChat

Federated Doubly Stochastic Kernel Learning for Vertically Partitioned Data

Open access
Gu, Bin, Dang, Zhiyuan, Li, Xiang, Huang, Heng · 2020 · Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining

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

Abstract

In a lot of real-world data mining and machine learning applications, data are provided by multiple providers and each maintains private records of different feature sets about common entities. It is challenging to train these vertically partitioned data effectively and efficiently while keeping data privacy for traditional data mining and machine learning algorithms. In this paper, we focus on nonlinear learning with kernels,and propose a federated doubly stochastic kernel learning (FDSKL) algorithm for vertically partitioned data. Specifically, we use random features to approximate the kernel mapping function and use doubly stochastic gradients to update the solutions, which are all computed federatedly without the disclosure of data. Importantly, we prove that FDSKL has a sublinear convergence rate, and can guarantee the data security under the semi-honest assumption. Extensive experimental results on a variety of benchmark datasets show that FDSKL is significantly faster than state-of-the-art federated learning methods when dealing with kernels, while retaining the similar generalization performance.

Overview

Integrity signals

Registry

Crossref · 10.1145/3394486.3403298

Cites

22 of 22 references verified0 citation errors · 0 not checkable

Statistics

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

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, 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 22 references

Research works printed but not linked: 10

  1. Nadeem Badshah . 2018. Facebook to contact 87 million users affected by data breach. The Guardian) Retrieved from https://www. theguardian. com/technology/2018/apr/08/facebook-to-contact-the-87-million-users-affected-by-data-breach ( 2018 ). Nadeem Badshah. 2018. Facebook to contact 87 million users affected by data breach. The Guardian) Retrieved from https://www. theguardian. com/technology/2018/apr/08/facebook-to-contact-the-87-million-users-affected-by-data-breach (2018).
  2. Wenliang Du and Mikhail J Atallah . 2001 . Privacy-preserving cooperative statistical analysis . In Seventeenth Annual Computer Security Applications Conference. IEEE, 102--110 . Wenliang Du and Mikhail J Atallah. 2001. Privacy-preserving cooperative statistical analysis. In Seventeenth Annual Computer Security Applications Conference. IEEE, 102--110.
  3. Bin Gu , Zhouyuan Huo , and Heng Huang . 2018 . Asynchronous Doubly Stochastic Group Regularized Learning. In International Conference on Artificial Intelligence and Statistics. 1791--1800 . Bin Gu, Zhouyuan Huo, and Heng Huang. 2018. Asynchronous Doubly Stochastic Group Regularized Learning. In International Conference on Artificial Intelligence and Statistics. 1791--1800.
  4. Stephen Hardy , Wilko Henecka , Hamish Ivey-Law , Richard Nock , Giorgio Patrini , Guillaume Smith , and Brian Thorne . 2017. Private federated learning on vertically partitioned data via entity resolution and additively homomorphic encryption. arXiv preprint arXiv:1711.10677 ( 2017 ). Stephen Hardy, Wilko Henecka, Hamish Ivey-Law, Richard Nock, Giorgio Patrini, Guillaume Smith, and Brian Thorne. 2017. Private federated learning on vertically partitioned data via entity resolution and additively homomorphic encryption. arXiv preprint arXiv:1711.10677 (2017). · arXiv
  5. Yang Liu , Yingting Liu , Zhijie Liu , Junbo Zhang , Chuishi Meng , and Yu Zheng . 2019. Federated Forest . arXiv preprint arXiv:1905.10053 ( 2019 ). Yang Liu, Yingting Liu, Zhijie Liu, Junbo Zhang, Chuishi Meng, and Yu Zheng. 2019. Federated Forest. arXiv preprint arXiv:1905.10053 (2019). · arXiv
  6. Richard Nock , Stephen Hardy , Wilko Henecka , Hamish Ivey-Law , Giorgio Patrini , Guillaume Smith , and Brian Thorne . 2018. Entity Resolution and Federated Learning get a Federated Resolution. arXiv preprint arXiv:1803.04035 ( 2018 ). Richard Nock, Stephen Hardy, Wilko Henecka, Hamish Ivey-Law, Giorgio Patrini, Guillaume Smith, and Brian Thorne. 2018. Entity Resolution and Federated Learning get a Federated Resolution. arXiv preprint arXiv:1803.04035 (2018). · arXiv
  7. Ali Rahimi and Benjamin Recht. 2008. Random features for large-scale kernel machines. In Advances in neural information processing systems. 1177--1184. Ali Rahimi and Benjamin Recht. 2008. Random features for large-scale kernel machines. In Advances in neural information processing systems. 1177--1184.
  8. Walter Rudin . 1962. Fourier analysis on groups. Vol ., Vol. 121967 . Wiley Online Library . Walter Rudin. 1962. Fourier analysis on groups. Vol., Vol. 121967. Wiley Online Library.
  9. Wanli Shi , Bin Gu , Xiang Li , and Heng Huang . 2020 . Quadruply Stochastic Gradient Method for Large Scale Nonlinear Semi-Supervised Ordinal Regression AUC Optimization. In The Thirty-Fourth AAAI Conference on Artificial Intelligence , New York, NY, USA , February 7-12, 2020. AAAI Press, 5734--5741. Wanli Shi, Bin Gu, Xiang Li, and Heng Huang. 2020. Quadruply Stochastic Gradient Method for Large Scale Nonlinear Semi-Supervised Ordinal Regression AUC Optimization. In The Thirty-Fourth AAAI Conference on Artificial Intelligence, New York, NY, USA, February 7-12, 2020. AAAI Press, 5734--5741.
  10. Gong-Duo Zhang , Shen-Yi Zhao , Hao Gao , and Wu-Jun Li. 2018. Feature-Distributed SVRG for High-Dimensional Linear Classification. arXiv preprint arXiv:1802.03604 ( 2018 ). Gong-Duo Zhang, Shen-Yi Zhao, Hao Gao, and Wu-Jun Li. 2018. Feature-Distributed SVRG for High-Dimensional Linear Classification. arXiv preprint arXiv:1802.03604 (2018). · arXiv

Cited by

See all 68

Metadata

Authors
Gu, B., Dang, Z., Li, X., & Huang, H.
Affiliations
  • JD Finance America Corporation, Mountain View, CA, USA
  • Xidian University (CN)
  • Western University (CA)
Venue
Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining
Publisher
ACM
Published
2020-08-20
Pages
2483-2493
OpenAlex
W3080261024
Cited by
68
References
20
Citations by year
2026: 2 · 2025: 10 · 2024: 13 · 2023: 11 · 2022: 14 · 2021: 16 · 2020: 2
FWCI
4.10
Type
conference paper
Language
en
Open access
Locations
  • ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
  • Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
  • Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
Keywords
federated learning, vertically partitioned data, kernel learning, random features, data privacy, sublinear convergence, non-linear learning, privacy-preserving machine learning

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: Federated Doubly Stochastic Kernel Learning for Vertically Partitioned Data. https://app.cochat.ai/papers/10.1145/3394486.3403298
The paper
Gu, B., Dang, Z., Li, X., & Huang, H. (2020). Federated Doubly Stochastic Kernel Learning for Vertically Partitioned Data. Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. https://doi.org/10.1145/3394486.3403298

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.