A Hybrid Monte Carlo Architecture for Parameter Optimization
James Brofos

TL;DR
This paper introduces a hybrid Monte Carlo algorithm that leverages confidence intervals and uncertainties for hyper-parameter optimization, demonstrating competitive performance against existing Bayesian methods.
Contribution
The paper presents a novel hybrid Monte Carlo approach that improves hyper-parameter optimization by exploiting confidence intervals, offering an alternative to expected improvement maximization.
Findings
Effective in machine learning hyper-parameter tuning
Competitive with expected improvement methods
Shows promise in targeted parameter space exploration
Abstract
Much recent research has been conducted in the area of Bayesian learning, particularly with regard to the optimization of hyper-parameters via Gaussian process regression. The methodologies rely chiefly on the method of maximizing the expected improvement of a score function with respect to adjustments in the hyper-parameters. In this work, we present a novel algorithm that exploits notions of confidence intervals and uncertainties to enable the discovery of the best optimal within a targeted region of the parameter space. We demonstrate the efficacy of our algorithm with respect to machine learning problems and show cases where our algorithm is competitive with the method of maximizing expected improvement.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGaussian Processes and Bayesian Inference · Advanced Multi-Objective Optimization Algorithms · Machine Learning and Data Classification
