MétaCan
Menu
Back to cohort
Record W2963746765

Training Neural Networks with Stochastic Hessian-Free Optimization

2013· article· en· W2963746765 on OpenAlex
Ryan Kiros

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
FieldComputer Science
TopicAdvanced Neural Network Applications
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsOverfittingHessian matrixAutoencoderStochastic gradient descentComputer scienceArtificial intelligenceStochastic optimizationPattern recognition (psychology)Conjugate gradient methodMathematical optimizationDropout (neural networks)Artificial neural networkMachine learningAlgorithmMathematicsApplied mathematics
DOInot available

Abstract

fetched live from OpenAlex

Hessian-free (HF) optimization has been successfully used for training deep au-toencoders and recurrent networks. HF uses the conjugate gradient algorithm to construct update directions through curvature-vector products that can be com-puted on the same order of time as gradients. In this paper we exploit this property and study stochastic HF with gradient and curvature mini-batches independent of the dataset size. We modify Martens ’ HF for these settings and integrate dropout, a method for preventing co-adaptation of feature detectors, to guard against over-fitting. Stochastic Hessian-free optimization gives an intermediary between SGD and HF that achieves competitive performance on both classification and deep autoencoder experiments. 1

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.575
Threshold uncertainty score0.404

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.001
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.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

Quick stats

Citations9
Published2013
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Neural Network ApplicationsFrench-language works237,207