MétaCan
Menu
Back to cohort
Record W4213217939 · doi:10.1109/tvt.2022.3150806

Practical Privacy-Preserving Federated Learning in Vehicular Fog Computing

2022· article· en· W4213217939 on OpenAlex
Yiran Li, Hongwei Li, Guowen Xu, Tao Xiang, Rongxing Lu

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueIEEE Transactions on Vehicular Technology · 2022
Typearticle
Languageen
FieldComputer Science
TopicPrivacy-Preserving Technologies in Data
Canadian institutionsUniversity of New Brunswick
FundersNational Natural Science Foundation of China
KeywordsCloud computingOverhead (engineering)ScalabilityComputer scienceAlgorithmArtificial intelligenceTheoretical computer scienceProgramming languageDatabaseOperating system

Abstract

fetched live from OpenAlex

Benefitting from the outstanding capabilities of intelligent controlling and prediction, federated learning (FL) has been widely applied in Internet of Vehicle (IoV). However, applying FL into fog-computing-based IoV still suffers from two crucial problems: (i) how to achieve the privacy-preserving FL under the flexible architecture of fog computing with no assistance of cloud server, and (ii) how to guarantee the privacy-preserving FL to perform with high efficiency and low overhead in fog-computing settings. For addressing the above issues, we propose a practical framework, named <sc xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Galaxy</small> , the first of its kind in the regime of privacy-preserving FL under the setting of non-cloud-assisted fog computing. Based on the secure multi-party computation (MPC) technology, our framework satisfies the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\boldsymbol{(T,N)}$</tex-math></inline-formula> -threshold property, permitting <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\boldsymbol{N}$</tex-math></inline-formula> (a scalable number) fog nodes to cooperate with multiple users for implementing privacy-preserving FL, while resisting the collusion up to <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\boldsymbol{T}-\boldsymbol{1}$</tex-math></inline-formula> fog nodes, and being robust to at most <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\boldsymbol{N}-\boldsymbol{T}$</tex-math></inline-formula> fog nodes simultaneously dropping out. Besides, considering the practical scenario that low-quality data may negatively impair the FL model convergence, our scheme can handle users’ low-quality data while protecting all user-related information under our secure framework. Based on the above superior properties, our scheme can perform with high scalability, high processing efficiency, and low resource overhead, being practical for fog-computing-based IoV. Extensive experiment results demonstrate our scheme with high-level performance.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.003
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Science and technology studies, Open science, Research integrity
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.722
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0020.004
Science and technology studies0.0010.000
Scholarly communication0.0000.001
Open science0.0160.006
Research integrity0.0000.005
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.028
GPT teacher head0.288
Teacher spread0.260 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it