Retraction Notice: FoNet: A Memory-efficient Fourier-based Orthogonal Network for Object Recognition
Bibliographic record
Abstract
The memory consumption of most Convolutional Neural Network (CNN) architectures grows rapidly with the increasing depth of the network, which is a major constraint for efficient network training and inference on modern GPUs with limited memory. Several studies show that the feature maps (as generated after the convolutional layers) are the big bottleneck in this memory problem. Often, these feature maps mimic natural photographs in the sense that their energy is concentrated in the spectral domain. In this paper, we propose a Fourier-based Orthogonal Network (FoNet) that incorporates orthogonal representations and performs both the convolution and the activation operations in the spectral domain to achieve memory reduction. The performance of our FoNet is evaluated on four standard object recognition benchmarks (i.e., MNIST, CIFAR10, SVHN, and ImageNet), and compared with four state-of-the-art implementations (i.e., LeNet, AlexNet, VGG, and DenseNet). Encouragingly, FoNet is able to reduce memory consumption by about 60% without significant loss of performance for all tested network architectures.
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
Direct model labels (unvalidated)
Per-model category and study-design labels from the labeling rounds. They are machine output, unvalidated, and the disagreement between models ships as data. No study design here is MEDLINE-validated yet.
| Model arm | Categories | Study design | Confidence |
|---|---|---|---|
| gemma | Research integrity Domain: not available · Genre: Other About the Canadian research system: no · About a Canadian topic: no | Not applicable | high |
| gpt | Research integrity Domain: not available · Genre: Editorial About the Canadian research system: no · About a Canadian topic: no | Not applicable | high |
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.003 | 0.026 |
| Meta-epidemiology (narrow) | 0.002 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.003 | 0.001 |
| Research integrity | 0.005 | 0.010 |
| Insufficient payload (model declined to judge) | 0.028 | 0.021 |
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, unvalidatedLabeled directly by 2 models reading the full record.
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".