Research map / Reinforcement learning / Policy gradient and actor-critic
Offline Multi-Objective Bandits: From Logged Data to Pareto-Optimal Policies
Ji Cheng, Song Lai, Shunyu Yao, Bo Xue
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| add pessimistic lower-confidence-bound action selection instead of greedy decisions (ablation) | OffMOB (neural reward models) · synthetic nonlinear multi-objective contextual bandits (m=3, d=20, K=30) | Tchebycheff sub-optimality | Improved |
| add pessimism to a fixed-feature neural linear model (MONeuralLinLCB vs MONeuralLinGreedy) (ablation) | MONeuralLinLCB · synthetic nonlinear multi-objective contextual bandits | Tchebycheff sub-optimality | No clear effect |
| use trainable neural networks in NTK space instead of linear, kernel or fixed-feature models | OffMOB · synthetic nonlinear multi-objective contextual bandits | Tchebycheff sub-optimality | Improved |
| increase observation noise sigma from 0.01 to 0.5 (ablation) | OffMOB and baselines · quadratic reward, sigma 0.01, 0.1, 0.5 | Tchebycheff sub-optimality | Hurt |
| use OffMOB under higher noise relative to next-best methods | OffMOB · quadratic reward, sigma = 0.5 | Tchebycheff sub-optimality | Improved |
Closest papers by meaning
- Leveraging (Biased) Information: Multi-armed Bandits with Offline Data (ICML 2024 · similarity 0.89)
- Regret minimization in Linear Bandits with offline data via extended D-optimal exploration. (NeurIPS 2026 · similarity 0.89)
- Causal Bandits: The Pareto Optimal Frontier of Adaptivity, a Reduction to Linear Bandits, and Limitations around Unknown Marginals (ICML 2024 · similarity 0.89)
- Thompson Sampling for Multi-Objective Linear Contextual Bandit (NeurIPS 2025 · similarity 0.89)
- Robustly Improving Bandit Algorithms with Confounded and Selection Biased Offline Data: A Causal Approach (AAAI 2024 · similarity 0.88)
- Offline Multi-Objective Optimization (ICML 2024 · similarity 0.88)
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.
