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

202403605806 · Jun 202019922001200920172026
48 results for hyper-parameter optimization

Paper proposes a reinforcement learning framework for efficient hyper-parameter tuning of stochastic optimization algorithms.

problem Efficient tuning of hyper-parameters for stochastic optimization algorithms.
method Modeling hyper-parameter tuning as a Markov decision process and using policy gradient algorithms.
result The proposed framework significantly reduces the time required for hyper-parameter tuning compared to Bayesian optimization.

As deep learning techniques advance more than ever, hyper-parameter optimization is the new major workload in deep learning clusters. Although hyper-parameter optimization is crucial in training deep learning models for high model performance, effectively executing such a computation-heavy workload still remains a chal…

2019-11-24abs ↗pdf ↗

Hippo optimizes deep learning hyper-parameters by reducing redundant trials.

problem Redundant hyper-parameter trials in hyper-parameter optimization.
method Hippo breaks down hyper-parameter sequences into stages and executes them in a tree structure.
result Hippo reduces GPU-hours and training time significantly compared to existing methods.

This work improves Bayesian Optimization for setting DNN hyper-parameters.

problem Manual setting of DNN hyper-parameters is error-prone and computationally expensive.
method Combines Bayesian Optimization with tuning rules to reduce search space and improve accuracy.
result Improves efficiency and accuracy of hyper-parameter tuning for deep neural networks.

This paper explores hyperparameter optimization for machine learning models.

problem Finding the best hyper-parameters for machine learning models.
method Introduces state-of-the-art optimization techniques and discusses their application.
result Comparison of different optimization methods on benchmark datasets.

Generative approach speeds hyperparameter tuning for machine learning models.

problem Computational infeasibility of cross-validation and difficulty of fully Bayesian hyper-parameter learning.
method Combines optimization-based approximations and amortization techniques.
result Rapid evaluation of hyper-parameters over grids or ranges, supporting predictive tuning and uncertainty quantification.

The quality of an induced model by a learning algorithm is dependent on the quality of the training data and the hyper-parameters supplied to the learning algorithm. Prior work has shown that improving the quality of the training data (i.e., by removing low quality instances) or tuning the learning algorithm hyper-para…

2014-03-13abs ↗pdf ↗

New method improves anomaly detection in acoustic signals.

problem Poor anomaly detection performance in existing acoustic signal-based unsupervised methods.
method Deep autoencoding Gaussian mixture model with hyper-parameter optimization.
result Significantly improved anomaly detection performance compared to previous methods.

This paper reviews hyper-parameter optimization methods for deep learning.

problem Designing and training deep neural networks is challenging and unpredictable.
method Reviews major optimization algorithms and services for hyper-parameter tuning.
result Comprehensive comparison of optimization algorithms and services.

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.

A framework for auto-tuning hyper-parameters in contextual bandit algorithms.

problem Auto-tuning hyper-parameters in real-time for contextual bandit algorithms.
method Proposes a Syndicated Bandits framework to learn multiple hyper-parameters dynamically.
result Achieves optimal regret bounds under certain scenarios and handles multiple contextual bandit algorithms.

We learn recurrent neural network optimizers trained on simple synthetic functions by gradient descent. We show that these learned optimizers exhibit a remarkable degree of transfer in that they can be used to efficiently optimize a broad range of derivative-free black-box functions, including Gaussian process bandits,…

2016-11-11abs ↗pdf ↗

Hyper-parameter optimization remains as the core issue of Gaussian process (GP) for machine learning nowadays. The benchmark method using maximum likelihood (ML) estimation and gradient descent (GD) is impractical for processing big data due to its O(n3)O(n^3) complexity. Many sophisticated global or local approximation m…

2019-06-06abs ↗pdf ↗

Bayesian optimization is a powerful tool for fine-tuning the hyper-parameters of a wide variety of machine learning models. The success of machine learning has led practitioners in diverse real-world settings to learn classifiers for practical problems. As machine learning becomes commonplace, Bayesian optimization bec…

2015-01-16abs ↗pdf ↗

Unified Bayesian Optimization framework for model selection balancing effectiveness and training efficiency.

problem Balancing model effectiveness and training efficiency in machine learning model selection.
method Proposes a unified Bayesian Optimization framework to jointly optimize model effectiveness and training efficiency.
result Models selected using the proposed framework significantly improve training efficiency while maintaining strong effectiveness.

Much recent research has been conducted in the area of Bayesian learning, particularly with regard to the optimization of hyper-parameters via Gaussian process regression. The methodologies rely chiefly on the method of maximizing the expected improvement of a score function with respect to adjustments in the hyper-par…

2014-05-10abs ↗pdf ↗

The objective of this research is to enhance performance of Stochastic Gradient Descent (SGD) algorithm in text classification. In our research, we proposed using SGD learning with Grid-Search approach to fine-tuning hyper-parameters in order to enhance the performance of SGD classification. We explored different setti…

2019-02-18abs ↗pdf ↗

PyKEEN 1.0 simplifies KGE model creation and optimization.

problem Training and evaluating knowledge graph embeddings (KGEs).
method Composes KGEMs with various interaction models, training approaches, and loss functions. Implements automatic memory optimization and extensive HPO functionalities.
result PyKEEN 1.0 streamlines KGE model creation and optimization.

We solve a portfolio selection problem with four objectives, finding convex scalarizations for part of the Pareto front.

problem Portfolio selection with four objectives: mean, variance, skewness, and kurtosis.
method Linearly scalarize MVSK objectives into a convex polynomial FλF_λ over the probability simplex, compute optimizers for each λλ.
result Identify a set of hyper-parameters for which the scalarization is convex, allowing computation of part of the Pareto front.

Efficiently models learning curves using Gaussian processes with latent Kronecker structure.

problem Joint modeling of machine learning model performance across hyper-parameters and training progress.
method Imposes latent Kronecker structure to leverage efficient product kernels and handle missing values.
result Matches the performance of a Transformer on a learning curve prediction task.

We study a budgeted hyper-parameter tuning problem, where we optimize the tuning result under a hard resource constraint. We propose to solve it as a sequential decision making problem, such that we can use the partial training progress of configurations to dynamically allocate the remaining budget. Our algorithm combi…

2019-02-01abs ↗pdf ↗

DEEPLY improves cloud service partitioning across multiple datasets and goals.

problem Finding a generally useful method to partition monolithic enterprise applications into cloud-based microservices.
method DEEPLY extends CO-GCN with a novel loss function and hyper-parameter optimization.
result DEEPLY outperforms prior work across multiple datasets and goals.

We present Acquisition Thompson Sampling (ATS), a novel technique for batch Bayesian Optimization (BO) based on the idea of sampling multiple acquisition functions from a stochastic process. We define this process through the dependency of the acquisition functions on a set of model hyper-parameters. ATS is conceptuall…

2019-03-22abs ↗pdf ↗