arxiv
PublishedJuly 31, 2026 at 4:00 AM
—neutral
Top-$k$ Pareto Bandits: Hypervolume Regret for Multi-Objective Slate Selection
Publisher summary· verbatim
arXiv:2607.26273v1 Announce Type: cross Abstract: We consider a stochastic multi-objective bandit problem where, at each round, the agent selects a slate of $k$ arms and observes their $d$-dimensional reward vectors under semi-bandit feedback. We do not aim at identifying a single optimal arm; inste
Stay posted· Newsletter
Three short emails a week: Monday, Wednesday and Friday. Top movers, new models and the most-referenced story.
Your email is used only to send The Bubble Brief. Privacy policy
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivCascadeLedger: Counterfactual Auditing of Information and Resource Integrity in LLM Cascades3harxivGibbs-Gap Policy Optimization for Off-Policy RL with Verifiable Rewards3harxivCogDrift-4D: Hierarchical Multimodal Modeling of Temporal Behavioral Decay for MCI Detection3harxivTask-Centric Multimodal Learning for Cognitive Impairment Detection3hThe Bubble Brief
MON · WED · FRIRead AI insights every Monday, Wednesday and Friday — top movers, new models, story of the week.
Your email is used only to send The Bubble Brief. Privacy policy
Originally published on arxiv ↗