arXiv (All)
open access
Parallel Multi-Fidelity Expected Improvement Method for Efficient Global Optimization
Multi-Fidelity optimization (MFO) has received extensive attentions in engineering design, which resorts to augmenting the small number of expensive high-fidelity (HF) samples by a large number of low-fidelity (LF) but cheap samples to improve the optimization performance. A key factor that influenc
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
- An Adaptive KKT-Based Indicator for Convergence Assessment in Multi-Objective Optimization#1076042
- A Multi-Dimensional, Per-Pass Empirical Study of the LLVM Optimization Pipeline#324969
- Decentralized Nonconvex Optimization under Heavy-Tailed Noise: Normalization and Optimal Convergence#147084
- Qwen-Image-Flash: Rethinking the Training Recipe for Few-Step Distillation#1084232
- ExPLoRe: Expert Patch-Level Loss Routing for Multi-Objective Masked Image Modeling#1049896
Record · ID 1063539
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