MétaCan
Menu
Back to cohort
Record W2109569768 · doi:10.1109/iscas.2009.5117696

Second order cone programming (SOCP) relaxations for large margin HMMs in speech recognition

2009· article· en· W2109569768 on OpenAlexaff
Yan Yin, Hui Jiang

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicSpeech and Audio Processing
Canadian institutionsYork University
Fundersnot available
KeywordsComputer scienceHidden Markov modelMargin (machine learning)Second-order cone programmingSpeech recognitionConvex optimizationString (physics)Pattern recognition (psychology)Regular polygonArtificial intelligenceAlgorithmMathematical optimizationMathematicsMachine learning

Abstract

fetched live from OpenAlex

In this paper, we present a new fast optimization method to solve large margin estimation (LME) of continuous density hidden Markov models (CDHMMs) for speech recognition based on second order cone programming (SOCP). SOCP is a class of nonlinear convex optimization problems which can be solved very efficiently. In this work, we have formulated the LME of CDHMMs as an SOCP problem and proposed two improved tighter SOCP relaxation methods for LME. The new LME/SOCP methods have been evaluated in a connected digit string speech recognition task using the standard TIDIGITS database. Experimental results demonstrate efficiency and effectiveness of the proposed LME/SOCP methods in speech recognition.

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 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: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.991
Threshold uncertainty score0.390

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.001
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.021
GPT teacher head0.271
Teacher spread0.250 · 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 teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designOther design
Domainnot available
GenreMethods

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
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicSpeech and Audio ProcessingFrench-language works237,207