FEEL: Federated End-to-End Learning With Non-IID Data for Vehicular Ad Hoc Networks
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.
Bibliographic record
Abstract
Recent studies have demonstrated the potentials of federated learning (FL) in achieving cooperative and privacy-preserving data analytics. It would also be promising if FL can be employed in vehicular ad hoc networks (VANETs) for cooperative learning tasks, such as steering angle prediction, trajectory prediction, drivable road detection, etc., among integrated vehicles. However, since VANETs are characterized by ad hoc cooperating vehicles with non-independent and identically distributed (Non-IID) data, directly employing existing FL frameworks to VANETs may cause extensive communication overhead and compromised model performance. Further, most of the existing deep learning models incorporated in FL frameworks rely heavily on data with manual annotations, leading to a huge labor cost. To address these issues, in this paper we propose an efficient and effective Federated End-to-End Learning framework for cooperative learning tasks in VANETs, named FEEL. Specifically, we first formulate a distributed optimization problem for cooperative deep learning tasks with Non-IID data in multi-hop cluster VANETs. Second, two algorithms for inter-cluster learning and inner-cluster learning are respectively designed, to reduce the communication overhead and fit Non-IID data. Third, a Paillier-based communication protocol is crafted, allowing secure model parameter updates at the central server without knowing the real updates at each cooperating base station. Extensive experiments on two real-world datasets are conducted by considering various data distributions and VANET topologies, demonstrating the high efficiency and effectiveness of the proposed FEEL framework in both regression and classification tasks.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.010 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it