MétaCan
Menu
Back to cohort

Optimizing Quality and Energy Efficiency in Webrtc with ML-Powered Adaptive FEC

2024· article· en· W4401990622 on OpenAlex

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

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Data and IoT Technologies
Canadian institutionsConcordia University
Fundersnot available
KeywordsWebRTCComputer scienceForward error correctionEfficient energy useQuality (philosophy)Energy (signal processing)Reliability engineeringComputer networkTelecommunicationsElectrical engineeringEngineeringPhysicsStatisticsMathematicsDecoding methods

Abstract

fetched live from OpenAlex

Video and audio communication on mobile devices involves dynamic channels with fluctuating error rates along with the added constraints of battery efficiency and resource-limited hardware. Forward error correction (FEC) is a common method for error recovery but introduces computational and bandwidth overhead. To enhance FEC efficiency, machine learning (ML) can adapt error correction based on current channel dynamics. Existing solutions often use complex models, leading to performance issues and inefficiency. Our proposed solution prioritizes energy efficiency and practical deployment by combining Reed-Solomon coding and supervised learning. This approach corrects up to 60% of errors and achieves 2.5 times better energy efficiency than standard WebRTC and 1.7 times better efficiency than non-adaptive Reed-Solomon coding.

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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.869
Threshold uncertainty score0.311

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
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.019
GPT teacher head0.253
Teacher spread0.234 · 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

Quick stats

Citations1
Published2024
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Data and IoT TechnologiesFrench-language works237,207