Privacy-preserving distributed online optimization over unbalanced digraphs via subgradient rescaling
In this article, we investigate a distributed online constrained optimization problem with
differential privacy where the network is modeled by an unbalanced digraph with a row …
differential privacy where the network is modeled by an unbalanced digraph with a row …
Communication-efficient online federated learning strategies for kernel regression
VC Gogineni, S Werner, YF Huang… - IEEE Internet of Things …, 2022 - ieeexplore.ieee.org
This article presents communication-efficient approaches to federated learning (FL) for
resource-constrained devices with access to streaming data. In particular, we first propose a …
resource-constrained devices with access to streaming data. In particular, we first propose a …
Asynchronous decentralized online learning
Most existing algorithms in decentralized online learning are conducted in the synchronous
setting. However, synchronization makes these algorithms suffer from the straggler problem …
setting. However, synchronization makes these algorithms suffer from the straggler problem …
DAdam: A Consensus-Based Distributed Adaptive Gradient Method for Online Optimization
P Nazari, DA Tarzanagh… - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
Adaptive optimization methods, such as AdaGrad, RMSProp, and Adam, are widely used in
solving large-scale machine learning problems. A number of schemes have been proposed …
solving large-scale machine learning problems. A number of schemes have been proposed …
Distributed support vector machines over dynamic balanced directed networks
M Doostmohammadian, A Aghasi… - IEEE Control …, 2021 - ieeexplore.ieee.org
In this letter, we consider the binary classification problem via distributed Support Vector
Machines (SVMs), where the idea is to train a network of agents, with limited share of data …
Machines (SVMs), where the idea is to train a network of agents, with limited share of data …
Online distributed learning over graphs with multitask graph-filter models
F Hua, R Nassif, C Richard, H Wang… - IEEE Transactions on …, 2020 - ieeexplore.ieee.org
In this article, we are interested in adaptive and distributed estimation of graph filters from
streaming data. We formulate this problem as a consensus estimation problem over graphs …
streaming data. We formulate this problem as a consensus estimation problem over graphs …
A Newton tracking algorithm with exact linear convergence for decentralized consensus optimization
This paper considers the problem of decentralized consensus optimization over a network,
where each node holds a strongly convex and twice-differentiable local objective function …
where each node holds a strongly convex and twice-differentiable local objective function …
COKE: Communication-censored decentralized kernel learning
This paper studies the decentralized optimization and learning problem where multiple
interconnected agents aim to learn an optimal decision function defined over a reproducing …
interconnected agents aim to learn an optimal decision function defined over a reproducing …
Decentralised learning with random features and distributed gradient descent
D Richards, P Rebeschini… - … conference on machine …, 2020 - proceedings.mlr.press
We investigate the generalisation performance of Distributed Gradient Descent with implicit
regularisation and random features in the homogenous setting where a network of agents …
regularisation and random features in the homogenous setting where a network of agents …
Compressed decentralized learning of conditional mean embedding operators in reproducing kernel hilbert spaces
Conditional mean embedding (CME) operators encode conditional probability densities
within Reproducing Kernel Hilbert Space (RKHS). In this paper, we present a decentralized …
within Reproducing Kernel Hilbert Space (RKHS). In this paper, we present a decentralized …