Cover Image

Open Problem: Tight Bounds for Kernelized Multi-Armed Bandits with Bernoulli Rewards

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Mussi, Marco, Drago, Simone, Metelli, Alberto Maria
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

Generalized Kernelized Bandits: A Novel Self-Normalized Bernstein-Like Dimension-Free Inequality and Regret Bounds
by: Metelli, Alberto Maria, et al.
Published: (2025)

A Refined Analysis of UCBVI
by: Drago, Simone, et al.
Published: (2025)

Best Arm Identification for Stochastic Rising Bandits
by: Mussi, Marco, et al.
Published: (2023)

Rising Rested Bandits: Lower Bounds and Efficient Algorithms
by: Fiandri, Marco, et al.
Published: (2024)

Autoregressive Bandits
by: Bacchiocchi, Francesco, et al.
Published: (2022)

Bridging Rested and Restless Bandits with Graph-Triggering: Rising and Rotting
by: Genalti, Gianmarco, et al.
Published: (2024)

Learning Optimal Deterministic Policies with Stochastic Policy Gradients
by: Montenegro, Alessandro, et al.
Published: (2024)

Last-Iterate Global Convergence of Policy Gradients for Constrained Reinforcement Learning
by: Montenegro, Alessandro, et al.
Published: (2024)

Thompson Sampling-like Algorithms for Stochastic Rising Bandits
by: Fiandri, Marco, et al.
Published: (2025)

Information Capacity Regret Bounds for Bandits with Mediator Feedback
by: Eldowa, Khaled, et al.
Published: (2024)

Performance Improvement Bounds for Lipschitz Configurable Markov Decision Processes
by: Metelli, Alberto Maria
Published: (2024)

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

Robustness in the Face of Partial Identifiability in Reward Learning
by: Lazzati, Filippo, et al.
Published: (2025)

Reusing Trajectories in Policy Gradients Enables Fast Convergence
by: Montenegro, Alessandro, et al.
Published: (2025)

Power Grid Control with Graph-Based Distributed Reinforcement Learning
by: Fabrizio, Carlo, et al.
Published: (2025)

Learning Deterministic Policies with Policy Gradients in Constrained Markov Decision Processes
by: Montenegro, Alessandro, et al.
Published: (2025)

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

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

State and Action Factorization in Power Grids
by: Losapio, Gianvito, 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)

Generalizing Behavior via Inverse Reinforcement Learning with Closed-Form Reward Centroids
by: Lazzati, Filippo, et al.
Published: (2025)

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

Exploiting Adjacent Similarity in Multi-Armed Bandit Tasks via Transfer of Reward Samples
by: Rahul, NR, et al.
Published: (2024)

Algorithm Design and Stronger Guarantees for the Improving Multi-Armed Bandits Problem
by: Blum, Avrim, et al.
Published: (2025)

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

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

Asymptotically and Minimax Optimal Regret Bounds for Multi-Armed Bandits with Abstention
by: Yang, Junwen, et al.
Published: (2024)

Kernel $ε$-Greedy for Multi-Armed Bandits with Covariates
by: Arya, Sakshi, et al.
Published: (2023)

Reward Compatibility: A Framework for Inverse RL
by: Lazzati, Filippo, et al.
Published: (2025)

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

KernelBand: Steering LLM-based Kernel Optimization via Hardware-Aware Multi-Armed Bandits
by: Ran, Dezhi, et al.
Published: (2025)

Efficient Learning of POMDPs with Known Observation Model in Average-Reward Setting
by: Russo, Alessio, et al.
Published: (2024)

Meet Me at the Arm: The Cooperative Multi-Armed Bandits Problem with Shareable Arms
by: Hu, Xinyi, et al.
Published: (2025)

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

Decentralized Upper Confidence Bound Algorithms for Homogeneous Multi-Agent Multi-Armed Bandits
by: Zhu, Jingxuan, et al.
Published: (2021)

Achieving $\widetilde{\mathcal{O}}(\sqrt{T})$ Regret in Average-Reward POMDPs with Known Observation Models
by: Russo, Alessio, et al.
Published: (2025)

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)