MétaCan
Menu
Back to cohort
Record W4319264761 · doi:10.36227/techrxiv.21976475.v1

Inversion-Free Sparse Bayesian Learning for Temporally Correlated Signal Recovery

2023· preprint· en· W4319264761 on OpenAlexaff
Yuhui Song

Bibliographic record

Venuenot available
Typepreprint
Languageen
FieldEngineering
TopicSparse and Compressive Sensing Techniques
Canadian institutionsQueen's UniversityMemorial University of Newfoundland
Fundersnot available
KeywordsInversion (geology)Bayesian inferenceComputer scienceAlgorithmSparse matrixCompressed sensingBayesian probabilityInferenceSignal recoveryMaximizationMathematical optimizationMathematicsArtificial intelligence

Abstract

fetched live from OpenAlex

Compressed sensing recovers the sparse signal from far fewer samples than required by the well-known Nyquist--Shannon sampling theorem to speed up the measure- ment procedure. The sparse signal recovery performance can be significantly improved by exploiting the temporal correlation in the multiple measurement vector model within the framework of sparse Bayesian learning. However, it is inevitable to involve the matrix inversion for existing methods, making the application of these schemes to large datasets impractical. To overcome this bottleneck, in this letter, we propose an inversion-free sparse Bayesian learning algorithm for temporally correlated sparse signal recovery, which is free of any matrix inversion operation and only requires simple addition and multiplication operations. Specifically, utilizing a property for the convex quadratic func- tion, we obtain a lower bound for the likelihood distribution that enables the computationally efficient model inference based on the expectation-maximization algorithm. Simulation results show its superior performance over other state-of-the-art methods in terms of the recovery performance and the running time.

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 categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.920
Threshold uncertainty score1.000

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.000
Open science0.0010.001
Research integrity0.0010.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.033
GPT teacher head0.238
Teacher spread0.204 · 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.

Study designSimulation or modeling
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

Citations2
Published2023
Admission routes1
Has abstractyes

Explore more

Same topicSparse and Compressive Sensing TechniquesFrench-language works237,207