MétaCan
Menu
Back to cohort

On Distributed Lossy Coding of Symmetrically Correlated Gaussian Sources

2022· article· en· W4221156816 on OpenAlexaff
Siyao Zhou, Sadaf Salehkalaibar, Jingjing Qian, Jun Chen, Wuxian Shi, Yiqun Ge, Wen Tong

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicWireless Communication Security Techniques
Canadian institutionsHuawei Technologies (Canada)McMaster University
Fundersnot available
KeywordsLossy compressionEncoderUpper and lower boundsGaussianDistortion (music)AlgorithmCramér–Rao boundRate distortionFunction (biology)Decoding methodsMathematicsDiscrete mathematicsComputer scienceCoding (social sciences)StatisticsMathematical analysisPhysicsTelecommunications

Abstract

fetched live from OpenAlex

In this paper, we consider a distributed lossy compression network with$L$encoders and a decoder. Each encoder observes a source and sends a compressed version to the decoder. The decoder produces a joint reconstruction of target signals with the mean squared error distortion below a given threshold. It is assumed that the observed sources can be expressed as the sum of target signals and corruptive noises which are independently generated from two symmetric multivariate Gaussian distributions. We are interested in the minimum compression rate of this network versus the distortion threshold, which is known as the rate-distortion function. We derive a lower bound on the rate-distortion function by explicitly solving a max-min problem. Our lower bound matches the well-known Berger-Tung upper bound for some values of the distortion threshold. The asymptotic expressions of the upper and lower bounds are derived in the large$L$limit and are shown to coincide under specific constraints.

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.002
metaresearch head score (Gemma)0.007
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.003
Threshold uncertainty score0.016

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.007
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0000.002
Scholarly communication0.0010.003
Open science0.0020.002
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0020.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.010
GPT teacher head0.219
Teacher spread0.209 · 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

Citations1
Published2022
Admission routes1
Has abstractyes

Explore more

Same topicWireless Communication Security TechniquesFrench-language works237,207