Design of a silicon Mach–Zehnder modulator via deep learning and evolutionary algorithms
Bibliographic record
Abstract
As an essential block in optical communication systems, silicon (Si) Mach-Zehnder modulators (MZMs) are approaching the limits of possible performance for high-speed applications. However, due to a large number of design parameters and the complex simulation of these devices, achieving high-performance configuration employing conventional optimization methods result in prohibitively long times and use of resources. Here, we propose a design methodology based on artificial neural networks and heuristic optimization that significantly reduces the complexity of the optimization process. First, we implemented a deep neural network model to substitute the 3D electromagnetic simulation of a Si-based MZM, whereas subsequently, this model is used to estimate the figure of merit within the heuristic optimizer, which, in our case, is the differential evolution algorithm. By applying this method to CMOS-compatible MZMs, we find new optimized configurations in terms of electro-optical bandwidth, insertion loss, and half-wave voltage. In particular, we achieve configurations of MZMs with a [Formula: see text] bandwidth and a driving voltage of [Formula: see text], or, alternatively, [Formula: see text] with a driving voltage of [Formula: see text]. Furthermore, the faster simulation allowed optimizing MZM subject to different constraints, which permits us to explore the possible performance boundary of this type of MZMs.
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.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| 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".