Skip to content
#federated learning Book Open access

Joint Optimizing Federated Learning and Unlearning over Wireless Networks

Nov 2026 · Proceedings of the Twenty-seventh International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing · 0 citations · 6 references
Privacy-Preserving Technologies in Data

Abstract

In this paper, a communication and energy-efficient federated learning (FL) and unlearning (FU) co-designed framework is proposed. In the considered model, multiple edge devices collaboratively train a model. Users are allowed to quit the FL training and remove their data impacts on the trained model. Hence, an FU training is performed after the FL training. To reduce the energy and time consumption of FU, the users are grouped into multiple clusters such that the users in a group will retrain a deep learning model when the users in the group request to quit the FL training. The base station (BS) needs to determine the number of clusters, the users in each cluster, and the resource block (RB) allocated to each user, according to the probability that each user requests to quit the FL, data distribution, wireless channel conditions, and time and energy constraints. This problem is formulated as an optimization problem whose goal is to minimize the expected loss by determining the number of clusters, user cluster assignment, and RB allocations. This problem is challenging to solve since 1) the BS cannot predict which users will request data deletion in advance and 2) no explicit equation exists to capture the relationship between the number of clusters, user cluster assignment, and the expected FU loss. To solve the formulated problem, we first analyze the convergence rate of FU to build an explicit relationship among the FU training loss, the number of clusters, and the users in each cluster. Based on this relationship, the original problem is simplified to a mixed-integer optimization problem which can be divided into the user cluster assignment and the RB allocation optimization subproblems. These two problems are alternately solved by the designed Dinkelbach's method and the fast iterative shrinkage-thresholding algorithm (Dinkelbach-FISTA) and the standard Hungarian algorithm. Simulation results show that our method improves classification accuracy by up to 11.1% and achieves up to 3× faster convergence compared to gradient-based and ISTA-based methods.

Read PDF

Similar papers

#machine learning Review Open access Oct 2014

Software development in startup companies: A systematic mapping study

The results indicate that software engineering work practices are chosen opportunistically, adapted and configured to provide value under the constrains imposed by the startup context.

Nicolò Paternoster, Carmine Giardino, M. Unterkalmsteiner et al. · 394 citations · ⚡54
#machine learning Review Open access Jun 2014

Why Early-Stage Software Startups Fail: A Behavioral Framework

This state-of-practice investigation was performed using a literature review followed by a multiple-case study approach and presents how inconsistency between managerial strategies and execution can lead to failure by means of a behavioral framework.

Carmine Giardino, Xiaofeng Wang, P. Abrahamsson · 175 citations · ⚡19
#machine learning Review Open access Oct 2016

“Failures” to be celebrated: an analysis of major pivots of software startups

This study conducts a case survey study based on the secondary data of the major pivots happened in 49 software startups, and demonstrates that customer need pivot is the most common among all pivot types.

Sohaib Shahid Bajwa, Xiaofeng Wang, Anh Nguyen-Duc et al. · 127 citations · ⚡15
#machine learning Review Open access May 2016

Key Challenges in Software Startups Across Life Cycle Stages

It is found that what perceived as biggest challenges by software startups do vary across different life cycle stages, even though its significance decreases when the learning focuses of the startups move from problem to solution and their products mature.

Xiaofeng Wang, Henry Edison, Sohaib Shahid Bajwa et al. · 62 citations · ⚡6

Related blog posts

MIT News · Artificial Intelligence Nov 17, 2026

Learning the language of machine learning

By studying the computational foundations of language learning, Associate Professor Jacob Andreas builds intelligent systems that can communicate effectively with humans.

Microsoft Research Blog Nov 16, 2026

TokenEconomizer: Learning from Experience to Make AI Coding Agents More Efficient

AI coding agents are increasingly help developers fix bugs and build features largely on their own, but every interaction with their models consumes tokens. In each session, an agent sends instructions, tool descriptions, and session history to its model. Most efforts to reduce this cost focus on individual tasks. Yet developers return to the same […] The post TokenEconomizer: Learning from Experience to Make AI Coding Agents More Efficient appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.