Photonic Perceptron Based on a Kerr Microcomb for High‐Speed, Scalable, Optical Neural Networks
Bibliographic record
Abstract
Abstract Optical artificial neural networks (ONNs)—analog computing hardware tailored for machine learning—have significant potential for achieving ultra‐high computing speed and energy efficiency. A new approach to architectures for ONNs based on integrated Kerr microcomb sources that is programmable, highly scalable, and capable of reaching ultra‐high speeds is proposed here. The building block of the ONN—a single neuron perceptron—is experimentally demonstrated that reaches a high single‐unit throughput speed of 11.9 Giga‐FLOPS at 8 bits per FLOP, corresponding to 95.2 Gbps, achieved by mapping synapses onto 49 wavelengths of a microcomb. The perceptron is tested on simple standard benchmark datasets—handwritten‐digit recognition and cancer‐cell detection—achieving over 90% and 85% accuracy, respectively. This performance is a direct result of the record low wavelength spacing (49 GHz) for a coherent integrated microcomb source, which results in an unprecedented number of wavelengths for neuromorphic optics. Finally, an approach to scaling the perceptron to a deep learning network is proposed using the same single microcomb device and standard off‐the‐shelf telecommunications technology, for high‐throughput operation involving full matrix multiplication for applications such as real‐time massive data processing for unmanned vehicles and aircraft tracking.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| 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.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 source (direct Gemma or distilled Codex), 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".