Skip to content
Preprint

Constrained Hyperparameter Optimization for Streaming Data

Aug 2026 · 0 citations · 29 references
Computer Science

TL;DR

This study introduces four strategies to navigate boundary constraints in online optimization algorithms and demonstrates that adopting boundary strategies outperforms the"boundary"strategy.

Abstract

Optimization of hyperparameters is a critical factor to obtain optimal model performance. While existing research has predominantly concentrated on batch-learning scenarios, addressing the complexities inherent in data streams presents a challenge. The deployment of sophisticated methodologies to manage data streams becomes highly important. Consequently, the capacity for self-adjusting hyperparameters during on-line learning phases emerges as a goal. Many hyperparameters exhibit constraints and are confined within bounded search spaces, rendering specific solutions unacceptable upon applying optimization operators. To solve this issue, employing boundary constraint- handling techniques becomes imperative to rectify invalid solutions. This paper presents strategies for effectively managing boundary constraints within constrained numerical optimization problems. Recent methodologies, including heuristic and evolutionary-based optimization, employ a"boundary"strategy, wherein values that surpass boundary thresholds for a given hyperparameter are realigned to the respective limits. Our study introduces four strategies to navigate boundary constraints in online optimization algorithms. Through empirical investigations conducted on established datasets, we demonstrate that adopting boundary strategies outperforms the"boundary"strategy.

View source

Similar papers

Open access Sep 2026

Leveraging High-Performance Scientific Computing for the Limited-Memory Hyperparameter Tuning of Large-Scale Unconstrained Continuous Optimization Solvers

This work investigates a data-driven selection of the L-BFGS memory parameter (mem) for large-scale unconstrained optimization and proposes a two-stage hybrid machine-learning framework that predicts intermediate solver quantities and then forecasts runtime for each candidate memory value.

Yu-Chen Gao · 0 citations
Book Open access Sep 2026

TSMOO: Solving Multi-Objective Experimentation with Constrained Thompson Sampling

This work introduces TSMOO (Thompson Sampling with Multi-Objective Optimization), a method that bridges the gap by combining multi-metric optimization with continuous learning in batch traffic allocation and outperforming both single-metric and elimination-based baselines.

K. C. Kalagarla, Yi Liu, L. Chai et al. · 0 citations
#machine learning Preprint Sep 2026

Bilevel Optimization of Topology and Hyperparameters (BOTH)

It is shown that evaluating just one or two steps of TO is sufficiently informative and that the method scales favorably to thousands of hyperparameters at an expense comparable to only a few standard TO runs, and that the method scales favorably to thousands of hyperparameters at an expense comparable to only a few st...

Suryanarayanan Manoj Sanu, M. A. Bessa, A. M. Aragón · 0 citations
#machine learning Preprint Sep 2026

HyperMC: Multi-Fidelity Hyperparameter Tuning for Stochastic Gradient MCMC

Experiments on logistic regression, probabilistic matrix factorization, and Bayesian neural networks show that HyperMC improves posterior approximation or predictive calibration relative to MAMBA, grid search, and heuristic baselines, while Robust HyperMC yields more stable and reproducible tuning results.

Min-Chin Tan, Xi-Yun Jiao · 0 citations
Open access Sep 2026

Enhancing boundary optimality in constrained Bayesian optimization via exterior barrier functions

In Bayesian optimization frameworks, expected performance indicator-based acquisition functions, such as Expected Improvement and Expected Hypervolume Improvement, are among the most widely adopted approaches for both single- and multi-objective problems, and are readily extensible to constrained problems through sur...

S. Lim, P. Bekemeyer · 0 citations
#machine learning Preprint Sep 2026

Learning Where to Steer: Noise-Space Geometry for Efficient Offline Multi-Objective Optimization with Generative Models

Offline multi-objective optimization (MOO) seeks solutions with better objective trade-offs using only a fixed dataset, without querying the objectives. Diffusion models trained on such data have emerged as a promising approach, but their samples are not inherently better than the data and must be steered toward the Pa...

Yuan-Tong Lu, Esha Singh, Yi-An Ma et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.