Methods › General › Hyperparameter Search › Random Search
Random Search
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
Random Search replaces the exhaustive enumeration of all combinations by selecting them randomly. This can be simply applied to the discrete setting described above, but also generalizes to continuous and mixed spaces. It can outperform Grid search, especially when only a small number of hyperparameters affects the final performance of the machine learning algorithm. In this case, the optimization problem is said to have a low intrinsic dimensionality. Random Search is also embarrassingly parallel, and additionally allows the inclusion of prior knowledge by specifying the distribution from which to sample.
Extracted from Wikipedia
Source Paper
Image Source: BERGSTRA AND BENGIO
Papers archive 2025-07-28
30 shown of 256, newest first. Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code; it is per sample and not a correctness claim.
-
Regular Tree Search for Simulation Optimization 21 Jun 2025 · 0 repositories · arXiv:2506.17696
-
Learning Extrapolative Sequence Transformations from Markov Chains 26 May 2025 · 1 repository · arXiv:2505.20251
-
Few-Shot Test-Time Optimization Without Retraining for Semiconductor Recipe Generation and Beyond 21 May 2025 · 0 repositories · arXiv:2505.16060
-
OPO: Making Decision-Focused Data Acquisition Decisions 21 Apr 2025 · 0 repositories · arXiv:2504.15062
-
A Case Study on Evaluating Genetic Algorithms for Early Building Design Optimization: Comparison with Random and Grid Searches 10 Apr 2025 · 0 repositories · arXiv:2504.08106
-
Data Mixture Optimization: A Multi-fidelity Multi-scale Bayesian Framework 26 Mar 2025 · 1 repository · arXiv:2503.21023
-
A stochastic gradient descent algorithm with random search directions 25 Mar 2025 · 0 repositories · arXiv:2503.19942
-
Learning Linear Block Codes with Gradient Quantization 20 Mar 2025 · 0 repositories · arXiv:2503.16169
-
Multi-Target Radar Search and Track Using Sequence-Capable Deep Reinforcement Learning 19 Feb 2025 · 0 repositories · arXiv:2502.13584
-
T-SCEND: Test-time Scalable MCTS-enhanced Diffusion Model 4 Feb 2025 · 1 repository · arXiv:2502.01989Syntology ran 19 of 34 samples · 15 unverified
-
The M-factor: A Novel Metric for Evaluating Neural Architecture Search in Resource-Constrained Environments 29 Jan 2025 · 0 repositories · arXiv:2501.17361
-
Multi-Objective Reinforcement Learning for Power Grid Topology Control 27 Jan 2025 · 1 repository · arXiv:2502.00040
-
Sample complexity of data-driven tuning of model hyperparameters in neural networks with structured parameter-dependent dual function 23 Jan 2025 · 0 repositories · arXiv:2501.13734
-
How Toxic Can You Get? Search-based Toxicity Testing for Large Language Models 3 Jan 2025 · 0 repositories · arXiv:2501.01741
-
HyperQ-Opt: Q-learning for Hyperparameter Optimization 23 Dec 2024 · 0 repositories · arXiv:2412.17765
-
Stalling in Space: Attractor Analysis for any Algorithm 20 Dec 2024 · 0 repositories · arXiv:2412.15848
-
Generating Critical Scenarios for Testing Automated Driving Systems 3 Dec 2024 · 0 repositories · arXiv:2412.02574
-
LAMBDA: Covering the Multimodal Critical Scenarios for Automated Driving Systems by Search Space Quantization 30 Nov 2024 · 0 repositories · arXiv:2412.00517
-
Randomized-Grid Search for Hyperparameter Tuning in Decision Tree Model to Improve Performance of Cardiovascular Disease Classification 27 Nov 2024 · 0 repositories · arXiv:2411.18234
-
Testing the Efficacy of Hyperparameter Optimization Algorithms in Short-Term Load Forecasting 19 Oct 2024 · 0 repositories · arXiv:2410.15047
-
Can Search-Based Testing with Pareto Optimization Effectively Cover Failure-Revealing Test Inputs? 15 Oct 2024 · 1 repository · arXiv:2410.11769
-
Automating the Design of Multi-band Microstrip Antennas via Uniform Cross-Entropy Optimization 3 Oct 2024 · 0 repositories · arXiv:2410.02474
-
Automated Discovery of Pairwise Interactions from Unstructured Data 11 Sep 2024 · 0 repositories · arXiv:2409.07594
-
A Comparative Study of Hyperparameter Tuning Methods 29 Aug 2024 · 0 repositories · arXiv:2408.16425
-
Sequential Resource Trading Using Comparison-Based Gradient Estimation 20 Aug 2024 · 1 repository · arXiv:2408.11186
-
A Single Channel-Based Neonatal Sleep-Wake Classification using Hjorth Parameters and Improved Gradient Boosting 15 Aug 2024 · 0 repositories · arXiv:2408.07925
-
Prompt Recovery for Image Generation Models: A Comparative Study of Discrete Optimizers 12 Aug 2024 · 0 repositories · arXiv:2408.06502
-
G-PCGRL: Procedural Graph Data Generation via Reinforcement Learning 15 Jul 2024 · 1 repository · arXiv:2407.10483
-
Universal Multi-view Black-box Attack against Object Detectors via Layout Optimization 9 Jul 2024 · 0 repositories · arXiv:2407.06688
-
LSTM-ARIMA as a Hybrid Approach in Algorithmic Investment Strategies 26 Jun 2024 · 0 repositories · arXiv:2406.18206
Tasks archive 2025-07-28
20 shown of 193 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
Usage over time archive 2025-07-28
Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).
Categories archive 2025-07-28
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections