Photonic Compute-in-Wire: Remotely Driven Photonic Deep Neural Network with a Single Nonlinear Loop
Bibliographic record
Abstract
The development of deep learning has motivated the advancement of unconventional computing that leverages analog physical systems such as analog electronics, spintronics, and photonics. These technologies have also led to the development of unique computational paradigms harnessing the features of analog devices, including compute-in-memory for nonvolatile devices and compute-in-sensor for analog electronics. What, then, are the computational paradigms that can exploit the characteristics of photonics? Optical computing has emerged as a promising candidate as it offers low-latency and low-power computation by utilizing the inherent parallelism of light. Additionally, the low-loss medium of optical fibers allows for the transmission of information over long distances. In this paper, we experimentally demonstrate a remotely driven optical neural network that combines these advantageous features. Namely, computations can be executed with data transfer over a photonic network, which provides a computational paradigm named photonic compute-in-wire. As a demonstration, we constructed an optoelectronic benchtop with a 20-km fiber access line. To facilitate the implementation of this concept, we extended the folded-in-time deep neural network (FiT-DNN) approach, which utilizes a single delay line with a nonlinear device, a dispersive element, and a modulator. This allows the insertion of a photonic DNN within a single transmission line. The parameters of our constructed photonic FiT-DNN were trained by using a digital twin of nonlinear optoelectronic dynamics. Through our benchmark experiments, we confirmed good accuracy for image recognition tasks. Our approach broadens the opportunities to utilize optical computation from local edge computing to in-network computing for low-latency and low-energy computation.
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 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.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".