Skip to content
aiqbench takeMachine Learning

aiqbench analysis

This research addresses a critical gap in federated learning for autonomous driving by enabling the precise removal of faulty model contributions identified only after they manifest as operational symptoms. The proposed method integrates unlearning directly into the aggregation rule, significantly reducing residual harm while maintaining near-optimal utility compared to full retraining. This advancement strengthens the reliability and safety guarantees of fleet-wide AI models in connected vehicle networks.
Sources coveringarXiv, LessWrong, Fortune, Quantum Computing Report
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Initiating Removal from Operational Symptoms in Federated Vehicular Networks

arXiv2 min read

arXiv:2610.22584v1 Announce Type: new Abstract: Connected vehicles train a driving model through federated learning (FL) and drive with it, so a faulty contribution often surfaces only as a delayed symptom on the road. Federated unlearning (FU) assumes that a removal request names what to forget. A symptom names no vehicle or round, and aggregation has already spread its cause across the fleet. We propose \underline{A}ggregation-\underline{T}ime \underline{O}perational-evidence \underline{N}eutralization of \underline{E}ffects (\method{}), which makes unlearning a term of the FL aggregation rule. \method{} projects everyday driving errors and reported symptoms onto a subspace spanned by recent global increments. It propagates the surviving effect of every contribution with curvature estimated from these increments and scores all contributions in one backward pass. A two-tier correction suppresses suspected effects in every round and eliminates confirmed ones after a one-round probe. We prove that backward scoring matches forward scoring and that the elimination is exact when training is flat outside the subspace. On three driving datasets, \method{} leaves 43\% to 61\% less residual harm than the strongest baseline in eight of nine settings while staying within 0.36 points of full retraining in utility.

Abstract:Connected vehicles train a driving model through federated learning (FL) and drive with it, so a faulty contribution often surfaces only as a delayed symptom on the road. Federated unlearning (FU) assumes that a removal request names what to forget. A symptom names no vehicle or round, and aggregation has already spread its cause across the fleet. We propose \underline{A}ggregation-\underline{T}ime \underline{O}perational-evidence \underline{N}eutralization of \underline{E}ffects (\method{}), which makes unlearning a term of the FL aggregation rule. \method{} projects everyday driving errors and reported symptoms onto a subspace spanned by recent global increments. It propagates the surviving effect of every contribution with curvature estimated from these increments and scores all contributions in one backward pass. A two-tier correction suppresses suspected effects in every round and eliminates confirmed ones after a one-round probe. We prove that backward scoring matches forward scoring and that the elimination is exact when training is flat outside the subspace. On three driving datasets, \method{} leaves 43\% to 61\% less residual harm than the strongest baseline in eight of nine settings while staying within 0.36 points of full retraining in utility.

Machine Learning (cs.LG); Networking and Internet Architecture (cs.NI)

arXiv:2610.22584 [cs.LG]

(or arXiv:2610.22584v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2610.22584 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 281 words

Related coverage