An Open-Source Artificial Neural Network Model for Polarization-Insensitive Silicon-on-Insulator Subwavelength Grating Couplers
Bibliographic record
Abstract
We present an open-source deep artificial neural network (ANN) model for the accelerated design of polarization-insensitive subwavelength grating (SWG) couplers on the silicon-on-insulator platform. Our model can optimize SWG-based grating couplers for a single fundamental-order polarization, or both, by splitting them counter-directionally at the grating level. Alternating, SWG sections are adopted to reduce the reflections (loss) of standard, single-etch devices-further accelerating the design time by eliminating the need to process a second etch. The model of this device is trained by a dense uniform dataset of finite-difference time-domain (FDTD) optical simulations. Our approach requires the FDTD simulations to be made up front, where the resulting ANN model is made openly available for the rapid, software-free design of future standard photonic devices, which may require slightly different design parameters (e.g., fiber angle, center wavelength, and polarization) for their specific application. By transforming the nonlinear input-output relationship of the device into a matrix of learned weights, a set of simple linear algebraic and nonlinear activation calculations can be made to predict the device outputs 1830 times faster than numerical simulations, within 93.2% accuracy of the simulations.
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.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".