MétaCan
Menu
← Back to cohort
Record W1744468441 · doi:10.1109/iscas.1999.777648

An in-the-loop training method for VLSI neural networks

2003· article· en· W1744468441 on OpenAlexaff
Jinming Yang, Masoud Ahmadi, G.A. Jullien, William C. Miller

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNeural Networks and Applications
Canadian institutionsUniversity of Windsor
Fundersnot available
KeywordsArtificial neural networkComputer sciencePhysical neural networkActivation functionTime delay neural networkRealization (probability)Quantization (signal processing)Very-large-scale integrationArtificial intelligenceTypes of artificial neural networksAlgorithmEmbedded systemMathematics

Abstract

fetched live from OpenAlex

This paper deals with the in-the-loop training of an intelligent sensor that is based on the use of an artificial neural network with analog neurons, programmable digital weights and an integrated photosensitive array. In the training method, each of the neuron activation functions of the actual physical realization is measured and then modeled in terms of a small neural network. These small neural networks are embedded in a larger neural network that models the complete neural network. For the training of the complete neural network model, an algorithm that allows one to train the network when the analytic nature of both the nonlinear neuron activation function and its derivative are not known is presented. We also describe an approach to training the hardware implementation using digital weights of low resolution where the weight quantization effects are especially evident.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.003
Threshold uncertainty score0.011

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
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.001
Insufficient payload (model declined to judge)0.0030.001

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.054
GPT teacher head0.333
Teacher spread0.279 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designBench or experimental
Domainnot available
GenreMethods

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

Quick stats

Citations0
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicNeural Networks and Applications→French-language works237,207→