# CAP: Learning to Optimize from Sparse Observations of Related Tasks

DevFeed: [CAP: Learning to Optimize from Sparse Observations of Related Tasks](<https://devfeed.tech/articles/cap-learning-to-optimize-from-sparse-observations-of-related-tasks-111551.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2610.41173>)

Author: Lin Fu, Siwei Fu, Dong Ni

Published: 2026-11-02T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Model Development](<https://devfeed.tech/topics/model-development.md>), [Hyperparameter optimization](<https://devfeed.tech/topics/hyperparameter-optimization.md>), [decision-making](<https://devfeed.tech/topics/decision-making.md>)

Tags: [acquisition](<https://devfeed.tech/tags/acquisition.md>), [adaptive](<https://devfeed.tech/tags/adaptive.md>), [benchmarks](<https://devfeed.tech/tags/benchmarks.md>), [budget](<https://devfeed.tech/tags/budget.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [experiment](<https://devfeed.tech/tags/experiment.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [feedback](<https://devfeed.tech/tags/feedback.md>), [learning](<https://devfeed.tech/tags/learning.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [optimize](<https://devfeed.tech/tags/optimize.md>), [performance](<https://devfeed.tech/tags/performance.md>), [policy](<https://devfeed.tech/tags/policy.md>), [query](<https://devfeed.tech/tags/query.md>), [records](<https://devfeed.tech/tags/records.md>), [sample](<https://devfeed.tech/tags/sample.md>), [simulation](<https://devfeed.tech/tags/simulation.md>), [structure](<https://devfeed.tech/tags/structure.md>), [synthetic](<https://devfeed.tech/tags/synthetic.md>), [tasks](<https://devfeed.tech/tags/tasks.md>)

## AI overview

CAP learns a feedback-conditioned query policy from sparse records of completed related optimization campaigns. It models shared structure and task-specific variation to create interactive practice functions, then uses observations from a new task to guide each next query while keeping policy parameters fixed. Across five synthetic task families at 6 and 20 dimensions and the BOPTEST and SU2 engineering simulation benchmarks, CAP had the lowest median final-budget value among reported methods on four synthetic families and both benchmarks. The evidence is limited to the abstract's reported results.

## Source excerpt

arXiv:2610.41173v1 Announce Type: new Abstract: In experiment-driven black-box optimization, each evaluation can consume materials, equipment time, and other resources, limiting the number of experiments available for a new task. Records from completed related optimization campaigns could help, but learning a sequential query policy remains challenging when task-specific experience consists of only a few sparse histories. We propose CAP (Candidate Acquisition Policy), which models shared structure and task-specific variation in fixed historical records to sample interactive practice functions. On these functions, CAP learns a feedback-conditioned query policy aimed at final optimization performance under a fixed evaluation budget. At deployment, its parameters remain fixed while each new observation informs the next query. Across five synthetic task families spanning 6 and 20 dimensions and two engineering simulation benchmarks, BOPTEST and SU2, CAP attains the lowest median final-budget value among the reported methods on four synthetic families and both engineering benchmarks. These results indicate that sparse records from completed related tasks can support adaptive query decisions on new tasks, making more effective use of limited, costly experimental evaluations.