arXiv (All)
open access
Portfolio-Based Constrained Multi-Objective Bayesian Optimization for Materials Design
Materials discovery and design campaigns can be formulated as constrained multi-objective Bayesian optimization (CMOBO) problems, within which each experimental decision negotiates between two coupled but competing goals: discovering feasible candidates and refining the underlying Pareto front. Here
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Simple Extensions of Single-Objective Acquisition Functions and Hedge Strategies for Multi-Objective Bayesian Optimization#1115896
- Multi-Objective Bayesian Optimization via Adaptive \varepsilon-Constraints Decomposition#31292
- Matbench Discovery - Model Predictions for Geometry Optimization#408484
- A Polynomial-Time Inner Approximation Algorithm for Multi-Objective and Parametric Optimization#179151
- LEMUR: Learning to Align with Multi-Objective Reinforcement Learning from Preference Feedback#422286
Record · ID 1014142
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive