AI Paper Atlas

Research map / Probabilistic and scientific modeling / Bayesian optimization

Sub-linear Regret Bounds for Bayesian Optimisation in Unknown Search Spaces

Hung Tran-The, Sunil Gupta, Santu Rana, Huong Ha, Svetha Venkatesh

NeurIPS 2020 · Probabilistic and scientific modeling › Bayesian optimization · approach: Regret bounds for Bayesian optimization · 0 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use hyperharmonic expansion and shift the search space toward the best point found so farHuBO · Benchmark functions, low dimensionslog distance to true optimumImproved
Use hyperharmonic expansion and shift the search space toward the best point found so farHuBO · Elastic Net on MNISTprediction accuracyImproved
Restrict acquisition optimisation to a growing set of small hypercubesHD-HuBO · Benchmark functions, high dimensionslog distance to true optimumImproved
Restrict acquisition optimisation to a growing set of small hypercubesHD-HuBO · Elastic Net on MNISTprediction accuracyHurt
Use HD-HuBO for neural-network parameter optimisationTwo-layer neural network · MNIST validation datasetvalidation lossImproved
Use smaller α, including α = -1 rather than α = -0.95 or α = -0.9 (ablation)HuBO · 5-dim AckleyregretImproved
Increase λ from 0.2 or 0.5 to 1 (ablation)HD-HuBO · High-dimensional AckleyregretImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy