Development of a Fixed-Point Deep Neural Networks Library in C++ and its use to validate Photonic Neuromorphic Accelerators
Bibliographic record
Abstract
In recent years, deep neural networks (DNN) have become one of the most powerful tools in machine learning, achieving unprecedented milestones in various fields such as computer vision, genomic interpretation, robotics and autonomous driving. However, the energy consumption and footprint for computation and data movement in DNN is now becoming a major limiting factor impacting DNN scalability. Regarding computation, the energy consumption is dominated by multiply accumulate operations, which constitute the linear part of DNN computations. In this context, photonic solutions are being investigated as an energy-efficient alternative to electronics-based DNNs because of the inherent parallelism, the high processing rate with low latency, and the possibility to exploit passive optical elements. However, the drawback of this approach is the reduced precision that can be achieved by such analog photonic engines. In this context, reduced-precision goes beyond classical 16-bit half-precision floats up to very small values, i.e., <=8 bits or even 2 bits. Recent breakthrough in the field demonstrated a nearly negligible degradation on DNN accuracy when using these novel precision-scalable architectures, where the bit resolution can be adjusted to trade off the neural network inference accuracy with speed and power consumption. The aim of this thesis is to develop a C++ library for DNNs using a low-precision fixed-point format and then to develop a model to reduce the gap between the software implementation on electronic computers and the photonic accelerators that we are currently able to implement in hardware.
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.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 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".