Bibliographic record
Abstract
Deep neural network (DNN) has been attracting a great attention in various applications.Network training algorithms play essential roles for the effectiveness of DNN.Although stochastic gradient descent (SGD) and other explicit gradient-based methods are the most popular algorithms, there are still many challenges such as gradient vanishing and explosion occurring in training a complex and deep neural networks.Motivated by the idea of error back propagation (BP) and proximal point methods (PPM), we propose a semi-implicit back propagation method for neural network training.Similar to the BP, the update on the neurons are propagated in a backward fashion and the parameters are optimized with proximal mapping.The implicit update for both hidden neurons and parameters allows to choose large step size in the training algorithm.Theoretically, we demonstrate the convergence of the proposed method under some standard assumptions.The experiments on illustrative examples, and two real data sets: MNIST and CIFAR-10, demonstrate that the proposed semi-implicit BP algorithm leads to better performance in terms of both loss decreasing and training/test accuracy, with a detail comparison to SGD/Adam and a similar algorithm proximal back propagation (ProxBP).
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
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".