Cover Image

Exploiting Adjacent Similarity in Multi-Armed Bandit Tasks via Transfer of Reward Samples

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Rahul, NR, Katewa, Vaibhav
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Transfer in Sequential Multi-armed Bandits via Reward Samples
by: R, Rahul N, et al.
Published: (2024)

Global Rewards in Restless Multi-Armed Bandits
by: Raman, Naveen, et al.
Published: (2024)

Multi-Armed Bandits With Machine Learning-Generated Surrogate Rewards
by: Ji, Wenlong, et al.
Published: (2025)

Open Problem: Tight Bounds for Kernelized Multi-Armed Bandits with Bernoulli Rewards
by: Mussi, Marco, et al.
Published: (2024)

Multi-Armed Bandits with Interference
by: Jia, Su, et al.
Published: (2024)

Imprecise Multi-Armed Bandits
by: Kosoy, Vanessa
Published: (2024)

Improving Reward-Conditioned Policies for Multi-Armed Bandits using Normalized Weight Functions
by: Xu, Kai, et al.
Published: (2024)

LASeR: Learning to Adaptively Select Reward Models with Multi-Armed Bandits
by: Nguyen, Duy, et al.
Published: (2024)

Flickering Multi-Armed Bandits
by: Chakraborty, Sourav, et al.
Published: (2026)

Multi-Armed Bandits with Network Interference
by: Agarwal, Abhineet, et al.
Published: (2024)

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

Rising Multi-Armed Bandits with Known Horizons
by: Song, Seockbean, et al.
Published: (2026)

Collaborating in Multi-Armed Bandits with Strategic Agents
by: Barnea, Idan, et al.
Published: (2026)

On the Regularity and Fairness of Combinatorial Multi-Armed Bandit
by: Wu, Xiaoyi, et al.
Published: (2025)

Introduction to Multi-Armed Bandits
by: Slivkins, Aleksandrs
Published: (2019)

Autonomous Drug Design with Multi-Armed Bandits
by: Svensson, Hampus Gummesson, et al.
Published: (2022)

On the Optimal Sample Complexity of Offline Multi-Armed Bandits with KL Regularization
by: Ji, Kaixuan, et al.
Published: (2026)

Reward Maximization for Pure Exploration: Minimax Optimal Good Arm Identification for Nonparametric Multi-Armed Bandits
by: Cho, Brian, et al.
Published: (2024)

Distributed Algorithms for Multi-Agent Multi-Armed Bandits with Collision
by: Zhou, Daoyuan, et al.
Published: (2025)

Optimism in the Face of Ambiguity Principle for Multi-Armed Bandits
by: Li, Mengmeng, et al.
Published: (2024)

Individual Regret in Cooperative Stochastic Multi-Armed Bandits
by: Barnea, Idan, et al.
Published: (2024)

Stochastic Multi-Armed Bandits with Limited Control Variates
by: Verma, Arun, et al.
Published: (2026)

Federated Multi-Armed Bandits Under Byzantine Attacks
by: Saday, Artun, et al.
Published: (2022)

Byzantine-Resilient Decentralized Multi-Armed Bandits
by: Zhu, Jingxuan, et al.
Published: (2023)

Multi-Armed Bandits With Best-Action Queries
by: Bacchiocchi, Francesco, et al.
Published: (2026)

An LP-based Sampling Policy for Multi-Armed Bandits with Side-Observations and Stochastic Availability
by: Soni, Ashutosh, et al.
Published: (2026)

Adversarial Attacks on Combinatorial Multi-Armed Bandits
by: Balasubramanian, Rishab, et al.
Published: (2023)

Unlearning Offline Stochastic Multi-Armed Bandits
by: Ye, Zichun, et al.
Published: (2026)

Heterogeneous Multi-Player Multi-Armed Bandits Robust To Adversarial Attacks
by: Magesh, Akshayaa, et al.
Published: (2025)

On the Low-Complexity of Fair Learning for Combinatorial Multi-Armed Bandit
by: Wu, Xiaoyi, et al.
Published: (2025)

Graph-Dependent Regret Bounds in Multi-Armed Bandits with Interference
by: Jamshidi, Fateme, et al.
Published: (2025)

Dual-Mandate Patrols: Multi-Armed Bandits for Green Security
by: Xu, Lily, et al.
Published: (2020)

Collaborative Min-Max Regret in Grouped Multi-Armed Bandits
by: Blanchard, Moïse, et al.
Published: (2025)

MARBLE: Multi-Armed Restless Bandits in Latent Markovian Environment
by: Amiri, Mohsen, et al.
Published: (2025)

Non-Stationary Restless Multi-Armed Bandits with Provable Guarantee
by: Hung, Yu-Heng, et al.
Published: (2025)

Constrained Feedback Learning for Non-Stationary Multi-Armed Bandits
by: Li, Shaoang, et al.
Published: (2025)

Kullback-Leibler Maillard Sampling for Multi-armed Bandits with Bounded Rewards
by: Qin, Hao, et al.
Published: (2023)

Fair Algorithms with Probing for Multi-Agent Multi-Armed Bandits
by: Xu, Tianyi, et al.
Published: (2025)

Stealthy Adversarial Attacks on Stochastic Multi-Armed Bandits
by: Wang, Zhiwei, et al.
Published: (2024)

Multi-Armed Bandits with Minimum Aggregated Revenue Constraints
by: Yahmed, Ahmed Ben, et al.
Published: (2025)