The diamond mesh, a phase-error- and loss-tolerant field-programmable MZI-based optical processor for optical neural networks
Bibliographic record
Abstract
This paper presents the performance analysis of a phase error- and loss-tolerant multiport field-programmable MZI-based structure for optical neural networks (ONNs). Compared to the triangular (Reck) mesh, our proposed diamond mesh makes use of a larger number of MZIs, leading to a symmetric topology and adding additional degrees of freedom for the weight matrix optimization in the backpropagation process. Furthermore, the additional MZIs enable the diamond mesh to optimally eliminate the excess light intensity that degrades the performance of the ONNs through the tapered out waveguides. Our results show that the diamond topology is more robust to the inevitable imperfections in practice, i.e., insertion loss of the constituent MZIs and the phase errors. This robustness allows for better classification accuracy in the presence of experimental imperfections. The practical performance and the scalability of the two structures implementing different sizes of optical neural networks are analytically compared. The obtained results confirm that the diamond mesh is more error- and loss-tolerant in classifying the data samples in different sizes of ONNs.
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.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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".