MétaCan
Menu
Back to cohort

Coded Deep Learning: Framework and Preliminary Results

2025· article· W4415367189 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
Language
FieldComputer Science
TopicMachine Learning and Data Classification
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsInferenceQuantization (signal processing)Deep learningEntropy (arrow of time)Probabilistic logicCoding (social sciences)Differentiable functionApproximate inference

Abstract

fetched live from OpenAlex

Deep learning (DL) often achieves success at the cost of large model sizes and high computational complexity, making training and inference challenging in resource-limited environments. To address this, we introduce coded deep learning (CDL), a framework that integrates information-theoretic coding concepts into DL to compress model weights and activations, reduce computational complexity, and enable efficient model/data parallelism. Specifically, CDL: (i) introduces a probabilistic quantization method for model weights and activations, including a differentiable variant for gradient computation; (ii) executes both forward and backward passes on quantized values, significantly reducing floating-point operations and training complexity; (iii) enforces entropy constraints on weights and activations, ensuring compressibility throughout training and lowering communication costs in distributed settings; and (iv) produces a quantized model by default, reducing post-training inference and storage complexity. Extensive experiments demonstrate that CDL outperforms state-of-the-art DNN compression methods.

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)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.898
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.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0010.000
Scholarly communication0.0010.000
Open science0.0010.001
Research integrity0.0000.001
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.013
GPT teacher head0.283
Teacher spread0.270 · 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

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicMachine Learning and Data ClassificationFrench-language works237,207