MétaCan
Menu
Back to cohort

Fault-Tolerant 1-bit Representation for Distributed Inference Tasks in Wireless IoT

2021· article· en· W4200377783 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
FieldComputer Science
TopicDistributed Sensor Networks and Detection Algorithms
Canadian institutionsÉcole de Technologie Supérieure
Fundersnot available
KeywordsComputer scienceDiscriminative modelQuantization (signal processing)InferenceBinary decision diagramExternal Data RepresentationFusion centerData compressionArtificial intelligenceWireless sensor networkBenchmark (surveying)Machine learningComputer engineeringWirelessAlgorithmComputer network

Abstract

fetched live from OpenAlex

In IoT applications, the sensors usually have limited bandwidth and power resources. Therefore, the sensed data should be mapped to a low-bit representation by means of compression and quantization before being transmitted to a central node, called the fusion center (FC). At the FC, a global decision is inferred from this data. In many cases, this data is intended for machine consumption, not for human perception. However, the compression techniques are mainly designed for reconstruction fidelity. The accuracy of the inferred decision at the FC is less considered. In this work, we present an end-to-end framework for learning a 1-bit representation of correlated-sensors data. We also propose a novel loss function and a three-stage training algorithm for learning discriminative binary features at each sensor. Extensive experiments show the proposed framework achieves high compression ratios with a marginal loss in the inferred decision accuracy. Comparatively, the obtained results outperform other benchmark models in the literature.

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.952
Threshold uncertainty score0.515

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.001
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.025
GPT teacher head0.293
Teacher spread0.267 · 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