Toward Switching and Fusing Neuromorphic Computing: Vertical Bulk Heterojunction Transistors with Multi‐Neuromorphic Functions for Efficient Deep Learning
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.
Bibliographic record
Abstract
Abstract The combination of artificial neural networks (ANN) and spiking neural networks (SNN) holds great promise for advancing artificial general intelligence (AGI). However, the reported ANN and SNN computational architectures are independent and require a large number of auxiliary circuits and external algorithms for fusion training. Here, a novel vertical bulk heterojunction neuromorphic transistor (VHNT) capable of emulating both ANN and SNN computational functions is presented. TaO x ‐based electrochemical reactions and PDVT‐10/N2200‐based bulk heterojunctions are used to realize spike coding and voltage coding, respectively. Notably, the device exhibits remarkable efficiency, consuming a mere 0.84 nJ of energy consumption for a single multiply accumulate (MAC) operation with excellent linearity. Moreover, the device can be switched to spiking neuron and self‐activation neuron by simply changing the programming without auxiliary circuits. Finally, the VHNT‐based artificial spiking neural network (ASNN) fusion simulation architecture is demonstrated, achieving 95% accuracy for Canadian‐Institute‐For‐Advanced‐ResearchResearch‐10 (CIFARResearch‐10) dataset while significantly enhancing training speed and efficiency. This work proposes a novel device strategy for developing high‐performance, low‐power, and environmentally adaptive AGI.
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 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.000 |
| 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 it