MétaCan
Menu
Back to cohort
Record W1988999907 · doi:10.1109/tac.2011.2170452

On the Relationship Between the Enforced Convergence Criterion and the Asymptotically Optimal Laguerre Pole

2011· article· en· W1988999907 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 Automatic Control · 2011
Typearticle
Languageen
FieldEngineering
TopicControl Systems and Identification
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsLaguerre polynomialsMathematicsConvergence (economics)Applied mathematicsQuasiconvex functionMaxima and minimaFunction (biology)GeneralizationLaguerre's methodMathematical optimizationControl theory (sociology)Mathematical analysisComputer scienceConvex optimizationRegular polygonConvex analysis

Abstract

fetched live from OpenAlex

When approximating dynamic systems with Laguerre basis functions (LBFs) it is important to tune the Laguerre pole such that the expansion can be both parsimonious and accurate. Expressing the sum of squared errors (SSE) as a function of the Laguerre pole leads to an objective function that has many local minima and therefore cannot be optimized directly. Two alternative methods have been proposed in the literature: an asymptotically optimal method, and the enforced convergence criterion (ECC). In this paper, a generalization of the ECC will be investigated such that in the limit minimizing this generalized ECC and computing the asymptotically optimal solution lead to the same Laguerre pole. Moreover, it will be proved that these generalized ECCs are quasiconvex functions which means they can be efficiently minimized using numerical optimization techniques. The concept of operator quasiconvexity is investigated and used to prove quasiconvexity of the ECC.

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.001
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: Empirical · Consensus signal: none
Teacher disagreement score0.714
Threshold uncertainty score0.355

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.000
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.023
GPT teacher head0.220
Teacher spread0.197 · 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