arXiv (All)
open access
Few-for-Many Best-Arm Identification in Multi-Objective Bandits
Real-world systems often serve many objectives but can deploy only a few options, whose performance must be learned from noisy feedback. Modeling each option as an arm in a multi-objective bandit, we introduce \emph{few-for-many best-arm identification}, which seeks a small set of arms minimizing th
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
- Multi-Objective Bayesian Optimization via Adaptive \varepsilon-Constraints Decomposition#31292
- Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise#670344
- Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise#668279
- Ensembles of Exactly Solved Subsamples for Clusterwise Regression: Trimming Without a Trimming Level#1105577
- Learning and identification in complex systems through multi-objective optimization#8245
Record · ID 1341723
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