kth.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Federated Cubic Regularized Newton Learning with sparsification-amplified differential privacy
Department of Electronic and Computer Engineering, Hong Kong University of Science and Technology, Hong Kong.
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Decision and Control Systems (Automatic Control). KTH, School of Electrical Engineering and Computer Science (EECS), Centres, Digital futures.ORCID iD: 0000-0002-0819-5303
School of System Design and Intelligent Manufacturing, Southern University of Science and Technology, Shenzhen, 518055, China.
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Decision and Control Systems (Automatic Control). KTH, School of Electrical Engineering and Computer Science (EECS), Centres, Digital futures.ORCID iD: 0000-0001-9940-5929
Show others and affiliations
2026 (English)In: Automatica, ISSN 0005-1098, E-ISSN 1873-2836, Vol. 183, article id 112531Article in journal (Refereed) Published
Abstract [en]

This paper explores the cubic-regularized Newton method within a federated learning framework while addressing two major concerns: privacy leakage and communication bottlenecks. We propose the Differentially Private Federated Cubic Regularized Newton (DP-FCRN) algorithm, which leverages second-order techniques to achieve lower iteration complexity than first-order methods. We incorporate noise perturbation during local computations to ensure privacy. Furthermore, we employ sparsification in uplink transmission, which not only reduces the communication costs but also amplifies the privacy guarantee. Specifically, this approach reduces the necessary noise intensity without compromising privacy protection. We analyze the convergence properties of our algorithm and establish the privacy guarantee. Finally, we validate the effectiveness of the proposed algorithm through experiments on a benchmark dataset.

Place, publisher, year, edition, pages
Elsevier BV , 2026. Vol. 183, article id 112531
Keywords [en]
Communication sparsification, Cubic regularized Newton method, Differential privacy, Federated learning
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:kth:diva-369609DOI: 10.1016/j.automatica.2025.112531ISI: 001565840800001Scopus ID: 2-s2.0-105014813109OAI: oai:DiVA.org:kth-369609DiVA, id: diva2:1997376
Note

QC 20250923

Available from: 2025-09-12 Created: 2025-09-12 Last updated: 2025-09-23Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Liu, ChangxinJohansson, Karl H.

Search in DiVA

By author/editor
Liu, ChangxinJohansson, Karl H.
By organisation
Decision and Control Systems (Automatic Control)Digital futures
In the same journal
Automatica
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 45 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf