atlas

Research map / Probabilistic and scientific modeling / Bayesian optimization

Distributionally-Aware Kernelized Bandit Problems for Risk Aversion

ICML 2022 · Probabilistic and scientific modeling › Bayesian optimization · approach: Regret bounds for Bayesian optimization

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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 PKE model with UCB for CVaR (CVPKE-UCB) instead of IGP-UCB mean-based baselinekernelized CVaR bandit · Synthetic normal and log-normal environments, alpha in {0.05,0.1,0.5,0.9,0.95}cumulative CVaR regretHelped
Use CVPKE-UCB instead of IGP-UCB when CVaR level alpha is close to 1 (near expectation) on normal environmentskernelized CVaR bandit · Synthetic normal environments, alpha=0.95cumulative CVaR regretHurt
Use CVPKE-UCB instead of IGP-UCB in some settings where baseline incurs linear regretkernelized CVaR bandit · Synthetic normal and log-normal environmentssublinear vs linear cumulative regretHelped
Phased elimination algorithm CVPKE-PH with finitely many arms (vs CVPKE-UCB)kernelized CVaR bandit with Matern kernels · Theory (regret bound)regret orderHelped

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