A new method selects algorithms and optimizes their hyper-parameters efficiently.
problem Redundant hyper-parameter search space in AutoML.
method Cascaded algorithm selection and hyper-parameter optimization with ER-UCB bandit.
result ER-UCB strategy achieves optimal regret bound for algorithm selection.
Study examines the cost of tuning hyper-parameters in regression models.
problem Estimating optimal hyper-parameters for regression models.
method Established finite-sample oracle inequalities for hyper-parameter selection.
result Generalization error of selected models shrinks at nearly a parametric rate.
Purpose: Machine learning is broadly used for clinical data analysis. Before training a model, a machine learning algorithm must be selected. Also, the values of one or more model parameters termed hyper-parameters must be set. Selecting algorithms and hyper-parameter values requires advanced machine learning knowledge…
This paper studies the effect of various hyper-parameters and their selection for the best performance of the deep learning model proposed in [1] for distributed attack detection in the Internet of Things (IoT). The findings show that there are three hyper-parameters that have more influence on the best performance ach…
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.
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.
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λ 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.
This paper aims to explore models based on the extreme gradient boosting (XGBoost) approach for business risk classification. Feature selection (FS) algorithms and hyper-parameter optimizations are simultaneously considered during model training. The five most commonly used FS methods including weight by Gini, weight b…
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.
Efficiently generates and selects explanations for neural networks using GANs and FID.
problem Manual selection of hyper-parameters for generating interpretable neural network explanations is slow and requires qualitative evaluation.
method Proposes a novel metric using Fréchet Inception Distance (FID) and a GAN-based method for efficient search and realistic output generation.
result Successfully selects hyper-parameters leading to interpretable examples, avoiding manual evaluation.
Proposes debiasing strategy for ill-posed regression problems.
problem Estimating functions with conditional moment restrictions, especially when estimators are sensitive to misspecification.
method Debiased estimation using influence function of modified mean squared error.
result Demonstrates finite-sample convergence rate and robustness to misspecification.
ABPS improves RL training efficiency by sharing policies and evolving hyper-params.
problem Data inefficiency in training deep RL models for real-world applications.
method ABPS: adaptive behavior policy sharing; ABPS-PBT: hybridizing ABPS with PBT for evolving hyper-params.
result ABPS achieves superior performance and reduced variance compared to conventional hyper-parameter tuning.
A new method for faster bandwidth selection in Gaussian kernel ridge regression.
problem Efficiently selecting the bandwidth in Gaussian kernel ridge regression.
method Formulated an approximate Jacobian expression for bandwidth selection, proposing a closed-form heuristic.
result Our method is as accurate as cross-validation and marginal likelihood maximization but up to six orders of magnitude faster.
In this article we select the unknown dimension of the feature by re- versible jump MCMC inside a simulated annealing in bayesian set up of collaborative filter. We implement the same in MovieLens small dataset. We also tune the hyper parameter by using a modified empirical bayes. It can also be used to guess an initia…
A hybrid RL-Bayesian search configures machine learning pipelines efficiently.
problem Optimizing hyper-parameters in a hierarchical conditional space.
method Combines Reinforcement Learning and Bayesian Optimization.
result Outperforms state-of-the-art methods in pipeline optimization.
This work evaluates PDA methods without target labels, revealing significant accuracy drops.
problem Evaluating PDA methods without target labels and inconsistent experimental settings.
method Realistic evaluation of 7 PDA methods with 7 model selection strategies on 2 datasets.
result Accuracy drops up to 30 percentage points without target labels, only one method performs well.
Automates neural network model selection for efficiency.
problem Efficiently choosing neural network architectures and hyper-parameters.
method Modified micro-genetic algorithm for automated model selection.
result AMS finds efficient neural network models for classification and regression.
RFMS optimizes model hyperparameters across remote sites for high-dimensional data.
problem Training machine learning models on remote data sites due to privacy and trust concerns.
method Bayesian Optimization for multi-objective hyperparameter tuning.
result Multi-objective Bayesian Optimization improves model performance across multiple data sites.
Novel method for model selection in Bayesian autoencoders.
problem Model selection for Bayesian autoencoders.
method Prior hyper-parameter optimization using distributional sliced-Wasserstein distance.
result State-of-the-art results in small-data regimes.
Recurrent neural networks are a powerful tool, but they are very sensitive to their hyper-parameter configuration. Moreover, training properly a recurrent neural network is a tough task, therefore selecting an appropriate configuration is critical. Varied strategies have been proposed to tackle this issue. However, mos…
SCORE improves tree-based predictions with boosted residual extraTrees.
problem Improving tree-based prediction models with reduced errors.
method Inspired by representation learning, SCORE uses boosting, regularized regression, and variable selection.
result SCORE provides comparable or superior performance compared to other models.
Stage-based hyper-parameter optimization reduces GPU-hours and training time.
problem Efficiently executing hyper-parameter optimization for deep learning models.
method Stage-based execution strategy to remove redundant computations.
result Stage-based execution outperforms trial-based method by up to 6.60 times in GPU-hours and 4.13 times in training time.
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.
DriveML automates machine learning tasks in R.
problem Manual machine learning tasks are time-consuming and error-prone.
method Automated data preparation, feature engineering, model building, and model explanation.
result DriveML performs best across different parameters compared to other packages.
Integration over non-negative integrands is a central problem in machine learning (e.g. for model averaging, (hyper-)parameter marginalisation, and computing posterior predictive distributions). Bayesian Quadrature is a probabilistic numerical integration technique that performs promisingly when compared to traditional…
A method to approximate cross-validation for manifold regularization in semi-supervised learning.
problem Efficiency of cross-validation in selecting hyper-parameters for manifold regularization.
method Using Bouligand influence function (BIF) for Taylor expansion to approximate cross-validation.
result The proposed method significantly improves efficiency with minimal time cost.
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 paper proposes an efficient autoHPO method based on data-to-hyper-parameter mapping.
problem Manual hyper-parameter tuning is costly and dependent.
method The approach is based on mapping from data to hyper-parameters using a sophisticated network structure and effective construction algorithms.
result The proposed approach significantly outperforms state-of-the-art methods.
AMSAs adaptively manage crypto-currency trading by selecting multiple strategies based on market conditions.
problem Maximizing gains in volatile crypto-currency markets with high uncertainty.
method AMSAs use multiple sub-agents with different strategies, dynamically selecting them based on market conditions.
result AMSAs can achieve high positive alpha in long-term crypto-currency trading.
Evolutionary Strategies optimize hyper-parameters for off-policy learning.
problem Hyper-parameter sensitivity in off-policy learning.
method Application of Evolutionary Strategies for online hyper-parameter tuning.
result Our method outperforms state-of-the-art baselines.
This paper addresses the issue of model selection for hidden Markov models (HMMs). We generalize factorized asymptotic Bayesian inference (FAB), which has been recently developed for model selection on independent hidden variables (i.e., mixture models), for time-dependent hidden variables. As with FAB in mixture model…
Paper proposes an AutoML framework for efficient device-edge co-inference.
problem Finding optimal hyper-parameters for model sparsity and feature compression.
method Sequential decision problem solved using deep reinforcement learning (DRL).
result Achieves better communication-computation trade-off and significant speedup.
A new optimization method improves deep learning accuracy without hyper-parameter tuning.
problem Computational demands and convergence behavior in deep learning training.
method Stochastic quasi-Gauss-Newton (SQGN) optimization method combining stochastic quasi-Newton, Gauss-Newton, and variance reduction.
result SQGN provides excellent accuracy without hyper-parameter experimentation, improving convergence and computational performance.
Two-tier approach optimizes RL hyper-parameters for better agent learning.
problem Optimizing hyper-parameters in reinforcement learning to improve agent performance.
method Two-step optimization: first categorical hyper-parameters, then solution-level hyper-parameters.
result Promising results in simulated control tasks, suggesting user-independent reinforcement learning applications.
Federated learning improves with adaptive hyper-parameters and representation matching.
problem Heterogeneous client data leads to divergent local models in federated learning.
method Representation matching and adaptive hyper-parameters.
result Significant performance and robustness improvements in federated learning.
As convolutional neural networks (CNNs) enable state-of-the-art computer vision applications, their high energy consumption has emerged as a key impediment to their deployment on embedded and mobile devices. Towards efficient image classification under hardware constraints, prior work has proposed adaptive CNNs, i.e., …
KD technique improves QDNN performance with reduced hyper-parameters.
problem Restoring performance loss in QDNNs due to quantization.
method Applied KD with reduced hyper-parameters, including a new coefficient reduction technique.
result Achieved 92.7% test accuracy on CIFAR-10 and 67.0% on CIFAR-100 with 2-bit weights.
New method selects neural network architectures without needing data.
problem Choosing efficient deep neural network architectures.
method Developed the deep frame potential to quantify network capacity.
result Deep frame potential correlates with generalization error.
Paper compares AutoML methods for recommending classification algorithms.
problem Finding the best classification algorithm for a dataset.
method Four AutoML methods using Evolutionary Algorithms and CASH approach.
result EA-based methods, especially decision-tree induction, produce interpretable models.
Survey on automating machine learning processes.
problem Automating the selection and tuning of machine learning algorithms.
method Comprehensive survey of techniques and frameworks.
result Reduction of human involvement in machine learning tasks.
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…
Kernel based methods have shown effective performance in many remote sensing classification tasks. However their performance significantly depend on its hyper-parameters. The conventional technique to estimate the parameter comes with high computational complexity. Thus, the objective of this letter is to propose an fa…
BCV method helps estimate clusters and hyper-parameters in large data sets.
problem Determining the number of clusters in large-scale data.
method Bi-cross validation (BCV) for spectral clustering.
result BCV directly applies to spectral clustering for estimating clusters and hyper-parameters.
New estimators outperform maximum likelihood without hyper-parameter estimation.
problem Improving system identification performance without hyper-parameter estimation.
method Developed generalized Bayes and closed-form biased estimators using excess MSE.
result New estimators have comparable performance to empirical-Bayes-based regularized estimator.
AutoML explores vs. exploits promising classifiers to improve performance.
problem Maximizing ML pipeline performance within limited time and resource constraints.
method Empirical study comparing exploiting vs. exploring the search space for promising classifiers.
result Exploiting the most promising classifiers does not statistically improve pipeline performance.
Paper proposes efficient GP hyper-parameter optimization methods.
problem Efficient hyper-parameter optimization for Gaussian process regression.
method Cross-validation and ADMM for O(n2) complexity. result Proposed methods outperform traditional ML-based routines.