MétaCan
Menu
Back to cohort
Record W2149567218 · doi:10.1109/tit.2009.2032831

On Properties of Locally Optimal Multiple Description Scalar Quantizers With Convex Cells

2009· article· en· W2149567218 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

VenueIEEE Transactions on Information Theory · 2009
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Data Compression Techniques
Canadian institutionsMcMaster University
Fundersnot available
KeywordsMathematicsScalar (mathematics)Regular polygonUniquenessProbability density functionApplied mathematicsConvex functionConvex optimizationMathematical optimizationDiscrete mathematicsMathematical analysisStatisticsGeometry

Abstract

fetched live from OpenAlex

It is known that the generalized Lloyd method is applicable to locally optimal multiple description scalar quantizer (MDSQ) design. However, it remains unsettled when the resulting MDSQ is also globally optimal. We partially answer the above question by proving that for a fixed index assignment there is a unique locally optimal fixed-rate MDSQ of convex cells under Trushkin's sufficient conditions for the uniqueness of locally optimal fixed-rate single description scalar quantizer. This result holds for fixed-rate multiresolution scalar quantizer (MRSQ) of convex cells as well. Thus, the well-known log-concave probability density function (pdf) condition can be extended to the multiple description and multiresolution cases.

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: Bench or experimental · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.931
Threshold uncertainty score0.535

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.003
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.012
GPT teacher head0.210
Teacher spread0.198 · 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