MétaCan
Menu
Back to cohort
Record W4409187661 · doi:10.1002/9781394294404.ch9

Neural Networks Using Log‐Cosh

2025· other· en· W4409187661 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

Venuenot available
Typeother
Languageen
FieldComputer Science
TopicAdvanced Statistical Modeling Techniques
Canadian institutionsCarleton UniversityUniversity of British Columbia
Fundersnot available
KeywordsArtificial neural networkComputer scienceMathematicsArtificial intelligence

Abstract

fetched live from OpenAlex

The objective of this chapter is to investigate the feasibility of applying the log-cosh loss to neural networks to determine the advantages and disadvantages over the cross-entropy loss for binary classification. The chapter includes descriptions of activation functions, namely, the sigmoid and relu functions, as well as the procedures involved in forward and backward propagation, and gradient calculations. Details of the operation of neural networks are described, along with the steps involved in the training process, with examples to facilitate the comparison between the two competing approaches. The chapter concludes with examples of binary classification and a number of metrics typically used to assess accuracy.

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: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.926
Threshold uncertainty score0.734

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.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.029
GPT teacher head0.321
Teacher spread0.292 · 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

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Statistical Modeling TechniquesFrench-language works237,207