TOPS‐Speed Reconfigurable Photonic Transposed Convolution Accelerator for Generative Tasks
Bibliographic record
Abstract
ABSTRACT Transposed convolution, crucial in large‐parameter generative models ranging from content creation to autonomous driving, imposes substantial demands on GPU memory and energy consumption in electronic processors. Electronic processors, fundamentally limited by the von Neumann architecture and further hindered by silicon‐based quantum tunneling effects, struggle to meet the stringent real‐time requirements of modern generative workloads. In contrast, optical computing—exploiting ultra‐wide bandwidth and ultra‐low power consumption—offers a promising alternative for high‐speed transposed convolution in next‐generation AI. Here, we introduce a high‐speed and reconfigurable photonic transposed convolution accelerator (PTCA). By interleaving wavelength, temporal, and spatial dimensions and leveraging an integrated Kerr microcomb for data‐dimension expansion, the PTCA achieves tera operations per second (TOPS) with 100% bit efficiency. Experiments demonstrate a processing speed of 1.026 TOPS, making it, to the best of our knowledge, the fastest reconfigurable PTCA to date. In Fashion‐MNIST reconstruction tasks, this system achieves a mean squared error (MSE) of 0.0062 without any additional post‐processing by electronic fully connected layers. Our work thus establishes a high‐speed, reconfigurable photonic paradigm for accelerating future generative AI.
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.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.007 | 0.001 |
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".