New HPO frameworks needed for continual learning.
problem No standard HPO for continual learning.
method Comparative study of HPO frameworks.
result No HPO framework consistently outperforms others.
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,742 papers · 148 categories
Trend · papers per month
48 results for “HPO framework”
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.
Automated HPO design using Bayesian optimization and benchmarking.
problem Designing effective hyperparameter optimization algorithms is manual and lacks systematic understanding.
method Formalized space of HPO candidates, Bayesian optimization for search, ablation analysis.
result Simple configurations can perform well in HPO, especially with right parameters.
OptFormer learns universal HPO from diverse datasets.
problem Learning HPO from experiments with different hyperparameters.
method Text-based Transformer framework for joint policy and function prediction.
result OptFormer can imitate multiple HPO algorithms and improve predictions.
Auptimizer simplifies hyperparameter tuning for machine learning models.
problem Difficulty and time-consuming hyperparameter tuning for machine learning models.
method General HPO framework that distributes computing resources and integrates various HPO techniques.
result Simplified model tuning and bookkeeping for data scientists.
BOinG optimizes HPO problems by focusing on promising local regions.
problem Expensive black-box optimization problems, especially hyperparameter optimization.
method Two-stage approach: global surrogate model followed by local model.
result BOinG exploits the structure of typical HPO problems and performs well on mid-sized problems.
A new framework tackles CASH problem with alternating optimization and Rising Bandits.
problem Efficiently solving the Combined Algorithm Selection and Hyperparameter optimization (CASH) problem.
method Alternating optimization framework using BO for HPO and Rising Bandits for algorithm selection.
result Demonstrated superiority over competitive baselines in extensive experiments.
New method improves HPO interpretability without sacrificing performance.
problem Difficulty in understanding HPO algorithms due to black-box nature.
method Coupling Bayesian optimization with Bayesian Algorithm Execution.
result More reliable IML explanations without compromising optimization performance.
Develops Heuristic Portfolio Optimization (HPO) as an information-restricted projection of Markowitz/tangency solution
problem Practitioners allocate capital with forecast-light rules like equal weight, inverse volatility, risk parity, HRP, and RA-HRP
method Implies-return principle and fixed-tree cluster-Sharpe recursion
result Formalizes HPO maps, proves defect equals squared inefficiency, and identifies nodewise alphas as policy-gradient coordinates
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.
A new cost-frugal HPO method controls training cost during optimization.
problem Ignoring training cost variation in HPO leads to inefficient hyperparameter tuning.
method Developed a randomized direct-search method with convergence and approximation guarantees.
result Proved an convergence rate and approximation guarantee.
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.
Bayesian Optimization (BO) is a common approach for hyperparameter optimization (HPO) in automated machine learning. Although it is well-accepted that HPO is crucial to obtain well-performing machine learning models, tuning BO's own hyperparameters is often neglected. In this paper, we empirically study the impact of o…
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.
Automated machine learning aims to automate the whole process of machine learning, including model configuration. In this paper, we focus on automated hyperparameter optimization (HPO) based on sequential model-based optimization (SMBO). Though conventional SMBO algorithms work well when abundant HPO trials are availab…
New algorithm stabilizes bi-level hyperparameter optimization.
problem Stability issues in bi-level hyperparameter optimization.
method Uses Moreau-Yosida regularization to stabilize convergence.
result Significant improvement in loss values with fixed computation budget.
The paper investigates overfitting in hyperparameter optimization.
problem Overfitting in hyperparameter optimization (overtuning).
method Formal definition, large-scale reanalysis of HPO benchmark data, analysis of factors affecting overtuning.
result Overtuning is more common than previously assumed, leading to worse generalization error in 10% of cases.
Despite the recent progress in hyperparameter optimization (HPO), available benchmarks that resemble real-world scenarios consist of a few and very large problem instances that are expensive to solve. This blocks researchers and practitioners not only from systematically running large-scale comparisons that are needed …
Proposes FMS for more efficient neural network hyperparameter optimization.
problem Efficient hyperparameter optimization for deep learning models.
method Uses logged checkpoints of trained weights to guide hyperparameter selections.
result Proposes Forecasting Model Search (FMS) method.
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.
Hierarchical Partial-Order Models for Ranking
problem Rank aggregation combining ordered lists
method Hierarchical partial-order models
result Bayesian inference for latent poset hierarchy
FanG-HPO optimizes machine learning models for fairness and low energy consumption.
problem Bias in machine learning models and high energy consumption in hyperparameter optimization.
method Combines multi-objective and multiple information source Bayesian optimization.
result FanG-HPO identifies fair and energy-efficient machine learning models.
BLiE optimizes hyperparameters with theoretical guarantees and superior performance.
problem Hyperparameter optimization in machine learning.
method Lipschitz bandit approach exploiting Lipschitz continuity.
result BLiE finds ε-optimal hyperparameters with theoretical complexity.
POCAII optimizes hyperparameters with a new approach, showing superior performance.
problem Hyperparameter optimization with limited resources.
method Explicitly separates search and evaluation phases, focusing on exploration and exploitation.
result POCAII outperforms state-of-the-art HPO algorithms in low-budget scenarios.
New algorithms optimize multiple machine learning metrics in real-world tasks.
problem Optimizing multiple conflicting performance criteria in real-world applications.
method Extends ASHA to multi-objective hyperparameter optimization.
result MO ASHA enables scalable multi-objective hyperparameter optimization.
New algorithm reduces online hyperparameter optimization costs.
problem High cost of evaluating validation examples in online HPO.
method Modeling online HPO as a time-varying Bayesian optimization problem, proposing a costly feedback setting.
result Cost-efficient GP-UCB algorithm reaches human expert-level performance.
We use PDPs with confidence bands to explain HPO results.
problem Lack of explainable insights into HPO results.
method Use IML techniques, specifically PDPs, with estimated confidence bands.
result Increased quality of PDPs in relevant sub-regions.
Two new techniques improve zero-shot HPO efficiency.
problem Efficiently selecting hyperparameters for new datasets.
method Surrogate model and multi-fidelity techniques.
result Significant improvement in accuracy compared to standard methods.
PASHA optimizes model tuning for large datasets with limited resources.
problem Expensive HPO and NAS for large datasets.
method Dynamic resource allocation approach.
result Significantly reduces computational resources while maintaining performance.
A new BO termination criterion for HPO reduces optimization time without sacrificing test performance.
problem Determining an optimal budget for hyperparameter optimization.
method A new termination criterion based on the discrepancy between predictive and computable target performance.
result The proposed termination criterion achieves a better trade-off between test performance and optimization time.
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.
Study shows HPO improves stock return forecasting models.
problem Improving accuracy of stock return forecasting models.
method Used deep neural networks with hyperparameter optimization (HPO) and regularization techniques.
result Model with technical indicators and dropout regularization outperformed other models by 0.53% in-sample and 1.11% out-of-sample.
Automates RL with sample-efficient hyperparameter optimization.
problem Challenges in applying deep RL due to hyperparameter sensitivity and inefficiency.
method Population-based AutoRL framework for meta-optimizing RL algorithms and architectures.
result Reduces the number of environment interactions needed for meta-optimization by up to an order of magnitude.
Paper develops an efficient approach to reduce HPO time.
problem Challenges in determining optimal hyperparameters due to large number and training time.
method Nested Latin hypercube design for initialization, truncated additive Gaussian process model for calibration, sequential model-based algorithm for optimization.
result Demonstrates competitive performance on various machine learning models.
A new method for optimizing hyperparameters using conformalized quantile regression.
problem Optimizing hyperparameters with strong assumptions about noise.
method Conformalized quantile regression for more realistic modeling.
result Quicker convergence on empirical benchmarks.
Due to the high computational demands executing a rigorous comparison between hyperparameter optimization (HPO) methods is often cumbersome. The goal of this paper is to facilitate a better empirical evaluation of HPO methods by providing benchmarks that are cheap to evaluate, but still represent realistic use cases. W…
YAHPO Gym -- An Efficient Multi-Objective Multi-Fidelity Benchmark for Hyperparameter Optimizationcs.LG
YAHPO Gym introduces a new benchmark for evaluating hyperparameter optimization methods.
problem Evaluating and comparing hyperparameter optimization methods on well-curated benchmark suites.
method Surrogate-based benchmark collection of 14 scenarios, each with multi-fidelity and multi-objective hyperparameter optimization problems.
result Surrogate-based benchmarks produce more faithful results than tabular benchmarks.
New method speeds up NIR spectroscopy calibration by 400x.
problem Efficient preprocessing selection in NIR spectroscopy.
method Operator-adaptive PLS and Ridge regression.
result Significant reduction in fitting time with comparable prediction quality.
Paper connects neural network hyperparameter optimization and NAS to structured sparse recovery.
problem Hyperparameter optimization and neural architecture search in neural networks.
method Structured sparse recovery methods applied to HPO and NAS.
result Improvements in hyperparameter optimization and discovery of novel neural architectures.
Decoupled PFNs: Identifiable Epistemic-Aleatoric Decomposition via Structured Synthetic Priorsstat.ML
Decoupled PFNs improve sequential decision-making by separating epistemic and aleatoric uncertainties.
problem Sequential decision-making requires distinguishing between epistemic uncertainty about latent signals and irreducible aleatoric observation noise.
method Developed a decoupled PFN architecture that uses query-level labels to train separate heads for latent signal and aleatoric noise.
result Empirically, decoupled PFNs mitigate the failure mode of total-variance exploration in noisy and heteroscedastic settings.
Improved hyperparameter optimization using simplified Transformer blocks.
problem Discovering optimal architectures in high-dimensional search spaces with limited exploration budgets.
method Simplified Transformer block for modeling hyper-parameter dependencies, actor-critic style algorithm, ensembling.
result Outperformed most algorithms on NAS-Bench-101 and Random Search in discovering more accurate model architectures.
Hybrid Policy Optimization tackles reinforcement learning in hybrid spaces, improving performance over PPO.
problem Credit assignment issues and biased gradients in hybrid discrete-continuous action spaces.
method Mixed gradient estimator combining pathwise and score-function gradients, reformulating problems in hybrid form.
result HPO substantially outperforms PPO on inventory control and switched systems, with performance gaps increasing with continuous action dimension.
BiSHop tackles tabular data challenges with sparse Hopfield layers.
problem Non-rotationally invariant data structure and feature sparsity in tabular data.
method Sequential column-wise and row-wise processing through interconnected directional learning modules with generalized sparse modern Hopfield layers.
result BiSHop surpasses current SOTA methods with significantly less hyperparameter tuning.
A new Bayesian optimization method using Poisson process for better noise robustness.
problem Estimating relative rankings of candidates in noisy environments.
method Poisson process-based ranking surrogate model and tailored acquisition functions.
result PoPBO framework shows lower computation costs and better robustness to noise compared to GP-BO.
New method improves Bayesian optimization by considering budget and prior quality.
problem Bayesian optimization lacks conditional treatment effects for specific contexts.
method Portable Regime Score (PRS) and RegimePlanner approach.
result Changing budget reverses optimization outcomes, and PRS predicts winners.
πBO augments BO with user beliefs for better hyperparameter optimization.
problem BO ignores user beliefs, reducing its appeal to practitioners.
method Proposes BO, an acquisition function that incorporates user-provided prior beliefs.
result BO outperforms competing approaches and deep learning tasks.
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.
PED-ANOVA efficiently calculates HP importance in arbitrary subspaces.
problem Understanding the role of different hyperparameters in arbitrary subspaces.
method Derive a novel f-ANOVA formulation for arbitrary subspaces and use Pearson divergence (PED) for a closed-form calculation of HP importance.
result Demonstrates successful identification of important HPs in different subspaces.