Cover Image

On Pareto Optimality for Parametric Choice Bandits

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zuo, Jierui, Qin, Hanzhang
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Causal Bandits: The Pareto Optimal Frontier of Adaptivity, a Reduction to Linear Bandits, and Limitations around Unknown Marginals
by: Liu, Ziyi, et al.
Published: (2024)

Near Optimal Adversarial Attacks on Stochastic Bandits and Defenses with Smoothed Responses
by: Zuo, Shiliang
Published: (2020)

Constrained Pareto Set Identification with Bandit Feedback
by: Kone, Cyrille, et al.
Published: (2025)

Sequential Learning of the Pareto Front for Multi-objective Bandits
by: Crépon, Elise, et al.
Published: (2025)

Bandit Pareto Set Identification: the Fixed Budget Setting
by: Kone, Cyrille, et al.
Published: (2023)

Physics-Informed Parametric Bandits for Beam Alignment in mmWave Communications
by: Qin, Hao, et al.
Published: (2025)

DDO-RM: Distribution-Level Policy Improvement after Reward Learning
by: Zhang, Tiantian, et al.
Published: (2026)

Bandit Pareto Set Identification in a Multi-Output Linear Model
by: Kone, Cyrille, et al.
Published: (2025)

Robust Pareto Set Identification with Contaminated Bandit Feedback
by: Korkmaz, İlter Onat, et al.
Published: (2022)

Revisiting Weighted Strategy for Non-stationary Parametric Bandits and MDPs
by: Wang, Jing, et al.
Published: (2026)

syftr: Pareto-Optimal Generative AI
by: Conway, Alexander, et al.
Published: (2025)

Optimal Thresholding Linear Bandit
by: Rivera, Eduardo Ochoa, et al.
Published: (2024)

Optimal Regret for Single Index Bandits
by: Dey, Devdan, et al.
Published: (2026)

Pareto-Optimal Energy Alignment for Designing Nature-Like Antibodies
by: Wen, Yibo, et al.
Published: (2024)

Choice of Scoring Rules for Indirect Elicitation of Properties with Parametric Assumptions
by: Hu, Lingfang, et al.
Published: (2025)

Linear Bandits beyond Inner Product Spaces, the case of Bandit Optimal Transport
by: Croissant, Lorenzo
Published: (2025)

Online Resource Allocation with Non-Stationary Customers
by: Zhang, Xiaoyue, et al.
Published: (2024)

Optimal Batched Linear Bandits
by: Ren, Xuanfei, et al.
Published: (2024)

Optimal Clustering with Bandit Feedback
by: Yang, Junwen, et al.
Published: (2022)

User Preference Meets Pareto-Optimality in Multi-Objective Bayesian Optimization
by: Ip, Joshua Hang Sai, et al.
Published: (2025)

Adaptive Combinatorial Experimental Design: Pareto Optimality for Decision-Making and Inference
by: Xie, Hongrui, et al.
Published: (2026)

Stochastic Bandits Robust to Adversarial Attacks
by: Wang, Xuchuang, et al.
Published: (2024)

Domain Generalization via Pareto Optimal Gradient Matching
by: Do, Khoi, et al.
Published: (2025)

Pareto-Optimal Learning from Preferences with Hidden Context
by: Bahlous-Boldi, Ryan, et al.
Published: (2024)

Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions
by: Ghaffari, Fatemeh, et al.
Published: (2024)

Optimal and Practical Batched Linear Bandit Algorithm
by: Yu, Sanghoon, et al.
Published: (2025)

Linear Bandits on Ellipsoids: Minimax Optimal Algorithms
by: Zhang, Raymond, et al.
Published: (2025)

Asymptotically-Optimal Gaussian Bandits with Side Observations
by: Atsidakou, Alexia, et al.
Published: (2025)

EVaR-Optimal Arm Identification in Bandits
by: Ahmadipour, Mehrasa, et al.
Published: (2025)

Nearly-Optimal Algorithm for Adversarial Kernelized Bandits
by: Iwazaki, Shogo
Published: (2026)

Near-Optimal Regret in Adversarial Kernel Bandits
by: Zhang, Yu-Jie, et al.
Published: (2026)

Optimal Streaming Algorithms for Multi-Armed Bandits
by: Jin, Tianyuan, et al.
Published: (2024)

Optimal Regret for Policy Optimization in Contextual Bandits
by: Levy, Orin, et al.
Published: (2026)

Lasso Bandit with Compatibility Condition on Optimal Arm
by: Lee, Harin, et al.
Published: (2024)

Near Optimal Pure Exploration in Logistic Bandits
by: Rivera, Eduardo Ochoa, et al.
Published: (2024)

A Cycle-Consistency Constrained Framework for Dynamic Solution Space Reduction in Noninjective Regression
by: Jia, Hanzhang, et al.
Published: (2025)

Toward Finding Strong Pareto Optimal Policies in Multi-Agent Reinforcement Learning
by: Le, Bang Giang, et al.
Published: (2024)

Overcoming Brittleness in Pareto-Optimal Learning-Augmented Algorithms
by: Angelopoulos, Spyros, et al.
Published: (2024)

Pareto-Optimal Anytime Algorithms via Bayesian Racing
by: Wurth, Jonathan, et al.
Published: (2026)

Nearly Minimax Optimal Submodular Maximization with Bandit Feedback
by: Tajdini, Artin, et al.
Published: (2023)