{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"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,"slug":"regular-tree-search-for-simulation","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","slug":"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,"slug":"few-shot-test-time-optimization-without","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,"slug":"opo-making-decision-focused-data-acquisition","title":"OPO: Making Decision-Focused Data Acquisition Decisions","date":"2025-04-21","arxiv_id":"2504.15062","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-case-study-on-evaluating-genetic-algorithms","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","slug":"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,"slug":"a-stochastic-gradient-descent-algorithm-with","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,"slug":"learning-linear-block-codes-with-gradient","title":"Learning Linear Block Codes with Gradient Quantization","date":"2025-03-20","arxiv_id":"2503.16169","n_code_links":0,"syntology":null},{"paper":null,"slug":"multi-target-radar-search-and-track-using","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","slug":"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":26,"of":34,"n_ran_checked":19,"n_instrument":7,"unverified":8,"pointer_only":0,"phrase":"26 ran (of which 0 constructed an object rather than computing a result; 19 with no instrument failure: 2 honoured, 3 violated, 14 with no contract checked; 7 where Syntology's instrument failed) · 8 unverified","official":{"repos":["ai4science-westlakeu/t_scend"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":1,"ran_from_kinds":["found_in_text","official"]}}},{"paper":null,"slug":"the-m-factor-a-novel-metric-for-evaluating","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","slug":"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,"slug":"sample-complexity-of-data-driven-tuning-of","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,"slug":"how-toxic-can-you-get-search-based-toxicity","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,"slug":"hyperq-opt-q-learning-for-hyperparameter","title":"HyperQ-Opt: Q-learning for Hyperparameter Optimization","date":"2024-12-23","arxiv_id":"2412.17765","n_code_links":0,"syntology":null},{"paper":null,"slug":"stalling-in-space-attractor-analysis-for-any","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,"slug":"generating-critical-scenarios-for-testing","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,"slug":"lambda-covering-the-multimodal-critical","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,"slug":"randomized-grid-search-for-hyperparameter","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,"slug":"testing-the-efficacy-of-hyperparameter","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","slug":"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,"slug":"automating-the-design-of-multi-band","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,"slug":"automated-discovery-of-pairwise-interactions","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,"slug":"a-comparative-study-of-hyperparameter-tuning","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","slug":"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,"slug":"a-single-channel-based-neonatal-sleep-wake","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,"slug":"prompt-recovery-for-image-generation-models-a","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","slug":"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,"slug":"universal-multi-view-black-box-attack-against","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,"slug":"lstm-arima-as-a-hybrid-approach-in","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},{"paper":null,"slug":"teach-better-or-show-smarter-on-instructions","title":"Teach Better or Show Smarter? On Instructions and Exemplars in Automatic Prompt Optimization","date":"2024-06-22","arxiv_id":"2406.15708","n_code_links":0,"syntology":null},{"paper":"/paper/improved-few-shot-jailbreaking-can-circumvent","slug":"improved-few-shot-jailbreaking-can-circumvent","title":"Improved Few-Shot Jailbreaking Can Circumvent Aligned Language Models and Their Defenses","date":"2024-06-03","arxiv_id":"2406.01288","n_code_links":1,"syntology":{"ran":6,"of":11,"n_ran_checked":2,"n_instrument":4,"unverified":5,"pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 5 unverified","official":{"repos":["sail-sg/i-fsj"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]}}},{"paper":"/paper/discovering-physics-informed-neural-networks","slug":"discovering-physics-informed-neural-networks","title":"Discovering Physics-Informed Neural Networks Model for Solving Partial Differential Equations through Evolutionary Computation","date":"2024-05-18","arxiv_id":"2405.11208","n_code_links":1,"syntology":null},{"paper":"/paper/don-t-waste-your-time-early-stopping-cross","slug":"don-t-waste-your-time-early-stopping-cross","title":"Don't Waste Your Time: Early Stopping Cross-Validation","date":"2024-05-06","arxiv_id":"2405.03389","n_code_links":1,"syntology":{"ran":6,"of":6,"n_ran_checked":2,"n_instrument":4,"unverified":0,"pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","official":{"repos":["automl/dontwasteyourtime-early-stopping"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/boosting-jailbreak-attack-with-momentum","slug":"boosting-jailbreak-attack-with-momentum","title":"Boosting Jailbreak Attack with Momentum","date":"2024-05-02","arxiv_id":"2405.01229","n_code_links":1,"syntology":{"ran":2,"of":4,"n_ran_checked":2,"n_instrument":0,"unverified":2,"pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["weizeming/momentum-attack-llm"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"the-inefficiency-of-genetic-programming-for","title":"The Inefficiency of Genetic Programming for Symbolic Regression -- Extended Version","date":"2024-04-26","arxiv_id":"2404.17292","n_code_links":0,"syntology":null},{"paper":null,"slug":"depth-estimation-using-weighted-loss-and","title":"Depth Estimation using Weighted-loss and Transfer Learning","date":"2024-04-11","arxiv_id":"2404.07686","n_code_links":0,"syntology":null},{"paper":"/paper/jailbreaking-leading-safety-aligned-llms-with","slug":"jailbreaking-leading-safety-aligned-llms-with","title":"Jailbreaking Leading Safety-Aligned LLMs with Simple Adaptive Attacks","date":"2024-04-02","arxiv_id":"2404.02151","n_code_links":1,"syntology":{"ran":8,"of":8,"n_ran_checked":6,"n_instrument":2,"unverified":0,"pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 1 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["tml-epfl/llm-adaptive-attacks"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"random-search-as-a-baseline-for-sparse-neural","title":"Random Search as a Baseline for Sparse Neural Network Architecture Search","date":"2024-03-13","arxiv_id":"2403.08265","n_code_links":0,"syntology":null},{"paper":null,"slug":"large-language-models-as-evolution-strategies","title":"Large Language Models As Evolution Strategies","date":"2024-02-28","arxiv_id":"2402.18381","n_code_links":0,"syntology":null},{"paper":null,"slug":"design-implementation-and-analysis-of-a","title":"Design, Implementation and Analysis of a Compressed Sensing Photoacoustic Projection Imaging System","date":"2024-02-24","arxiv_id":"2402.15750","n_code_links":0,"syntology":null},{"paper":null,"slug":"advancing-low-rank-and-local-low-rank-matrix","title":"A Systematic Review of Low-Rank and Local Low-Rank Matrix Approximation in Big Data Medical Imaging","date":"2024-02-21","arxiv_id":"2402.14045","n_code_links":0,"syntology":null},{"paper":"/paper/towards-accelerating-physical-discovery-via","slug":"towards-accelerating-physical-discovery-via","title":"Towards accelerating physical discovery via non-interactive and interactive multi-fidelity Bayesian Optimization: Current challenges and future opportunities","date":"2024-02-20","arxiv_id":"2402.13402","n_code_links":1,"syntology":null},{"paper":"/paper/solving-deep-reinforcement-learning","slug":"solving-deep-reinforcement-learning","title":"Solving Deep Reinforcement Learning Tasks with Evolution Strategies and Linear Policy Networks","date":"2024-02-10","arxiv_id":"2402.06912","n_code_links":1,"syntology":null},{"paper":null,"slug":"delving-into-decision-based-black-box-attacks","title":"Delving into Decision-based Black-box Attacks on Semantic Segmentation","date":"2024-02-02","arxiv_id":"2402.01220","n_code_links":0,"syntology":null},{"paper":null,"slug":"stochastic-two-points-method-for-deep-model","title":"Stochastic Two Points Method for Deep Model Zeroth-order Optimization","date":"2024-02-02","arxiv_id":"2402.01621","n_code_links":0,"syntology":null},{"paper":null,"slug":"quantum-architecture-search-with-unsupervised","title":"Quantum Architecture Search with Unsupervised Representation Learning","date":"2024-01-21","arxiv_id":"2401.11576","n_code_links":0,"syntology":null},{"paper":"/paper/srmac-smoothed-recursive-moving-average","slug":"srmac-smoothed-recursive-moving-average","title":"SRMAC -- Smoothed Recursive Moving Average Crossover for Real-Time Systolic Peak Detection in Photoplethysmography","date":"2023-12-15","arxiv_id":"2312.10013","n_code_links":1,"syntology":null},{"paper":"/paper/using-large-language-models-for","slug":"using-large-language-models-for","title":"Using Large Language Models for Hyperparameter Optimization","date":"2023-12-07","arxiv_id":"2312.04528","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":1,"n_instrument":2,"unverified":1,"pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["michaelrzhang/llm-hyperopt"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"a-systematic-study-comparing-hyperparameter","title":"A systematic study comparing hyperparameter optimization engines on tabular data","date":"2023-11-27","arxiv_id":"2311.15854","n_code_links":0,"syntology":null},{"paper":null,"slug":"neural-snowflakes-universal-latent-graph","title":"Neural Snowflakes: Universal Latent Graph Inference via Trainable Latent Geometries","date":"2023-10-23","arxiv_id":"2310.15003","n_code_links":0,"syntology":null},{"paper":null,"slug":"lion-secretly-solves-constrained-optimization","title":"Lion Secretly Solves Constrained Optimization: As Lyapunov Predicts","date":"2023-10-09","arxiv_id":"2310.05898","n_code_links":0,"syntology":null},{"paper":null,"slug":"the-reinforce-policy-gradient-algorithm","title":"The Reinforce Policy Gradient Algorithm Revisited","date":"2023-10-08","arxiv_id":"2310.05000","n_code_links":0,"syntology":null},{"paper":"/paper/auto-fp-an-experimental-study-of-automated","slug":"auto-fp-an-experimental-study-of-automated","title":"Auto-FP: An Experimental Study of Automated Feature Preprocessing for Tabular Data","date":"2023-10-04","arxiv_id":"2310.02540","n_code_links":1,"syntology":null},{"paper":null,"slug":"fedzen-towards-superlinear-zeroth-order","title":"FedZeN: Towards superlinear zeroth-order federated learning via incremental Hessian estimation","date":"2023-09-29","arxiv_id":"2309.17174","n_code_links":0,"syntology":null},{"paper":"/paper/vulnerabilities-in-video-quality-assessment-1","slug":"vulnerabilities-in-video-quality-assessment-1","title":"Vulnerabilities in Video Quality Assessment Models: The Challenge of Adversarial Attacks","date":"2023-09-24","arxiv_id":"2309.13609","n_code_links":1,"syntology":{"ran":4,"of":4,"n_ran_checked":1,"n_instrument":3,"unverified":0,"pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","official":{"repos":["gzhu-dvl/attackvqa"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/a-control-approach-for-nonlinear-stochastic","slug":"a-control-approach-for-nonlinear-stochastic","title":"A Control Approach for Nonlinear Stochastic State Uncertain Systems with Probabilistic Safety Guarantees","date":"2023-09-15","arxiv_id":"2309.08767","n_code_links":1,"syntology":null},{"paper":null,"slug":"turn-fake-into-real-adversarial-head-turn","title":"Turn Fake into Real: Adversarial Head Turn Attacks Against Deepfake Detection","date":"2023-09-03","arxiv_id":"2309.01104","n_code_links":0,"syntology":null},{"paper":"/paper/surrogate-based-autotuning-for-randomized","slug":"surrogate-based-autotuning-for-randomized","title":"Surrogate-based Autotuning for Randomized Sketching Algorithms in Regression Problems","date":"2023-08-30","arxiv_id":"2308.15720","n_code_links":1,"syntology":null},{"paper":"/paper/paits-pretraining-and-augmentation-for","slug":"paits-pretraining-and-augmentation-for","title":"PAITS: Pretraining and Augmentation for Irregularly-Sampled Time Series","date":"2023-08-25","arxiv_id":"2308.13703","n_code_links":1,"syntology":null},{"paper":"/paper/ramseyrl-a-framework-for-intelligent-ramsey","slug":"ramseyrl-a-framework-for-intelligent-ramsey","title":"RamseyRL: A Framework for Intelligent Ramsey Number Counterexample Searching","date":"2023-08-23","arxiv_id":"2308.11943","n_code_links":1,"syntology":null},{"paper":"/paper/homopt-a-homotopy-based-hyperparameter","slug":"homopt-a-homotopy-based-hyperparameter","title":"HomOpt: A Homotopy-Based Hyperparameter Optimization Method","date":"2023-08-07","arxiv_id":"2308.03317","n_code_links":1,"syntology":null},{"paper":null,"slug":"learning-based-parameter-optimization-for-a","title":"Learning-based Parameter Optimization for a Class of Orbital Tracking Control Laws","date":"2023-08-07","arxiv_id":"2308.03633","n_code_links":0,"syntology":null},{"paper":null,"slug":"computing-star-discrepancies-with-numerical","title":"Computing Star Discrepancies with Numerical Black-Box Optimization Algorithms","date":"2023-06-29","arxiv_id":"2306.16998","n_code_links":0,"syntology":null},{"paper":null,"slug":"messy-estimation-maximum-entropy-based","title":"MESSY Estimation: Maximum-Entropy based Stochastic and Symbolic densitY Estimation","date":"2023-06-07","arxiv_id":"2306.04120","n_code_links":0,"syntology":null},{"paper":null,"slug":"potatopestnet-a-ctinceptionv3-rs-based-neural","title":"PotatoPestNet: A CTInceptionV3-RS-Based Neural Network for Accurate Identification of Potato Pests","date":"2023-05-27","arxiv_id":"2306.06206","n_code_links":0,"syntology":null},{"paper":null,"slug":"augmented-random-search-for-multi-objective","title":"Combining Multi-Objective Bayesian Optimization with Reinforcement Learning for TinyML","date":"2023-05-23","arxiv_id":"2305.14109","n_code_links":0,"syntology":null},{"paper":null,"slug":"from-random-search-to-bandit-learning-in","title":"From Random Search to Bandit Learning in Metric Measure Spaces","date":"2023-05-19","arxiv_id":"2305.11509","n_code_links":0,"syntology":null},{"paper":"/paper/time-series-classification-for-detecting","slug":"time-series-classification-for-detecting","title":"Time Series Classification for Detecting Parkinson's Disease from Wrist Motions","date":"2023-04-21","arxiv_id":"2304.11265","n_code_links":1,"syntology":null},{"paper":null,"slug":"adaptive-failure-search-using-critical-states","title":"Adaptive Failure Search Using Critical States from Domain Experts","date":"2023-04-01","arxiv_id":"2304.00365","n_code_links":0,"syntology":null},{"paper":null,"slug":"evaluating-xgboost-for-balanced-and","title":"Evaluating XGBoost for Balanced and Imbalanced Data: Application to Fraud Detection","date":"2023-03-27","arxiv_id":"2303.15218","n_code_links":0,"syntology":null},{"paper":null,"slug":"uncovering-energy-efficient-practices-in-deep","title":"Uncovering Energy-Efficient Practices in Deep Learning Training: Preliminary Steps Towards Green AI","date":"2023-03-24","arxiv_id":"2303.13972","n_code_links":0,"syntology":null},{"paper":"/paper/evolving-populations-of-diverse-rl-agents","slug":"evolving-populations-of-diverse-rl-agents","title":"Evolving Populations of Diverse RL Agents with MAP-Elites","date":"2023-03-09","arxiv_id":"2303.12803","n_code_links":1,"syntology":null},{"paper":null,"slug":"revisiting-the-effect-of-search-frictions-on","title":"Revisiting the effect of search frictions on market concentration","date":"2023-03-03","arxiv_id":"2303.01824","n_code_links":0,"syntology":null},{"paper":null,"slug":"advrain-adversarial-raindrops-to-attack","title":"AdvRain: Adversarial Raindrops to Attack Camera-based Smart Vision Systems","date":"2023-03-02","arxiv_id":"2303.01338","n_code_links":0,"syntology":null},{"paper":"/paper/genetic-algorithm-based-hyperparameter","slug":"genetic-algorithm-based-hyperparameter","title":"Genetic algorithm-based hyperparameter optimization of deep learning models for PM2.5 time-series prediction","date":"2023-03-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"towards-personalized-preprocessing-pipeline","title":"Towards Personalized Preprocessing Pipeline Search","date":"2023-02-28","arxiv_id":"2302.14329","n_code_links":0,"syntology":null},{"paper":"/paper/the-effect-of-points-dispersion-on-the-k-nn-1","slug":"the-effect-of-points-dispersion-on-the-k-nn-1","title":"The Effect of Points Dispersion on the $k$-nn Search in Random Projection Forests","date":"2023-02-25","arxiv_id":"2302.13160","n_code_links":1,"syntology":null},{"paper":"/paper/efficient-generator-of-mathematical","slug":"efficient-generator-of-mathematical","title":"Efficient Generator of Mathematical Expressions for Symbolic Regression","date":"2023-02-20","arxiv_id":"2302.09893","n_code_links":1,"syntology":null},{"paper":null,"slug":"genetic-multi-armed-bandits-a-reinforcement","title":"Genetic multi-armed bandits: a reinforcement learning approach for discrete optimization via simulation","date":"2023-02-15","arxiv_id":"2302.07695","n_code_links":0,"syntology":null},{"paper":null,"slug":"enhancing-machine-learning-model-performance","title":"Enhancing Machine Learning Model Performance with Hyper Parameter Optimization: A Comparative Study","date":"2023-02-14","arxiv_id":"2302.11406","n_code_links":0,"syntology":null},{"paper":null,"slug":"practical-differentially-private","title":"Practical Differentially Private Hyperparameter Tuning with Subsampling","date":"2023-01-27","arxiv_id":"2301.11989","n_code_links":0,"syntology":null},{"paper":"/paper/evae-evolutionary-variational-autoencoder","slug":"evae-evolutionary-variational-autoencoder","title":"eVAE: Evolutionary Variational Autoencoder","date":"2023-01-01","arxiv_id":"2301.00011","n_code_links":1,"syntology":null},{"paper":"/paper/interpretable-models-for-extrapolation-in","slug":"interpretable-models-for-extrapolation-in","title":"Interpretable models for extrapolation in scientific machine learning","date":"2022-12-16","arxiv_id":"2212.10283","n_code_links":1,"syntology":null},{"paper":"/paper/pypop7-a-pure-python-library-for-population","slug":"pypop7-a-pure-python-library-for-population","title":"PyPop7: A Pure-Python Library for Population-Based Black-Box Optimization","date":"2022-12-12","arxiv_id":"2212.05652","n_code_links":1,"syntology":null},{"paper":null,"slug":"optimizing-integrated-information-with-a","title":"Optimizing Integrated Information with a Prior Guided Random Search Algorithm","date":"2022-12-08","arxiv_id":"2212.04589","n_code_links":0,"syntology":null},{"paper":null,"slug":"graphpnas-learning-distribution-of-good","title":"GraphPNAS: Learning Distribution of Good Neural Architectures via Deep Graph Generative Models","date":"2022-11-28","arxiv_id":"2211.15155","n_code_links":0,"syntology":null},{"paper":null,"slug":"benchmark-of-bayesian-optimization-and","title":"Benchmark of Bayesian Optimization and Metaheuristics for Control Engineering Tuning Problems with Crash Constraints","date":"2022-11-04","arxiv_id":"2211.02571","n_code_links":0,"syntology":null},{"paper":"/paper/g-augment-searching-for-the-meta-structure-of","slug":"g-augment-searching-for-the-meta-structure-of","title":"G-Augment: Searching for the Meta-Structure of Data Augmentation Policies for ASR","date":"2022-10-19","arxiv_id":"2210.10879","n_code_links":0,"syntology":null},{"paper":null,"slug":"minibatch-stochastic-three-points-method-for","title":"Minibatch Stochastic Three Points Method for Unconstrained Smooth Minimization","date":"2022-09-16","arxiv_id":"2209.07883","n_code_links":0,"syntology":null},{"paper":null,"slug":"improving-sample-efficiency-in-evolutionary","title":"Improving Sample Efficiency in Evolutionary RL Using Off-Policy Ranking","date":"2022-08-22","arxiv_id":"2208.10583","n_code_links":0,"syntology":null},{"paper":null,"slug":"random-search-hyper-parameter-tuning-expected","title":"Random Search Hyper-Parameter Tuning: Expected Improvement Estimation and the Corresponding Lower Bound","date":"2022-08-17","arxiv_id":"2208.08170","n_code_links":0,"syntology":null},{"paper":null,"slug":"networked-drones-for-industrial-emergency","title":"Networked Drones for Industrial Emergency Events","date":"2022-08-01","arxiv_id":"2208.00931","n_code_links":0,"syntology":null},{"paper":null,"slug":"pi-ars-accelerating-evolution-learned-visual","title":"PI-ARS: Accelerating Evolution-Learned Visual-Locomotion with Predictive Information Representations","date":"2022-07-27","arxiv_id":"2207.13224","n_code_links":0,"syntology":null},{"paper":"/paper/autoweird-weird-translational-scoring","slug":"autoweird-weird-translational-scoring","title":"AutoWeird: Weird Translational Scoring Function Identified by Random Search","date":"2022-07-24","arxiv_id":"2207.11673","n_code_links":0,"syntology":null},{"paper":null,"slug":"bayesian-hyperparameter-optimization-for-deep","title":"Bayesian Hyperparameter Optimization for Deep Neural Network-Based Network Intrusion Detection","date":"2022-07-07","arxiv_id":"2207.09902","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-the-policy-for-mixed-electric","title":"Learning the policy for mixed electric platoon control of automated and human-driven vehicles at signalized intersection: a random search approach","date":"2022-06-24","arxiv_id":"2206.12052","n_code_links":0,"syntology":null},{"paper":null,"slug":"clustering-through-pair-interactions-in","title":"Clustering through pair interactions in swimming zooplankton","date":"2022-05-18","arxiv_id":"2205.08927","n_code_links":0,"syntology":null},{"paper":"/paper/spidernet-hybrid-differentiable-evolutionary","slug":"spidernet-hybrid-differentiable-evolutionary","title":"SpiderNet: Hybrid Differentiable-Evolutionary Architecture Search via Train-Free Metrics","date":"2022-04-20","arxiv_id":"2204.09320","n_code_links":1,"syntology":null},{"paper":null,"slug":"initialisation-and-grammar-design-in-grammar","title":"Initialisation and Grammar Design in Grammar-Guided Evolutionary Computation","date":"2022-04-15","arxiv_id":"2204.07410","n_code_links":0,"syntology":null}],"papers_shown":100,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":256,"with_a_code_link":89,"where_syntology_ran_a_sample":19,"not_listed_spam_title":0,"listed":256,"listed_where_code_ran":19,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":17,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":17,"listed_every_run_a_failure_of_syntologys_instrument":2,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":19,"papers_where_code_ran_first_page":"/method/random-search/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"archive","page":2,"of":3,"url":"/method/random-search/papers/2","json":"/method/random-search/papers/2.json","rows":100},{"order":"archive","page":3,"of":3,"url":"/method/random-search/papers/3","json":"/method/random-search/papers/3.json","rows":56},{"order":"ran","page":1,"of":1,"url":"/method/random-search/papers/ran/1","json":"/method/random-search/papers/ran/1.json","rows":19}],"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-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=Random%20Search","read_at":"2026-10-05T01:00:54+00:00","query":"Random Search","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":null,"repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'Random Search' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":["greedy random-search method","Accelerated Random Search (ARS)","Learning to Guide Random Search","Noisy-Comparison Random Search (NCRS)","Random Search Neural Networks (RSNNs)","SEArch","W-SEARCH","SEARCH-R"],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"f786f95b0a402ed4c35677575b5ca98d0de331a20a4ab35e4312267d90895542","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}