MétaCan
Menu
Back to cohort
Record W2169875613 · doi:10.1109/isit.2001.935891

Causal source coding of stationary sources with high resolution

2002· article· en· W2169875613 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
TopicAlgorithms and Data Compression
Canadian institutionsQueen's University
Fundersnot available
KeywordsSource codeEncoderMathematicsEntropy (arrow of time)AlgorithmQuantization (signal processing)Decoding methodsRate–distortion theoryEntropy rateComputer scienceApplied mathematicsBinary entropy functionData compressionStatisticsPhysicsPrinciple of maximum entropy

Abstract

fetched live from OpenAlex

Neuhoff and Gilbert (1982) defined a causal lossy source code as a system where the reconstruction of the present source sample is restricted to be a function of the present and past source samples, while the code stream itself may be non-causal and have variable rate. They showed that for stationary and memoryless sources, optimum causal source coding is achieved by time-sharing at most two entropy coded scalar quantizers. We extend this result to general real valued stationary sources with finite differential entropy rate, in the limit of small distortions. We show that for the mean square distortion, the optimum causal encoder at high resolution is a fixed uniform quantizer followed by a sequence entropy coder. Thus, the cost of causality is the "space filling loss" of the uniform quantizer, i.e., (1/2)log(2/spl pi/e/12)/spl ap/0.254 bit. This generalizes the well known result of Gish and Pierce on asymptotically optimal entropy constrained scalar quantization.

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: Methods · Consensus signal: none
Teacher disagreement score0.950
Threshold uncertainty score0.175

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.018
GPT teacher head0.212
Teacher spread0.194 · 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

Citations7
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicAlgorithms and Data CompressionFrench-language works237,207