Research map / Bandits and online learning / Contextual bandits and Thompson sampling
Value-at-Risk Optimization with Gaussian Processes
Quoc Phong Nguyen, Zhongxiang Dai, Bryan Kian Hsiang Low, Patrick Jaillet
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 changed | Where | Measured | Effect |
|---|---|---|---|
| Use V-UCB Unif instead of ρKG^apx | VaR optimization on Branin-Hoo-(1,1) and Goldstein-Price-(1,1) with finite Z · Branin-Hoo-(1,1) and Goldstein-Price-(1,1), finite Z | VaR regret | No clear effect |
| Use V-UCB Unif instead of ρKG^apx | VaR optimization on Hartmann-(1,2) and Hartmann-(2,1) with finite Z · Hartmann-(1,2) and Hartmann-(2,1), finite Z | VaR regret | Improved |
| Select the lacing value with maximum probability mass instead of a random lacing value (ablation) | V-UCB on synthetic benchmarks with finite Z · Synthetic benchmarks, finite Z | VaR regret | Improved |
| Use V-UCB Prob instead of ρKG^apx | VaR optimization on synthetic benchmarks with continuous Z · Synthetic benchmarks, continuous Z | VaR regret | Improved |
| Use V-UCB Prob instead of ρKG^apx | VaR optimization · Portfolio optimization | VaR regret | Improved |
| Use V-UCB instead of ρKG^apx | VaR optimization · Robot pushing | VaR regret | Improved |
| Choose the maximum-probability lacing value instead of a random lacing value (ablation) | V-UCB on robot pushing · Robot pushing | VaR regret | No clear effect |
Closest papers by meaning
- Optimizing Conditional Value-At-Risk of Black-Box Functions (NeurIPS 2021 · similarity 0.90)
- Meta-VBO: Utilizing Prior Tasks in Optimizing Risk Measures with Gaussian Processes (ICLR 2024 · similarity 0.88)
- Gaussian Process Upper Confidence Bound Achieves Nearly-Optimal Regret in Noise-Free Gaussian Process Bandits (NeurIPS 2025 · similarity 0.85)
- Non-Asymptotic and Non-Lipschitzian Bounds on Optimal Values in Stochastic Optimization Under Heavy Tails (ICML 2025 · similarity 0.84)
- Improved Regret Analysis in Gaussian Process Bandits: Optimality for Noiseless Reward, RKHS norm, and Non-Stationary Variance (ICML 2025 · similarity 0.84)
- Risk Estimation in a Markov Cost Process: Lower and Upper Bounds (ICML 2024 · similarity 0.84)
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.
