MétaCan
Menu
Back to cohort

A GPU Based SVM Method with Accelerated Kernel Matrix Calculation

2015· article· en· W1516580029 on OpenAlexaff
Bo Yan, Yitian Ren, Zijiang Yang

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicFace and Expression Recognition
Canadian institutionsYork University
Fundersnot available
KeywordsComputer scienceCUDAKernel (algebra)Graphics processing unitSupport vector machineParallel computingMassively parallelGeneral-purpose computing on graphics processing unitsComputationMatrix multiplicationCoprocessorGraphicsComputational scienceAlgorithmArtificial intelligenceComputer graphics (images)Mathematics

Abstract

fetched live from OpenAlex

Support vector machine (SVM) is a popular classifier dealing with small-scale datasets. It has outstanding performance compared to other classifiers. However the execution time is extremely long when training Big Data. The Graphics Processing Unit (GPU) is a massively parallel device which performs very well as a co-processor. NVIDIA proposed a programming platform, CUDA, in 2006, which makes it much easier to program on GPU for large-scale calculation. This paper proposes a GPU based accelerated SVM method. Matrix multiplication, which is the main procedure of kernel matrix calculation in the training stage, is the major issue for high time complexity. Thus, we propose a method to calculate the kernel matrix using GPU. The polynomial kernel function is applied in this paper. Experiment results indicate that the proposed method can increase the computation speed by as much as 41 times for the studied datasets.

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 categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.846
Threshold uncertainty score0.273

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.059
GPT teacher head0.330
Teacher spread0.271 · 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.

The models applied no category: nothing in the taxonomy fit this work.
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

Citations6
Published2015
Admission routes1
Has abstractyes

Explore more

Same topicFace and Expression RecognitionFrench-language works237,207