{"url":"/method/random-search","slug":"random-search","name":"Random Search","full_name":"Random Search","full_name_withheld":false,"description_markdown":"**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.\r\n\r\n\r\nExtracted from [Wikipedia](https://en.wikipedia.org/wiki/Hyperparameter_optimization#Random_search)\r\n\r\nSource [Paper](https://dl.acm.org/doi/10.5555/2188385.2188395)\r\n\r\nImage Source: [BERGSTRA AND BENGIO](https://dl.acm.org/doi/pdf/10.5555/2188385.2188395)","description_state":"present","introduced_year":null,"introduced_by":{"title":null,"paper":null,"first_author":null,"n_authors":0,"url_abs":null,"archive_paper_url":null},"source":{"url":null,"title":null,"url_on_a_paper_host":false},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Hyperparameter Search","url":"/methods/category/hyperparameter-search","pwc_aliases":[]}],"n_papers_tagged":256,"archive_num_papers":256,"papers_newest_first":[{"paper":null,"title":"Regular Tree Search for Simulation Optimization","date":"2025-06-21","arxiv_id":"2506.17696","n_code_links":0,"syntology":null},{"paper":"/paper/learning-extrapolative-sequence","title":"Learning Extrapolative Sequence Transformations from Markov Chains","date":"2025-05-26","arxiv_id":"2505.20251","n_code_links":1,"syntology":null},{"paper":null,"title":"Few-Shot Test-Time Optimization Without Retraining for Semiconductor Recipe Generation and Beyond","date":"2025-05-21","arxiv_id":"2505.16060","n_code_links":0,"syntology":null},{"paper":null,"title":"OPO: Making Decision-Focused Data Acquisition Decisions","date":"2025-04-21","arxiv_id":"2504.15062","n_code_links":0,"syntology":null},{"paper":null,"title":"A Case Study on Evaluating Genetic Algorithms for Early Building Design Optimization: Comparison with Random and Grid Searches","date":"2025-04-10","arxiv_id":"2504.08106","n_code_links":0,"syntology":null},{"paper":"/paper/data-mixture-optimization-a-multi-fidelity","title":"Data Mixture Optimization: A Multi-fidelity Multi-scale Bayesian Framework","date":"2025-03-26","arxiv_id":"2503.21023","n_code_links":1,"syntology":null},{"paper":null,"title":"A stochastic gradient descent algorithm with random search directions","date":"2025-03-25","arxiv_id":"2503.19942","n_code_links":0,"syntology":null},{"paper":null,"title":"Learning Linear Block Codes with Gradient Quantization","date":"2025-03-20","arxiv_id":"2503.16169","n_code_links":0,"syntology":null},{"paper":null,"title":"Multi-Target Radar Search and Track Using Sequence-Capable Deep Reinforcement Learning","date":"2025-02-19","arxiv_id":"2502.13584","n_code_links":0,"syntology":null},{"paper":"/paper/t-scend-test-time-scalable-mcts-enhanced","title":"T-SCEND: Test-time Scalable MCTS-enhanced Diffusion Model","date":"2025-02-04","arxiv_id":"2502.01989","n_code_links":1,"syntology":{"ran":19,"of":34,"unverified":15,"pointer_only":0}},{"paper":null,"title":"The M-factor: A Novel Metric for Evaluating Neural Architecture Search in Resource-Constrained Environments","date":"2025-01-29","arxiv_id":"2501.17361","n_code_links":0,"syntology":null},{"paper":"/paper/multi-objective-reinforcement-learning-for-2","title":"Multi-Objective Reinforcement Learning for Power Grid Topology Control","date":"2025-01-27","arxiv_id":"2502.00040","n_code_links":1,"syntology":null},{"paper":null,"title":"Sample complexity of data-driven tuning of model hyperparameters in neural networks with structured parameter-dependent dual function","date":"2025-01-23","arxiv_id":"2501.13734","n_code_links":0,"syntology":null},{"paper":null,"title":"How Toxic Can You Get? Search-based Toxicity Testing for Large Language Models","date":"2025-01-03","arxiv_id":"2501.01741","n_code_links":0,"syntology":null},{"paper":null,"title":"HyperQ-Opt: Q-learning for Hyperparameter Optimization","date":"2024-12-23","arxiv_id":"2412.17765","n_code_links":0,"syntology":null},{"paper":null,"title":"Stalling in Space: Attractor Analysis for any Algorithm","date":"2024-12-20","arxiv_id":"2412.15848","n_code_links":0,"syntology":null},{"paper":null,"title":"Generating Critical Scenarios for Testing Automated Driving Systems","date":"2024-12-03","arxiv_id":"2412.02574","n_code_links":0,"syntology":null},{"paper":null,"title":"LAMBDA: Covering the Multimodal Critical Scenarios for Automated Driving Systems by Search Space Quantization","date":"2024-11-30","arxiv_id":"2412.00517","n_code_links":0,"syntology":null},{"paper":null,"title":"Randomized-Grid Search for Hyperparameter Tuning in Decision Tree Model to Improve Performance of Cardiovascular Disease Classification","date":"2024-11-27","arxiv_id":"2411.18234","n_code_links":0,"syntology":null},{"paper":null,"title":"Testing the Efficacy of Hyperparameter Optimization Algorithms in Short-Term Load Forecasting","date":"2024-10-19","arxiv_id":"2410.15047","n_code_links":0,"syntology":null},{"paper":"/paper/can-search-based-testing-with-pareto","title":"Can Search-Based Testing with Pareto Optimization Effectively Cover Failure-Revealing Test Inputs?","date":"2024-10-15","arxiv_id":"2410.11769","n_code_links":1,"syntology":null},{"paper":null,"title":"Automating the Design of Multi-band Microstrip Antennas via Uniform Cross-Entropy Optimization","date":"2024-10-03","arxiv_id":"2410.02474","n_code_links":0,"syntology":null},{"paper":null,"title":"Automated Discovery of Pairwise Interactions from Unstructured Data","date":"2024-09-11","arxiv_id":"2409.07594","n_code_links":0,"syntology":null},{"paper":null,"title":"A Comparative Study of Hyperparameter Tuning Methods","date":"2024-08-29","arxiv_id":"2408.16425","n_code_links":0,"syntology":null},{"paper":"/paper/autonomous-negotiation-using-comparison-based","title":"Sequential Resource Trading Using Comparison-Based Gradient Estimation","date":"2024-08-20","arxiv_id":"2408.11186","n_code_links":1,"syntology":null},{"paper":null,"title":"A Single Channel-Based Neonatal Sleep-Wake Classification using Hjorth Parameters and Improved Gradient Boosting","date":"2024-08-15","arxiv_id":"2408.07925","n_code_links":0,"syntology":null},{"paper":null,"title":"Prompt Recovery for Image Generation Models: A Comparative Study of Discrete Optimizers","date":"2024-08-12","arxiv_id":"2408.06502","n_code_links":0,"syntology":null},{"paper":"/paper/g-pcgrl-procedural-graph-data-generation-via","title":"G-PCGRL: Procedural Graph Data Generation via Reinforcement Learning","date":"2024-07-15","arxiv_id":"2407.10483","n_code_links":1,"syntology":null},{"paper":null,"title":"Universal Multi-view Black-box Attack against Object Detectors via Layout Optimization","date":"2024-07-09","arxiv_id":"2407.06688","n_code_links":0,"syntology":null},{"paper":null,"title":"LSTM-ARIMA as a Hybrid Approach in Algorithmic Investment Strategies","date":"2024-06-26","arxiv_id":"2406.18206","n_code_links":0,"syntology":null}],"papers_shown":30,"tasks":[{"task":"/task/bayesian-optimization","name":"Bayesian Optimization","papers":52},{"task":"/task/hyperparameter-optimization","name":"Hyperparameter Optimization","papers":38},{"task":"/task/architecture-search","name":"Neural Architecture Search","papers":30},{"task":"/task/reinforcement-learning","name":"Reinforcement Learning","papers":29},{"task":"/task/reinforcement-learning-1","name":"Reinforcement Learning (RL)","papers":28},{"task":"/task/reinforcement-learning-2","name":"reinforcement-learning","papers":23},{"task":"/task/machine-learning","name":"BIG-bench Machine Learning","papers":20},{"task":"/task/deep-reinforcement-learning","name":"Deep Reinforcement Learning","papers":11},{"task":"/task/automl","name":"AutoML","papers":10},{"task":"/task/image-classification","name":"Image Classification","papers":9},{"task":"/task/time-series-1","name":"Time Series","papers":8},{"task":"/task/image-classification","name":"image-classification","papers":8},{"task":"/task/regression-1","name":"regression","papers":8},{"task":"/task/evolutionary-algorithms","name":"Evolutionary Algorithms","papers":7},{"task":"/task/classification","name":"General Classification","papers":7},{"task":"/task/time-series","name":"Time Series Analysis","papers":6},{"task":"/task/continuous-control","name":"Continuous Control","papers":5},{"task":"/task/decision-making","name":"Decision Making","papers":5},{"task":"/task/deep-learning","name":"Deep Learning","papers":5},{"task":"/task/q-learning","name":"Q-Learning","papers":5}],"tasks_shown":20,"n_tasks":193,"usage_by_year":[{"year":"2011","papers":1},{"year":"2012","papers":1},{"year":"2014","papers":2},{"year":"2015","papers":1},{"year":"2016","papers":2},{"year":"2017","papers":10},{"year":"2018","papers":14},{"year":"2019","papers":33},{"year":"2020","papers":44},{"year":"2021","papers":39},{"year":"2022","papers":26},{"year":"2023","papers":36},{"year":"2024","papers":33},{"year":"2025","papers":14}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/random-search"},"syntology_read_at":"2026-09-24T18:15:14+00:00"}