Distributed Online Learning Algorithm With Differential Privacy Strategy for Convex Nondecomposable Global Objectives

06/16/2022
by   Huqiang Cheng, et al.
0

In this paper, we deal with a general distributed constrained online learning problem with privacy over time-varying networks, where a class of nondecomposable objective functions are considered. Under this setting, each node only controls a part of the global decision variable, and the goal of all nodes is to collaboratively minimize the global objective over a time horizon T while guarantees the security of the transmitted information. For such problems, we first design a novel generic algorithm framework, named as DPSDA, of differentially private distributed online learning using the Laplace mechanism and the stochastic variants of dual averaging method. Then, we propose two algorithms, named as DPSDA-C and DPSDA-PS, under this framework. Theoretical results show that both algorithms attain an expected regret upper bound in 𝒪( √(T) ) when the objective function is convex, which matches the best utility achievable by cutting-edge algorithms. Finally, numerical experiment results on both real-world and randomly generated datasets verify the effectiveness of our algorithms.

READ FULL TEXT
research
09/01/2011

Differentially Private Online Learning

In this paper, we consider the problem of preserving privacy in the onli...
research
06/25/2023

Locally Differentially Private Distributed Online Learning with Guaranteed Optimality

Distributed online learning is gaining increased traction due to its uni...
research
05/26/2019

Dual Averaging Method for Online Graph-structured Sparsity

Online learning algorithms update models via one sample per iteration, t...
research
10/10/2022

Do you pay for Privacy in Online learning?

Online learning, in the mistake bound model, is one of the most fundamen...
research
06/24/2023

Zero-Concentrated Private Distributed Learning for Nonsmooth Objective Functions

This paper develops a fully distributed differentially-private learning ...
research
10/30/2018

An Online-Learning Approach to Inverse Optimization

In this paper, we demonstrate how to learn the objective function of a d...
research
10/01/2013

Online Learning of Dynamic Parameters in Social Networks

This paper addresses the problem of online learning in a dynamic setting...

Please sign up or login with your details

Forgot password? Click here to reset