MétaCan
Menu
Back to cohort
Record W4382119288 · doi:10.1109/mcom.003.2200306

Model Drift in Dynamic Networks

2023· article· en· W4382119288 on OpenAlexaff
Dimitrios Michael Manias, Ali Chouman, Abdallah Shami

Bibliographic record

VenueIEEE Communications Magazine · 2023
Typearticle
Languageen
FieldComputer Science
TopicIoT and Edge/Fog Computing
Canadian institutionsWestern University
Fundersnot available
KeywordsComputer scienceConcept driftRendering (computer graphics)Component (thermodynamics)Process (computing)Distributed computingReal-time computingArtificial intelligenceMachine learningData stream mining

Abstract

fetched live from OpenAlex

With the introduction of 5G and beyond networks, increasing intelligence and automation levels are being employed in managing and orchestrating virtualized networks. Through Machine Learning (ML) models, Network Service Providers (NSPs) can forecast and predict their networks' future state and proactively react to any potential fault, performance degradation, or change in demand stemming from the dynamic nature of the network environment. As such, ML models will become a critical component in the NSP decision-making process. However, model drift poses significant challenges and can severely degrade an ML model's performance, rendering it inaccurate and ineffective. This article discusses the various types of model drift and the dangers they pose to ML models deployed in dynamic networks. Additionally, the challenges surrounding the implementation of drift detection and mitigation schemes in resource-constrained networks are outlined. This work discusses three innovation areas to address model drift in dynamic networks, including network drift characteristic understanding, preventative ML model maintenance, and drift-resistant ML architectures. Finally, a novel drift detection and adaptation framework for dynamic networks and an illustrative 5G case study of model drift are presented.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.012
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.013
Threshold uncertainty score0.026

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.012
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0020.004
Open science0.0020.002
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0010.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.045
GPT teacher head0.302
Teacher spread0.257 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations38
Published2023
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Communications MagazineSame topicIoT and Edge/Fog ComputingFrench-language works237,207