MétaCan
Menu
Back to cohort
Record W1857608169 · doi:10.1109/ssp.2005.1628600

Adaptive linear estimators, using biased cramer-RAO bound

2005· article· en· W1857608169 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/SP 13th Workshop on Statistical Signal Processing, 2005 · 2005
Typearticle
Languageen
FieldComputer Science
TopicDirection-of-Arrival Estimation Techniques
Canadian institutionsQueen's University
Fundersnot available
KeywordsEstimatorMathematicsSingular value decompositionCramér–Rao boundApplied mathematicsUpper and lower boundsEstimation theoryFisher informationMatrix (chemical analysis)Mathematical optimizationStatisticsAlgorithmMathematical analysis

Abstract

fetched live from OpenAlex

In this paper, the biased Cramer-Rao lower bound (BCRLB) is used to derive the estimate of unknown parameters in a linear model with an arbitrary known additive noise probability density function (PDF).We show that the derived linear estimators (not unique) are linear functions of the observations. Examples are included to illustrate their performances. We show that a biased estimator obtained by optimization of BCRLB is not necessary satisfactory in a general case; therefore, additional considerations must be taken into account. If the Fisher information matrix (FIM) is singular, we use the method of singular value decomposition (SVD) to extract the parameter estimate of linear model. For example we show that in a linear model, parameter estimation based on single observation leads to the normalized least mean square (NLMS) algorithm. In this example using BCRLB optimization, we find the relation between the step size of the NLMS algorithm and bound of bias gradient matrix

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 categoriesMeta-epidemiology (narrow)
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.926
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0000.001
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.046
GPT teacher head0.337
Teacher spread0.291 · 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