MétaCan
Menu
Back to cohort
Record W1975596825 · doi:10.1016/j.crma.2005.04.032

Reconstruction and subgaussian processes

2005· article· en· W1975596825 on OpenAlexaff
Shahar Mendelson, Alain Pajor, Nicole Tomczak-Jaegermann

Bibliographic record

VenueComptes Rendus Mathématique · 2005
Typearticle
Languageen
FieldEngineering
TopicSparse and Compressive Sensing Techniques
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsMathematicsCombinatorics

Abstract

fetched live from OpenAlex

This Note presents a randomized method to approximate any vector v from some set T ⊂ R n . The data one is given is the set T , and k scalar products ( 〈 X i , v 〉 ) i = 1 k , where ( X i ) i = 1 k are i.i.d. isotropic subgaussian random vectors in R n , and k ≪ n . We show that with high probability any y ∈ T for which ( 〈 X i , y 〉 ) i = 1 k is close to the data vector ( 〈 X i , v 〉 ) i = 1 k will be a good approximation of v , and that the degree of approximation is determined by a natural geometric parameter associated with the set T . This extends and improves recent results by Candes and Tao.

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.003
metaresearch head score (Gemma)0.013
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.007
Threshold uncertainty score0.022

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.013
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0020.002
Science and technology studies0.0010.003
Scholarly communication0.0020.004
Open science0.0020.003
Research integrity0.0020.003
Insufficient payload (model declined to judge)0.0070.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.009
GPT teacher head0.205
Teacher spread0.196 · 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 designTheoretical or conceptual
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
Published2005
Admission routes1
Has abstractyes

Explore more

Same venueComptes Rendus MathématiqueSame topicSparse and Compressive Sensing TechniquesFrench-language works237,207