Scalable Networks of Neuromorphic Photonic Integrated Circuits
Bibliographic record
Abstract
Neuromorphic photonic integrated circuits over silicon photonic platform have recently made significant progress. Photonic neural networks with a small number of neurons have demonstrated important applications in high-bandwidth, low latency machine learning (ML) type signal processing applications. Naturally an important topic is to investigate building a large scale photonic neural networks with high flexibility and scalability to potentially support ML type applications involving high-speed processing of a high volume of data. In this paper we revisited the architecture of microring resonator (MRR) -based non-spiking and spiking photonic neurons, and photonic neural networks using broadcast-and-weight scheme. We illustrate expanded neural network topologies by cascading photonic broadcast loops, to achieve scalable neural network scalability with a fixed number of wavelengths. Furthermore, we propose the adoption of wavelength selective switch (WSS) inside the broadcasting loop for wavelength-switched photonic neural network (WS-PNN). The WS-PNN architecture will find new applications of using off-chip WSS switches to interconnect groups of photonic neurons. The interconnection of WS-PNN can achieve unprecedented scalability of photonic neural networks while supporting a versatile selection of mixture of feedforward and recurrent neural network topologies.
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.001 |
| 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.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".