Federated Learning and Meta Learning: Approaches, Applications, and Directions

X Liu, Y Deng, A Nallanathan… - … Surveys & Tutorials, 2023 - ieeexplore.ieee.org
Over the past few years, significant advancements have been made in the field of machine
learning (ML) to address resource management, interference management, autonomy, and …

Federated and meta learning over non-wireless and wireless networks: A tutorial

X Liu, Y Deng, A Nallanathan, M Bennis - arXiv preprint arXiv:2210.13111, 2022 - arxiv.org
In recent years, various machine learning (ML) solutions have been developed to solve
resource management, interference management, autonomy, and decision-making …

The deep bootstrap framework: Good online learners are good offline generalizers

P Nakkiran, B Neyshabur, H Sedghi - arXiv preprint arXiv:2010.08127, 2020 - arxiv.org
We propose a new framework for reasoning about generalization in deep learning. The core
idea is to couple the Real World, where optimizers take stochastic gradient steps on the …

Online optimization for real-time peer-to-peer electricity market mechanisms

Z Guo, P Pinson, S Chen, Q Yang… - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
Owing to the fast deployment of distributed energy resources (DERs) and the further
development of demand-side management, small agents in electricity markets are becoming …

An asynchronous online negotiation mechanism for real-time peer-to-peer electricity markets

Z Guo, P Pinson, Q Wu, S Chen… - IEEE transactions on …, 2021 - ieeexplore.ieee.org
Participants in electricity markets are becoming more proactive owing to the fast deployment
of distributed energy resources (DERs) and the further development of demand-side …

Online non-convex learning: Following the perturbed leader is optimal

AS Suggala, P Netrapalli - Algorithmic Learning Theory, 2020 - proceedings.mlr.press
We study the problem of online learning with non-convex losses, where the learner has
access to an offline optimization oracle. We show that the classical Follow the Perturbed …

Online nonconvex optimization with limited instantaneous oracle feedback

Z Guan, Y Zhou, Y Liang - The Thirty Sixth Annual …, 2023 - proceedings.mlr.press
We investigate online nonconvex optimization from a local regret minimization perspective.
Previous studies along this line implicitly required the access to sufficient gradient oracles at …

Pre-trained model reusability evaluation for small-data transfer learning

YX Ding, XZ Wu, K Zhou… - Advances in Neural …, 2022 - proceedings.neurips.cc
We study {\it model reusability evaluation}(MRE) for source pre-trained models: evaluating
their transfer learning performance to new target tasks. In special, we focus on the setting …

Second-order online nonconvex optimization

A Lesage-Landry, JA Taylor… - IEEE Transactions on …, 2020 - ieeexplore.ieee.org
We present the online Newton's method, a single-step second-order method for online
nonconvex optimization. We analyze its performance and obtain a dynamic regret bound …

Self-distillation for few-shot image captioning

X Chen, M Jiang, Q Zhao - Proceedings of the IEEE/CVF …, 2021 - openaccess.thecvf.com
The development of large-scale image-captioning datasets is expensive, while the
abundance of unpaired images and text corpus can potentially help reduce the efforts of …