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

205411616821 · Jun 202019922001200920172026
48 results for Hyperparameter Optimization

Deep learning models are full of hyperparameters, which are set manually before the learning process can start. To find the best configuration for these hyperparameters in such a high dimensional space, with time-consuming and expensive model training / validation, is not a trivial challenge. Bayesian optimization is a…

2019-12-11abs ↗pdf ↗

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.

New optimizer improves privacy-protected hyperparameter tuning.

problem No practical methods for differentially private hyperparameter selection.
method Study honest hyperparameter selection under DP, show adaptive optimizers like DPAdam have an advantage.
result DPAdam optimizes hyperparameters more efficiently under DP constraints.

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.

The performance of optimizers, particularly in deep learning, depends considerably on their chosen hyperparameter configuration. The efficacy of optimizers is often studied under near-optimal problem-specific hyperparameters, and finding these settings may be prohibitively costly for practitioners. In this work, we arg…

2019-10-25abs ↗pdf ↗

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.

This paper introduces multi-objective hyperparameter optimization in machine learning.

problem Optimizing machine learning pipelines for multiple objectives, not just accuracy.
method Survey of optimization strategies and applications in multi-objective hyperparameter optimization.
result The importance and utility of multi-objective hyperparameter optimization in applied machine learning.

Efficiently optimizes hyperparameters for PDE and inverse problems using Gaussian processes.

problem Hyperparameter optimization for scientific computing and inference methods.
method Bilevel optimization with Gauss-Newton linearization for efficient hyperparameter updates.
result Significant improvements in accuracy and robustness compared to random initialization.

Novel hyperparameter optimization for target tasks under covariate shift.

problem Hyperparameter optimization under multi-source covariate shift.
method Construct variance reduced estimator to unbiasedly approximate target objective; propose no-regret hyperparameter optimization procedure.
result Proposed framework broadens applications of automated hyperparameter optimization.

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.

HyperSTAR optimizes deep network hyperparameters for specific tasks.

problem Finding optimal hyperparameters for deep neural networks is computationally expensive and task-agnostic approaches are inefficient.
method HyperSTAR learns a dataset representation and a performance predictor from raw images, ranking and recommending hyperparameters conditioned on a joint dataset-hyperparameter space.
result HyperSTAR reduces HPO time by 50% on large-scale image classification datasets.

Optimizes hyperparameter tuning for models using approximate leave-one-out cross-validation.

problem Finding optimal hyperparameters for regularized models using approximate leave-one-out cross-validation.
method Derive efficient formulas for gradient and hessian of approximate leave-one-out cross-validation, apply second-order optimization.
result Demonstrates the effectiveness of the approach on real-world data sets.

Efficiently tunes hyperparameters with dynamic accuracy method.

problem Optimizing machine learning hyperparameters with inexact evaluations.
method Dynamic accuracy derivative-free optimization for hyperparameter tuning.
result Demonstrates robust and efficient hyperparameter tuning compared to fixed accuracy methods.

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.

SCoreBO improves Bayesian optimization by learning hyperparameters and self-correcting.

problem Efficient hyperparameter tuning for Gaussian process models in Bayesian optimization.
method Introduces SAL and SCoreBO, which prioritize hyperparameter learning and perform simultaneous optimization and learning.
result SCoreBO outperforms state-of-the-art methods on traditional benchmarks and atypical tasks.

HyperSHAP explains HPO hyperparameters and interactions, improving trust and adoption.

problem Tackling opaque HPO methods and lack of user trust.
method Game-theoretic explainability framework based on Shapley values and interactions.
result Provides insights into hyperparameter contributions and interactions.

With the advent of automated machine learning, automated hyperparameter optimization methods are by now routinely used in data mining. However, this progress is not yet matched by equal progress on automatic analyses that yield information beyond performance-optimizing hyperparameter settings. In this work, we aim to a…

2017-10-12abs ↗pdf ↗

When hyperparameter optimization of a machine learning algorithm is repeated for multiple datasets it is possible to transfer knowledge to an optimization run on a new dataset. We develop a new hyperparameter-free ensemble model for Bayesian optimization that is a generalization of two existing transfer learning extens…

2018-02-06abs ↗pdf ↗

This study improves hyperparameter optimization for categorical and non-normal data.

problem Bayesian hyperparameter optimization struggles with categorical hyperparameters and non-normal data.
method Integrates conformalized quantile regression to address estimation weaknesses and provides robust calibration guarantees.
result Quantile surrogate architectures and acquisition functions yield superior performance compared to existing methods.

Optimizes deep learning models for ocean dynamics using Fourier neural operators.

problem Efficiently training deep learning models for ocean dynamics with optimal hyperparameters.
method Multiobjective hyperparameter optimization with DeepHyper for Fourier neural operators.
result Optimal hyperparameters significantly improved model performance in ocean dynamics forecasting.

New method optimizes hyperparameters for randomized algorithms like random feature regression.

problem Optimizing hyperparameters in randomized algorithms is challenging due to their stochastic nature.
method Introduced a random objective function and used ensemble Kalman inversion (EKI) for gradient-free optimization.
result Demonstrated successful optimization of hyperparameters in various randomized algorithms.

This work speeds up hyperparameter selection for non-smooth convex models using implicit differentiation.

problem Optimizing hyperparameters of non-smooth convex models.
method Implicit differentiation of proximal gradient and coordinate descent methods.
result Implicit differentiation can speed up hyperparameter optimization, especially for non-smooth problems.

L2O-CFGD meta-learns hyperparameters for FGD, improving performance.

problem Challenges in convergence and hyperparameter selection for FGD.
method Learning to Optimize Caputo Fractional Gradient Descent (L2O-CFGD).
result Meta-learned schedule outperforms static hyperparameters and achieves comparable performance to black-box meta-learners.

Hyperparameter tuning is an omnipresent problem in machine learning as it is an integral aspect of obtaining the state-of-the-art performance for any model. Most often, hyperparameters are optimized just by training a model on a grid of possible hyperparameter values and taking the one that performs best on a validatio…

2019-06-27abs ↗pdf ↗

We present a new method for searching optimal hyperparameters among several tasks and several criteria. Multi-Task Multi Criteria method (MTMC) provides several Pareto-optimal solutions, among which one solution is selected with given criteria significance coefficients. The article begins with a mathematical formulatio…

2020-02-15abs ↗pdf ↗

Modern learning models are characterized by large hyperparameter spaces and long training times. These properties, coupled with the rise of parallel computing and the growing demand to productionize machine learning workloads, motivate the need to develop mature hyperparameter optimization functionality in distributed …

2018-10-13abs ↗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 ↗

Paper proposes a new method for efficient hyperparameter optimization.

problem Challenging task of optimizing hyperparameters in machine learning.
method Sequential Uniform Design (SeqUD) strategy for adaptive and efficient exploration of hyperparameter space.
result The proposed SeqUD strategy outperforms existing methods in hyperparameter optimization.

Tuning hyperparameters of learning algorithms is hard because gradients are usually unavailable. We compute exact gradients of cross-validation performance with respect to all hyperparameters by chaining derivatives backwards through the entire training procedure. These gradients allow us to optimize thousands of hyper…

2015-02-11abs ↗pdf ↗