arXiv Machine Learning By Weibo Huang, Cheng Hua

ALAS: Additive Learnable Alpha-Stable Kernels for Flexible Bayesian Optimization

Read the original on arXiv Machine Learning →

arXiv:2607. 18282v1 Announce Type: new Abstract: Bayesian Optimization is widely used for expensive black-box optimization, yet its success often depends on choosing a kernel that matches the objective's unknown structure.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Jul 7

Local Constrained Bayesian Optimization

arXiv:2603. 07965v2 Announce Type: replace-cross Abstract: Bayesian optimization (BO) for high-dimensional constrained problems remains a significant challenge due to the curse of dimensionality.

By Jing Jingzhe, Fan Zheyi, Szu Hui Ng, Qingpei Hu
arXiv Machine Learning
Sep 18

Online Adaptive Kernel Mixing for Gaussian Process Decision Making

The paper introduces HACK GPs, a method that treats kernel selection for Gaussian Processes as an online learning problem with expert advice. Each candidate kernel is viewed as a GP expert, and a distribution over these experts is updated online using AdaHedge based on a loss that reflects both function fit and task alignment. Two variants—Mixture of Gaussians and categorical sampling—are presented, with theoretical guarantees that the weight concentrates on the best kernel under a loss‑gap condition, and empirical results show robust performance across Bayesian optimization, level set estimation, and Bayesian active learning compared to standard kernels and simple ensembles.

By Kavin Aravindan, Mani Tej Sriram, Gautam Dasarathy, Tejas Bodas
arXiv Machine Learning
Sep 25

MF-SCBO : Multi-fidelity Scalable Constrained Bayesian Optimization

MF-SCBO is a new multi‑fidelity extension of Scalable Constrained Bayesian Optimization designed for high‑dimensional black‑box functions with black‑box constraints. It handles an arbitrary number of fidelity levels and non‑nested sampling, addressing gaps in existing methods. Experiments on standard benchmarks and challenging problems show that MF‑SCBO generally converges faster than both single‑fidelity SCBO and other multi‑fidelity approaches in high‑dimensional constrained settings.

By Lucas Palazzolo, Micka\"el Binois, La\"etitia Giraldi