:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Tuynman, Adrienne, Degenne, Rémy
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2502.01425
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Finding good policies in average-reward Markov Decision Processes without prior knowledge
by: Tuynman, Adrienne, et al.
Published: (2024)

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

Towards Blackwell Optimality: Bellman Optimality Is All You Can Get
by: Boone, Victor, et al.
Published: (2025)

Transfer in Reinforcement Learning via Regret Bounds for Learning Agents
by: Tuynman, Adrienne, et al.
Published: (2022)

Pure Exploration in Bandits with Linear Constraints
by: Carlsson, Emil, et al.
Published: (2023)

Pure Exploration in Asynchronous Federated Bandits
by: Wang, Zichen, et al.
Published: (2023)

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

Optimal Multi-Fidelity Best-Arm Identification
by: Poiani, Riccardo, et al.
Published: (2024)

Pure Exploration for a Good Policy in Reinforcement Learning with Bandit Feedback
by: Li, Zitian, et al.
Published: (2026)

Robust Batched Bandits
by: Guo, Yunwen, et al.
Published: (2025)

Markov kernels in Mathlib's probability library
by: Degenne, Rémy
Published: (2025)

A Fast Algorithm for the Real-Valued Combinatorial Pure Exploration of Multi-Armed Bandit
by: Nakamura, Shintaro, et al.
Published: (2023)

Batched Nonparametric Contextual Bandits
by: Jiang, Rong, et al.
Published: (2024)

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

Batched Stochastic Bandit for Nondegenerate Functions
by: Liu, Yu, et al.
Published: (2024)

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

Batched Kernelized Bandits: Refinements and Extensions
by: Ma, Chenkai, 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)

Batch Ensemble for Variance Dependent Regret in Stochastic Bandits
by: Cassel, Asaf, et al.
Published: (2024)

Pure Exploration with Feedback Graphs
by: Russo, Alessio, et al.
Published: (2025)

Pure Exploration with Infinite Answers
by: Poiani, Riccardo, et al.
Published: (2025)

Preference-based Pure Exploration
by: Shukla, Apurv, et al.
Published: (2024)

Infrequent Exploration in Linear Bandits
by: Lee, Harin, et al.
Published: (2025)

Continuum-armed Bandit Optimization with Batch Pairwise Comparison Oracles
by: Chang, Xiangyu, et al.
Published: (2025)

Batched Online Contextual Sparse Bandits with Sequential Inclusion of Features
by: Swiers, Rowan, et al.
Published: (2024)

Pure Exploration under Mediators' Feedback
by: Poiani, Riccardo, et al.
Published: (2023)

In-Context Learning for Pure Exploration
by: Russo, Alessio, et al.
Published: (2025)

IBCB: Efficient Inverse Batched Contextual Bandit for Behavioral Evolution History
by: Xu, Yi, et al.
Published: (2024)

Neural Exploitation and Exploration of Contextual Bandits
by: Ban, Yikun, et al.
Published: (2023)

Replicable Bandits with UCB based Exploration
by: Deb, Rohan, et al.
Published: (2026)

The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for Pure Exploration in Multi-armed Bandits
by: Assadi, Sepehr, et al.
Published: (2023)

Information Lower Bounds for Robust Mean Estimation
by: Degenne, Rémy, et al.
Published: (2024)

Exploration via Feature Perturbation in Contextual Bandits
by: Yi, Seouh-won, et al.
Published: (2025)

Deceptive Exploration in Multi-armed Bandits
by: Vurankaya, I. Arda, et al.
Published: (2025)

Dual-Directed Algorithm Design for Efficient Pure Exploration
by: Qin, Chao, et al.
Published: (2023)

Few Batches or Little Memory, But Not Both: Simultaneous Space and Adaptivity Constraints in Stochastic Bandits
by: Huang, Ruiyuan, et al.
Published: (2026)

Efficient Multi-objective Prompt Optimization via Pure-exploration Bandits
by: Li, Donghao, et al.
Published: (2026)

Cost-Aware Optimal Pairwise Pure Exploration
by: Wu, Di, et al.
Published: (2025)

In-Context Learning for Pure Exploration in Continuous Spaces
by: Russo, Alessio, et al.
Published: (2026)

RIE-Greedy: Regularization-Induced Exploration for Contextual Bandits
by: Li, Tong, et al.
Published: (2026)