MétaCan
Menu
Back to cohort
Record W2147795503 · doi:10.1109/pacrim.2009.5291404

Fast Group Sparse Classification

2009· article· en· W2147795503 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

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicSparse and Compressive Sensing Techniques
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsClassifier (UML)Optimization problemQuadratic programmingGreedy algorithmComputer scienceSparse approximationMinificationConvex optimizationMathematical optimizationLinear programmingLinear programming relaxationArtificial intelligenceRegular polygonMathematicsAlgorithm

Abstract

fetched live from OpenAlex

A recent work [1] proposed a novel group sparse classifier (GSC) that was based on the assumption that the training samples of a particular class approximately form a linear basis for any test sample belonging to that class. The group sparse classifier requires solving an NP hard group-sparsity promoting optimization problem. Thus a convex relaxation of the optimization problem was proposed. The convex optimization problem however, needs to be solved by quadratic programming and hence requires a large amount of computational time. To overcome this, we propose novel greedy (sub-optimal) algorithms for directly solving the NP hard minimization problem. We call the classifiers based on these greedy group sparsity promoting algorithms as fast group sparse classifiers (FGSC).

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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation 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.833
Threshold uncertainty score0.222

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.023
GPT teacher head0.229
Teacher spread0.207 · 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

Quick stats

Citations21
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicSparse and Compressive Sensing TechniquesFrench-language works237,207