i-DARTS: Improving differentiable architecture search by using graph and few-shot learning
Bibliographic record
Abstract
On the CIFAR-10 (Canadian Institute for Advanced Research-10), ImageNet, and Penn Treebank datasets, Neural Architecture Search (NAS) algorithms obtained better results by computerizing the process of architectural design on the CIFAR-10, ImageNet, and Penn Treebank datasets. Even though the search time has been simplified, search algorithms count on performance prediction or controllers. When used on a new task with a fresh dataset, this may necessitate optimal structuring. The problem of architecture search is not solved because this is done by hand. Using continuous relaxation and gradient descent methods, Differentiable Architecture Search (DARTS) [1] avoids this issue. There are, however, plenty of intriguing methods to make DARTS better. In this paper, we first split the DARTS’s supernet into three (03) sub-supernets and applied neural message passing so that each node in the graph has information from other nodes. The three (03) sub-supernets by using gradient descent to find the best graph represent the whole search space. By adding parameter sharing and transfer learning, our method enhances the final accuracy of one-shot-based DARTS systems consistently. On CIFAR-10, it achieves 98.25% test set accuracy, according to the results.
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.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.003 | 0.001 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.004 | 0.002 |
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".