Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

4793140186 · Jun 202019922001200920172026
48 results for Hyperparameter Search

Paper proposes HCDC to improve hyperparameter search efficiency.

problem Poor generalizability of dataset condensation across different hyperparameters.
method HCDC algorithm that matches hyperparameter gradients for synthetic validation dataset.
result HCDC effectively maintains validation-performance rankings of models.

Paper proposes an efficient bandit-based algorithm for hyperparameter optimization.

problem Efficiently evaluating hyperparameters in deep learning models with large search spaces.
method Sub-Sampling (SS) algorithm combined with Bayesian Optimization (BOSS).
result Theoretical proof of optimality and empirical validation of superior performance.

Asynchronous method for hyperparameter and neural architecture search.

problem Efficiently searching for optimal hyperparameters and neural architectures.
method Model-based, asynchronous multi-fidelity method combining Hyperband and Gaussian process-based Bayesian optimization.
result Substantial speed-ups over current state-of-the-art methods on various benchmarks.

Driven by the need for parallelizable hyperparameter optimization methods, this paper studies \emph{open loop} search methods: sequences that are predetermined and can be generated before a single configuration is evaluated. Examples include grid search, uniform random search, low discrepancy sequences, and other sampl…

2017-06-06abs ↗pdf ↗

We introduce the hyperparameter search problem in the field of machine learning and discuss its main challenges from an optimization perspective. Machine learning methods attempt to build models that capture some element of interest based on given data. Most common learning algorithms feature a set of hyperparameters t…

2015-02-07abs ↗pdf ↗

New tools reveal simple structure in complex hyperparameter loss surfaces near optima.

problem Understanding the behavior of hyperparameter loss surfaces near model optima.
method Developed a novel technique based on random search to uncover asymptotic features of the loss surface.
result Random search within the asymptotic regime yields a new distribution with parameters defining the loss surface.

This paper reviews hyperparameter optimization methods and best practices.

problem Finding optimal hyperparameters for machine learning models.
method Various hyperparameter optimization methods are reviewed, including grid search, random search, evolutionary algorithms, Bayesian optimization, Hyperband, and racing.
result Practical recommendations for conducting hyperparameter optimization are provided.

We introduce an open source python framework named PHS - Parallel Hyperparameter Search to enable hyperparameter optimization on numerous compute instances of any arbitrary python function. This is achieved with minimal modifications inside the target function. Possible applications appear in expensive to evaluate nume…

2020-02-26abs ↗pdf ↗

A new Randomized-Hyperopt method improves XGBoost hyperparameter tuning.

problem Improving the performance of XGBoost through hyperparameter optimization.
method Proposes Randomized-Hyperopt for XGBoost hyperparameter tuning.
result Randomized-Hyperopt outperforms other methods in terms of accuracy and execution time.

Paper studies kernel hyperparameters for clustering, proposing an efficient search method.

problem Challenges in tuning kernel parameters for clustering, especially for RBF kernels.
method Derives a lower bound for RBF kernel parameters, proposes an efficient hyperparameter search algorithm.
result Proposes an efficient algorithm for hyperparameter search in kernel clustering, improving upon grid search.

Differentially private hyperparameter tuning improves privacy in machine learning.

problem Hyperparameter tuning leaks private information through selected configurations.
method Local Bayesian optimization using Gaussian Process surrogate for private gradient approximation.
result DP-GIBO converges to locally optimal hyperparameters with polynomial dimensional dependence.

Modern machine learning algorithms are increasingly computationally demanding, requiring specialized hardware and distributed computation to achieve high performance in a reasonable time frame. Many hyperparameter search algorithms have been proposed for improving the efficiency of model selection, however their adapta…

2018-07-13abs ↗pdf ↗

Space-filling designs such as scrambled-Hammersley, Latin Hypercube Sampling and Jittered Sampling have been proposed for fully parallel hyperparameter search, and were shown to be more effective than random or grid search. In this paper, we show that these designs only improve over random search by a constant factor. …

2019-10-18abs ↗pdf ↗

In deep learning, performance is strongly affected by the choice of architecture and hyperparameters. While there has been extensive work on automatic hyperparameter optimization for simple spaces, complex spaces such as the space of deep architectures remain largely unexplored. As a result, the choice of architecture …

2017-04-28abs ↗pdf ↗

Hyperparameter optimization aims to find the optimal hyperparameter configuration of a machine learning model, which provides the best performance on a validation dataset. Manual search usually leads to get stuck in a local hyperparameter configuration, and heavily depends on human intuition and experience. A simple al…

2017-10-17abs ↗pdf ↗

Proposes a gradient-based bilevel optimization method for efficient hyperparameter tuning.

problem Efficiently tuning hyperparameters in machine learning models.
method Gradient-based bilevel optimization approach.
result The proposed method is multiple times faster than existing techniques.

Proposes baselines for joint NAS and HPO optimization.

problem Joint optimization of neural architecture and hyperparameters for multiple objectives.
method Extends existing methods to jointly optimize with multiple objectives.
result Serves as simple baselines for future multi-objective joint NAS + HPO research.

In order to find hyperparameters for a machine learning model, algorithms such as grid search or random search are used over the space of possible values of the models hyperparameters. These search algorithms opt the solution that minimizes a specific cost function. In language models, perplexity is one of the most pop…

2018-03-29abs ↗pdf ↗

HASSO improves SO algorithms by dynamically tuning hyperparameters.

problem Inefficiency of hyperparameter tuning for SO algorithms.
method HASSO is a self-adjusting SO algorithm that dynamically tunes its own hyperparameters.
result HASSO enhances the performance of various SO algorithms across different test problems.

Autodock is a widely used molecular modeling tool which predicts how small molecules bind to a receptor of known 3D structure. The current version of AutoDock uses meta-heuristic algorithms in combination with local search methods for doing the conformation search. Appropriate settings of hyperparameters in these algor…

2018-12-02abs ↗pdf ↗

Mango automates hyperparameter tuning for large-scale ML training.

problem Manual hyperparameter tuning is tedious and inefficient for large-scale machine learning.
method Parallel hyperparameter tuning with intelligent search strategies and flexible abstractions.
result Mango achieves comparable performance to Hyperopt while supporting distributed computing.

This paper explores BDL hyperparameters for robust polynomial mapping with noise.

problem Designing BDL hyperparameters for robust function mapping with uncertainty quantification.
method Mapping Bayesian connectionist representations to polynomials of varying orders and noise types.
result Optimal network depth and ensemble size for prediction and uncertainty quantification.

Bayesian optimization outperformed random search in machine learning hyperparameter tuning challenge.

problem Optimizing hyperparameters of machine learning models using derivative-free methods.
method Bayesian optimization vs. random search on real datasets.
result Bayesian optimization significantly outperformed random search in held-out objective functions.

LLMs learn to recommend models and hyperparameters from dataset metadata.

problem Model and hyperparameter selection in machine learning is challenging and resource-intensive.
method Converted datasets into metadata and prompted LLMs to recommend models and hyperparameters.
result LLMs can recommend competitive models and hyperparameters without search.

Bayesian optimization outperforms other methods in hyperparameter tuning for reinforcement learning.

problem Finding optimal hyperparameters that generalize across random seeds in reinforcement learning.
method Benchmarked Successive Halving, Random Search, and Bayesian Optimization with and without repetitions on PPO2 algorithms for Cartpole and Inverted Pendulum tasks.
result Bayesian optimization with noise robust acquisition function is the best choice.

The paper proposes a method to learn hyperparameters without validation sets, improving efficiency and accuracy.

problem Training large models on limited data to avoid overfitting and reduce validation set usage.
method Gradient-based learning of hyperparameters via a data-emphasized evidence lower bound (ELBO) objective.
result The data-emphasized ELBO reduces hyperparameter search time from 88+ hours to under 3 hours while maintaining comparable accuracy.

Study uses multi-task Bayesian optimization to speed up SVM hyperparameter tuning for nodules diagnosis.

problem Redundant and time-consuming hyperparameter tuning for SVM classifiers in medical imaging.
method Employed multi-task Bayesian optimization to accelerate hyperparameter search.
result Multi-task Bayesian optimization significantly accelerates hyperparameter search.

VisEvol uses evolutionary optimization to find optimal hyperparameters for machine learning models.

problem Finding the best hyperparameters for complex machine learning models is computationally intensive and challenging.
method VisEvol employs evolutionary optimization, storing performant models and improving others through crossover and mutation processes.
result VisEvol generates a voting ensemble of models with improved predictive performance.