MétaCan
Menu
Back to cohort
Record W2138771231 · doi:10.1109/icassp.2009.4960341

ℓ<inf>P</inf> minimization for sparse vector reconstruction

2009· article· en· W2138771231 on OpenAlexaff
Nasser Mourad, J.P. Reilly

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicSparse and Compressive Sensing Techniques
Canadian institutionsMcMaster University
Fundersnot available
KeywordsMinificationFunction (biology)Regular polygonConvex functionMathematical optimizationIterative methodMathematicsProperty (philosophy)Point (geometry)AlgorithmConvex optimizationClass (philosophy)Computer scienceArtificial intelligence

Abstract

fetched live from OpenAlex

In this paper we present a new technique for minimizing a class of nonconvex functions for solving the problem of under-determined systems of linear equations. The proposed technique is based on locally replacing the nonconvex objective function by a convex objective function. The main property of the utilized convex function is that it is minimized at a point that reduces the original concave function. The resulting algorithm is iterative and outperforms some previous algorithms that have been applied to the same problem.

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: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.609
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.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.021
GPT teacher head0.234
Teacher spread0.213 · 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 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

Citations11
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicSparse and Compressive Sensing TechniquesFrench-language works237,207