Skip to content
Open access

A Center-Guided Reinforcement Learning Method for Hyperparameter Optimization and Its Application to Relation Extraction

Aug 2026 · Machine Learning and Knowledge Extraction · 0 citations · 26 references

TL;DR

The effectiveness of CGRL for limited-budget HPO and its applicability to practical RE tasks are demonstrated and a process-aware reward provides dense and informative feedback for policy learning.

Abstract

Hyperparameter optimization (HPO) aims to identify high-quality model configurations under a limited evaluation budget. To address mixed search spaces, sparse feedback, and low sample efficiency in reinforcement learning (RL)-based HPO, a Center-Guided Reinforcement Learning (CGRL) method is proposed. In CGRL, the policy output is reformulated from a configuration to be directly evaluated into a search center that defines a promising region, decoupling region-level guidance from exact configuration selection. A mixed candidate pool is generated around the center, and a promising candidate for real evaluation is selected by a Random Forest surrogate model. Meanwhile, a process-aware reward provides dense and informative feedback for policy learning. Experiments on 20 Yet Another Hyperparameter Optimization (YAHPO) Gym environments validate the effectiveness of CGRL. Compared with random search (RS), Tree-structured Parzen Estimator (TPE), Sequential Model-based Algorithm Configuration 3 (SMAC3), a Proximal Policy Optimization baseline (PPO-basic), Hyperparameter Optimization by Reinforcement Learning (Hyp-RL), and Q-Learning for Hyperparameter Optimization (HyperQ-Opt), CGRL achieves the best average rank of 1.800 in terms of the final best objective value, versus 6.000, 3.600, 2.200, 4.450, 6.350, and 3.600, respectively. For Low-Rank Adaptation (LoRA) HPO for relation extraction (RE) from ancient Chinese historical documents, CGRL improves Macro-F1 by 8.66%, 3.10%, 3.18%, and 5.13% on the validation set relative to RS, TPE, SMAC3, and PPO, respectively, and by 11.15%, 2.03%, 3.11%, and 9.59% on the test set. These results demonstrate the effectiveness of CGRL for limited-budget HPO and its applicability to practical RE tasks.

Read PDF

Similar papers

#natural language process... Preprint Sep 2026

Expert-Space Exploration in MoE Reinforcement Learning

ESRL is introduced, an architecture-aware framework that explicitly explores the expert-routing space of MoE models, and preserves high-confidence experts as anchors, and restricts stochastic routing to a plausible candidate pool, thereby retaining reliable computation paths.

Hong-Yi He, Zheng-Wen Lin, Xiao Liu et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Difficulty-Adaptive Tree-Structured Policy Optimization for Expanding Reasoning Coverage in RLVR

DATPO (Difficulty-Adaptive Sentence-entropy-guided Tree-structured Policy Optimization) integrates difficulty-adaptive tree search with a sibling-diversity advantage term, explicitly promoting semantic diversity to expand reasoning coverage during training.

Young Kyu Yu, Sanghwan Jang, Hwanjo Yu · 2 citations
Preprint Aug 2026

CAS: Conformalized Agentic Search via Adaptive Retrieval and Policy Weighting

Experiments across single-hop and multi-hop QA datasets demonstrate that the Conformal Prediction and Conformalized Agentic Search framework significantly improves reasoning accuracy while drastically reducing redundant tool invocations, establishing a highly reliable and efficient agent paradigm.

Zixi Zhu, Jiayuan Su, Jian Zhang et al. · 0 citations
#machine learning Preprint Sep 2026

GEM-MPC: Balancing Exploration and Exploitation through Expert-Guided Planning

GEM-MPC is proposed, an MPPI-based reinforcement learning method that improves the interaction between planning and learning and selectively learns from stored planning distributions only when they provide a better target than the current prior, reducing the impact of stale planning data without requiring full reanalys...

Álvaro Serra-Gómez, Thomas Moerland · 0 citations
#machine learning Preprint Sep 2026

Reinforcement learning to choose optimizers

Reinforcement Learning to Choose Optimizers is introduced, which formulates the optimization algorithm choice as a sequential decision-making problem and outperforms every portfolio optimizer at all but the smallest budgets.

Martin P van der Schelling, D. Toshniwal, M. A. Bessa · 0 citations

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