REVIEW 8 cited by
Grid Search, Random Search, Genetic Algorithm: A Big Comparison for NAS
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
In this paper, we compare the three most popular algorithms for hyperparameter optimization (Grid Search, Random Search, and Genetic Algorithm) and attempt to use them for neural architecture search (NAS). We use these algorithms for building a convolutional neural network (search architecture). Experimental results on CIFAR-10 dataset further demonstrate the performance difference between compared algorithms. The comparison results are based on the execution time of the above algorithms and accuracy of the proposed models.
Forward citations
Cited by 8 Pith papers
-
Exploiting Structural Properties for Efficient Constraint-Aware HNSW Hyperparameter Tuning
CHAT uses HNSW-specific monotonic and unimodal structure plus resource surrogates to tune M, efc, and efs under constraints, beating black-box tuners by up to 45% throughput or 11% recall and up to 44× faster convergence.
-
State Backdoor: Towards Stealthy Real-world Poisoning Attack on Vision-Language-Action Model in State Space
A backdoor attack on vision-language-action robot policies uses the arm's initial joint configuration as the trigger, achieving >90% triggered failure with only small clean-task degradation.
-
Gaussian Process Methods for Very Large Astrometric Data Sets
A scalable two-gaussian-process regression recovers smooth vertical profiles of mean velocity and velocity dispersion from roughly 800,000 Gaia stars, revealing mid-plane-asymmetric dispersion features interpreted as ...
-
AIMatDesign: Knowledge-Augmented Reinforcement Learning for Inverse Materials Design under Data Scarcity
AIMatDesign uses difference-based data augmentation, LLM-guided model refinement, and knowledge-based rewards to propose Zr-based bulk metallic glasses, with one experimentally validated alloy reaching 1.7 GPa yield s...
-
KEENHash: Hashing Programs into Function-Aware Embeddings for Large-Scale Binary Code Similarity Analysis
KEENHash hashes binaries into 8KB function-aware embeddings via LLM function embeddings, K-Means clustering, and Feature Hashing, enabling scalable program-level binary similarity analysis.
-
A Quality-Guided Mixture of Score-Fusion Experts Framework for Human Recognition
Quality-weighted mixture-of-experts score fusion improves whole-body biometric recognition over fixed and learned baselines across face, gait, and body modalities.
-
Toward Generalizable Cognitive Impairment Detection with Speech-Based Multimodal Large Language Models
A multimodal LLM pipeline (Qwen audio + Qwen text embeddings, concatenated and classified) reaches 92.4% accuracy on a combined ADReSS20/ADReSSo21 test set, but the evaluation does not justify state-of-the-art or cros...
-
Interpretable Low-Dimensional Modeling of Spatiotemporal Agent States for Decision Making in Football Tactics
A low-dimensional, interpretable XGBoost model predicts pass success in football with F1 0.56, and identifies the distance between ball and receiver as the most important feature.
Discussion (0). Continue with ORCID to comment.