MétaCan
Menu
Back to cohort
Record W2775632911 · doi:10.15353/vsnl.v3i1.175

Estimating Optimal Depth of VGG Net with Tree-Structured Parzen Estimators

2017· article· en· W2775632911 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.
venuePublished in a venue whose home country is Canada.

Bibliographic record

VenueJournal of Computational Vision and Imaging Systems · 2017
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Neural Network Applications
Canadian institutionsSunnybrook HospitalUniversity of Toronto
Fundersnot available
KeywordsEstimatorComputer scienceComputationConvolutional neural networkGridTree (set theory)ArchitectureArtificial intelligencePattern recognition (psychology)AlgorithmMathematicsStatistics

Abstract

fetched live from OpenAlex

Deep convolutional neural networks (CNNs) have shown astonishingperformances in variety of fields. However, different architecturesof the networks are required for different datasets, and findingright architecture for given data has been a topic of great interest incomputer vision communities. One of the most important factors ofthe CNNs architecture is the depth of the networks, which plays asignificant role in avoiding over-fitting. Grid Search is widely usedfor estimating the depth, but it requires huge computation time. Motivatedby this, a method for finding an optimal architecture depth isintroduced, which is based on a hyper-parameter optimizer calledTree-Structured Parzen Estimators (TPE). In this work, we showthat the TPE is capable of estimating the CNNs architecture depthwith an accuracy of 83.33% with CIFAR-10 dataset and 60.00%with CIFAR-100 dataset while it reduces the computation time bymore 70% compared to the Grid Search.

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: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.539
Threshold uncertainty score0.393

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.001
Open science0.0010.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.012
GPT teacher head0.298
Teacher spread0.286 · 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