MétaCan
Menu
Back to cohort
Record W2043703498 · doi:10.1109/isit.2013.6620646

Randomized quantization and optimal design with a marginal constraint

2013· article· en· W2043703498 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
TopicAdvanced Data Compression Techniques
Canadian institutionsQueen's University
Fundersnot available
KeywordsMathematicsQuantization (signal processing)Vector quantizationMathematical optimizationConstraint (computer-aided design)Regular polygonMeasure (data warehouse)Probability distributionJoint probability distributionApplied mathematicsAlgorithmComputer scienceStatistics

Abstract

fetched live from OpenAlex

We consider the problem of optimal randomized vector quantization under a constraint on the output's distribution. The problem is formalized by introducing a general representation of randomized quantization via probability measures over the space of joint distributions on the source and reproduction alphabets. Using this representation and results from optimal transport theory, we show the existence of an optimal (minimum distortion) randomized quantizer having a fixed output distribution under various conditions. For sources with densities and the mean square distortion measure, we show that this optimum can be attained by randomizing quantizers having convex code cells. We also consider a relaxed version of the problem where the output marginal must belong to some neighborhood (in the weak topology) of a fixed probability measure. We demonstrate that finitely randomized quantizers form an optimal class for the relaxed problem.

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: Methods
Teacher disagreement score0.912
Threshold uncertainty score0.227

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.001
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.248
Teacher spread0.230 · 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

Citations13
Published2013
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Data Compression TechniquesFrench-language works237,207