From Memristive Materials to Neural Networks
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
The information technologies have been increasing exponentially following Moore's law over the past decades. This has fundamentally changed the ways of work and life. However, further improving data process efficiency is facing great challenges because of physical and architectural limitations. More powerful computational methodologies are crucial to fulfill the technology gap in the post-Moore's law period. The memristor exhibits promising prospects in information storage, high-performance computing, and artificial intelligence. Since the memristor was theoretically predicted by L. O. Chua in 1971 and experimentally confirmed by HP Laboratories in 2008, it has attracted great attention from worldwide researchers. The intrinsic properties of memristors, such as simple structure, low power consumption, compatibility with the complementary metal oxide-semiconductor (CMOS) process, and dual functionalities of the data storage and computation, demonstrate great prospects in many applications. In this review, we cover the memristor-relevant computing technologies, from basic materials to in-memory computing and future prospects. First, the materials and mechanisms in the memristor are discussed. Then, we present the development of the memristor in the domains of the synapse simulating, in-memory logic computing, deep neural networks (DNNs) and spiking neural networks (SNNs). Finally, the existent technology challenges and outlook of the state-of-art applications are proposed.
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