MétaCan
Menu
Back to cohort
Record W4288598872 · doi:10.48550/arxiv.1902.08673

Ising-Dropout: A Regularization Method for Training and Compression of\n Deep Neural Networks

2019· preprint· en· W4288598872 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

VenuearXiv (Cornell University) · 2019
Typepreprint
Languageen
FieldComputer Science
TopicMachine Learning and Data Classification
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsMNIST databaseOverfittingComputer scienceInitializationArtificial intelligenceRegularization (linguistics)Dropout (neural networks)InferenceArtificial neural networkMachine learningDeep neural networksDeep learning

Abstract

fetched live from OpenAlex

Overfitting is a major problem in training machine learning models,\nspecifically deep neural networks. This problem may be caused by imbalanced\ndatasets and initialization of the model parameters, which conforms the model\ntoo closely to the training data and negatively affects the generalization\nperformance of the model for unseen data. The original dropout is a\nregularization technique to drop hidden units randomly during training. In this\npaper, we propose an adaptive technique to wisely drop the visible and hidden\nunits in a deep neural network using Ising energy of the network. The\npreliminary results show that the proposed approach can keep the classification\nperformance competitive to the original network while eliminating optimization\nof unnecessary network parameters in each training cycle. The dropout state of\nunits can also be applied to the trained (inference) model. This technique\ncould compress the network in terms of number of parameters up to 41.18% and\n55.86% for the classification task on the MNIST and Fashion-MNIST datasets,\nrespectively.\n

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.933
Threshold uncertainty score0.810

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.0010.001
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.077
GPT teacher head0.235
Teacher spread0.158 · 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