MétaCan
Menu
Back to cohort
Record W2154811776 · doi:10.1109/sam.2008.4606880

New results on robust adaptive beamspace preprocessing

2008· article· en· W2154811776 on OpenAlexaff
Aboulnasr Hassanien, Sergiy A. Vorobyovy

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Adaptive Filtering Techniques
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsPreprocessorRobustness (evolution)Computer scienceOrthogonalityAlgorithmMatrix (chemical analysis)Mathematical optimizationMathematicsArtificial intelligence

Abstract

fetched live from OpenAlex

In this paper, we develop an algorithm for data-adaptive beamspace preprocessing with robustness against out-of-sector sources. Our algorithm yields an orthogonal beamspace matrix and, hence, it preserves the white noise property at the output of the beamspace preprocessor. The beamspace matrix is designed as a matrix filter that maintains an almost distortionless response towards sources within the beamspace sector while maximally rejects all out-of-sector sources. The columns of the beamspace matrix are designed sequentially, one column at a time. This sequential implementation is curried out by imposing orthogonality constraints between beamspace matrix columns. The proposed algorithm is computationally less expensive as compared to the existing data-adaptive beamspace design techniques. Simulation results are provided to validate the robustness of the developed algorithm, and show its effectiveness.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.006
Version: metacan-v3-hybrid-931329e0061cValidation 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: Empirical · Consensus signal: none
Teacher disagreement score0.005
Threshold uncertainty score0.017

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.006
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0020.002
Open science0.0010.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0050.002

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.045
GPT teacher head0.237
Teacher spread0.192 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designBench or experimental
Domainnot available
GenreEmpirical

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

Citations3
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Adaptive Filtering TechniquesFrench-language works237,207