Cover Image

Multi-Armed Bandits With Best-Action Queries

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bacchiocchi, Francesco, Castiglioni, Matteo, Marchesi, Alberto, Stradi, Francesco Emanuele
Format:	Preprint
Published:	2026
Subjects:	Machine Learning Artificial Intelligence
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Toward Optimal Regret in Robust Pricing: Decoupling Corruption and Time
by: Kalupahana, Kalana, et al.
Published: (2026)

No-Regret Learning Under Adversarial Resource Constraints: A Spending Plan Is All You Need!
by: Stradi, Francesco Emanuele, et al.
Published: (2025)

Best-of-Both-Worlds Policy Optimization for CMDPs with Bandit Feedback
by: Stradi, Francesco Emanuele, et al.
Published: (2024)

Markov Persuasion Processes: Learning to Persuade from Scratch
by: Bacchiocchi, Francesco, et al.
Published: (2024)

Replicable Constrained Bandits
by: Bollini, Matteo, et al.
Published: (2026)

Learning Optimal Contracts: How to Exploit Small Action Spaces
by: Bacchiocchi, Francesco, et al.
Published: (2023)

Learning Adversarial MDPs with Stochastic Hard Constraints
by: Stradi, Francesco Emanuele, et al.
Published: (2024)

Optimal Strong Regret and Violation in Constrained MDPs via Policy Optimization
by: Stradi, Francesco Emanuele, et al.
Published: (2024)

A Best-of-Both-Worlds Algorithm for Constrained MDPs with Long-Term Constraints
by: Germano, Jacopo, et al.
Published: (2023)

Regret Minimization for Piecewise Linear Rewards: Contracts, Auctions, and Beyond
by: Bacchiocchi, Francesco, et al.
Published: (2025)

Truly Adapting to Adversarial Constraints in Constrained MABs
by: Stradi, Francesco Emanuele, et al.
Published: (2026)

Data-Dependent Regret Bounds for Constrained MABs
by: Genalti, Gianmarco, et al.
Published: (2025)

Learning Constrained Markov Decision Processes With Non-stationary Rewards and Constraints
by: Stradi, Francesco Emanuele, et al.
Published: (2024)

Beyond Slater's Condition in Online CMDPs with Stochastic and Adversarial Constraints
by: Stradi, Francesco Emanuele, et al.
Published: (2025)

Learning in Bayesian Stackelberg Games With Unknown Follower's Types
by: Bollini, Matteo, et al.
Published: (2026)

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

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

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

Large Language Model-Enhanced Multi-Armed Bandits
by: Sun, Jiahang, et al.
Published: (2025)

Multi-Armed Bandits-Based Optimization of Decision Trees
by: Shanto, Hasibul Karim, et al.
Published: (2025)

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

IRL for Restless Multi-Armed Bandits with Applications in Maternal and Child Health
by: Jain, Gauri, et al.
Published: (2024)

Thresholding Data Shapley for Data Cleansing Using Multi-Armed Bandits
by: Namba, Hiroyuki, et al.
Published: (2024)

Provably Efficient Reinforcement Learning for Adversarial Restless Multi-Armed Bandits with Unknown Transitions and Bandit Feedback
by: Xiong, Guojun, et al.
Published: (2024)

Contract Design Under Approximate Best Responses
by: Bacchiocchi, Francesco, et al.
Published: (2025)

Annealed Softmax Greedy in Many-Armed Bayesian Bandits
by: Overman, William, et al.
Published: (2026)

Near-Optimal Regret for KL-Regularized Multi-Armed Bandits
by: Ji, Kaixuan, et al.
Published: (2026)

On the Benefits of Free Exploration for Regret Minimization in Multi-Armed Bandits
by: Hou, Yunlong, et al.
Published: (2026)

Federated Combinatorial Multi-Agent Multi-Armed Bandits
by: Fourati, Fares, et al.
Published: (2024)

Mobility-Aware Federated Learning: Multi-Armed Bandit Based Selection in Vehicular Network
by: Tu, Haoyu, et al.
Published: (2024)

Online Prompt Pricing based on Combinatorial Multi-Armed Bandit and Hierarchical Stackelberg Game
by: Li, Meiling, et al.
Published: (2024)

ParBalans: Parallel Multi-Armed Bandits-based Adaptive Large Neighborhood Search
by: Yilmaz, Alican, et al.
Published: (2025)

Safe Online Bid Optimization with Return on Investment and Budget Constraints
by: Castiglioni, Matteo, et al.
Published: (2022)

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

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

Best-Arm Identification in Unimodal Bandits
by: Poiani, Riccardo, et al.
Published: (2024)

Adaptive Budgeted Multi-Armed Bandits for IoT with Dynamic Resource Constraints
by: Vaishnav, Shubham, et al.
Published: (2025)

The Sample Complexity of Uniform Approximation for Multi-Dimensional CDFs and Fixed-Price Mechanisms
by: Castiglioni, Matteo, et al.
Published: (2026)

Put CASH on Bandits: A Max K-Armed Problem for Automated Machine Learning
by: Balef, Amir Rezaei, et al.
Published: (2025)

Decisions and Deployment: The Five-Year SAHELI Project (2020-2025) on Restless Multi-Armed Bandits for Improving Maternal and Child Health
by: Verma, Shresth, et al.
Published: (2026)