Research map / Bandits and online learning / Multi-armed bandits
Provably Efficient Multi-Objective Bandit Algorithms Under Preference-Centric Customization
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Direct Preference-Based Evolutionary Multi-Objective Optimization with Dueling Bandits (NeurIPS 2024 · similarity 0.89)
- Hierarchize Pareto Dominance in Multi-Objective Stochastic Linear Bandits (AAAI 2024 · similarity 0.87)
- Thompson Sampling for Multi-Objective Linear Contextual Bandit (NeurIPS 2025 · similarity 0.86)
- Forced Exploration in Bandit Problems (AAAI 2024 · similarity 0.86)
- FraPPE: Fast and Efficient Preference-Based Pure Exploration (NeurIPS 2025 · similarity 0.86)
- Multi-Objective Bayesian Optimization with Active Preference Learning (AAAI 2024 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.