Online Decentralized Frank-Wolfe: From theoretical bound to applications in smart-building

07/31/2022
by   Angan Mitra, et al.
4

The design of decentralized learning algorithms is important in the fast-growing world in which data are distributed over participants with limited local computation resources and communication. In this direction, we propose an online algorithm minimizing non-convex loss functions aggregated from individual data/models distributed over a network. We provide the theoretical performance guarantee of our algorithm and demonstrate its utility on a real life smart building.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/31/2022

Communication-Efficient Distributionally Robust Decentralized Learning

Decentralized learning algorithms empower interconnected edge devices to...
research
05/22/2020

Online Non-convex Learning for River Pollution Source Identification

In this paper, novel gradient based online learning algorithms are devel...
research
03/20/2021

Projection-free Distributed Online Learning with Strongly Convex Losses

To efficiently solve distributed online learning problems with complicat...
research
01/13/2021

Distribution System Voltage Prediction from Smart Inverters using Decentralized Regression

As photovoltaic (PV) penetration continues to rise and smart inverter fu...
research
05/07/2018

Holarchic Structures for Decentralized Deep Learning - A Performance Analysis

Structure plays a key role in learning performance. In centralized compu...
research
08/19/2021

Order Optimal One-Shot Federated Learning for non-Convex Loss Functions

We consider the problem of federated learning in a one-shot setting in w...
research
01/14/2020

Distributed Learning in the Non-Convex World: From Batch to Streaming Data, and Beyond

Distributed learning has become a critical enabler of the massively conn...

Please sign up or login with your details

Forgot password? Click here to reset