arXiv (All)
open access
Adaptive Partitioning Schemes for Optimistic Optimization
Applications such as engineering design often require us to optimize a black-box function, i.e., a system whose inner processing is not analytically known and whose gradients are not available. Practitioners often have a fixed budget for the number of function evaluations and the performance of an o
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
- The Adaptive Blindspot: How Efficiency Pruning Can Make Advanced Systems More Fragile#722474
- Why Adaptive Optimizers Underestimate Rare Tokens#1141856
- Compression and federated learning: an approach to frugal machine learning. (Compression et apprentissage fédéré: une approche pour l'apprentissage machine frugal).#489533
- JetSpec++: Foresight Parallel Drafting with Self Refinements#1356171
- TreeRedux: Separating Concerns in Spark's Distributed Tree Aggregation#975055
Record · ID 1199313
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