MétaCan
Menu
Back to cohort
Record W2001107740 · doi:10.1109/tasl.2011.2163511

All-Pole Modeling of Discrete Spectral Powers: A Unified Approach

2011· article· en· W2001107740 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 Audio Speech and Language Processing · 2011
Typearticle
Languageen
FieldComputer Science
TopicBlind Source Separation Techniques
Canadian institutionsCommunications Research Centre CanadaUniversity of Ottawa
Fundersnot available
KeywordsRobustness (evolution)Autoregressive modelConvergence (economics)MinificationGradient descentDescent (aeronautics)Applied mathematicsMathematicsNewton's method in optimizationMathematical optimizationComputer scienceAlgorithmLocal convergenceIterative methodArtificial intelligenceArtificial neural networkPhysics

Abstract

fetched live from OpenAlex

In this correspondence, a unified approach to the autoregressive (AR) modeling of power spectral densities is described. We show that by introducing auxiliary sequences, the minimization of several customary spectral distances can be performed with the exact same convenient approach, whether a gradient-descent or a Newton/quasi-Newton descent is chosen. Moreover, we extend the usual optimization of unnormalized AR coefficients to a two-step optimization of normalized AR coefficients, and provide evidence that this alternative approach can accelerate convergence and provide robustness to erroneous initializations. Convergence and modeling results are also given.

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.733
Threshold uncertainty score0.563

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.031
GPT teacher head0.269
Teacher spread0.238 · 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