MétaCan
Menu
Back to cohort
Record W2132572274 · doi:10.1109/tsa.2005.851917

LSP quantization by a union of locally trained codebooks

2005· article· en· W2132572274 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 Speech and Audio Processing · 2005
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Data Compression Techniques
Canadian institutionsMcGill University
Fundersnot available
KeywordsCodebookVector quantizationAlgorithmMathematicsEncoderSpeech codingComputational complexity theoryCode-excited linear predictionSpeech recognitionPattern recognition (psychology)Linear predictive codingComputer scienceArtificial intelligenceStatistics

Abstract

fetched live from OpenAlex

We present a fixed rate encoding scheme for the line spectrum pair (LSP) representation of an LPC-filter, based on Gaussian mixture (GM) modeling. For each mixture component, we construct a codebook by a union of product quantizers. Each local codebook is trained, independently, using a clustering scheme similar to the generalized Lloyd algorithm (GLA), over synthetic data. The training algorithm iterates fast, due to low complexity encoding, and converges in few iterations. The overall codebook is a combination of local codebooks, and inherits their high performance, while having a moderate complexity. We provide numerical results for average spectral distortion (SD) of the proposed encoder, and benchmark them by a lower bound, according to high-rate theory. We achieve an average SD (full-band measure) of 1 dB at 23 b/frame, for speech signals sampled at 8 kHz and LPC of order 10. By tolerating additional complexity, we reach a SD within 0.01 dB of the lower bound.

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.912
Threshold uncertainty score0.540

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.012
GPT teacher head0.261
Teacher spread0.248 · 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