Vector optimization with Gaussian process bandits
From MaRDI portal
Cites work
- An interactive evolutionary metaheuristic for multiobjective combinatorial optimization
- Bayesian optimization
- CVXPY: a Python-embedded modeling language for convex optimization
- Evolutionary multi-criterion optimization. 6th international conference, EMO 2011, Ouro Preto, Brazil, April 5--8, 2011. Proceedings
- Global optimization based on active preference learning with radial basis functions
- Hedging and liquidation under transaction costs in currency markets
- Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting
- Introduction to Real Analysis
- Multiobjective optimization of expensive-to-evaluate deterministic computer simulator models
- Multiobjective optimization using Gaussian process emulators via stepwise uncertainty reduction
- No-regret Bayesian optimization with unknown hyperparameters
- Relative importance of criteria in multiobjective programming: a cone-based approach
- SMS-EMOA: multiobjective selection based on dominated hypervolume
- Set optimization and applications -- the state of the art. From set relations to set-valued risk measures
- The \(K\)-armed dueling bandits problem
- X-armed bandits
- -PAL: an active learning approach to the multi-objective optimization problem
This page was built for publication: Vector optimization with Gaussian process bandits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7227815)
