Cover Image

Pure Exploration with Feedback Graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Russo, Alessio, Song, Yichen, Pacchiano, Aldo
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

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

Adaptive Exploration for Multi-Reward Multi-Policy Evaluation
by: Russo, Alessio, et al.
Published: (2025)

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

Second Order Bounds for Contextual Bandits with Function Approximation
by: Pacchiano, Aldo
Published: (2024)

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

Provable Interactive Learning with Hindsight Instruction Feedback
by: Misra, Dipendra, et al.
Published: (2024)

Improved Training Mechanism for Reinforcement Learning via Online Model Selection
by: Afshar, Aida, et al.
Published: (2025)

Learning Rate-Free Reinforcement Learning: A Case for Model Selection with Non-Stationary Objectives
by: Afshar, Aida, et al.
Published: (2024)

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

Model-Free Active Exploration in Reinforcement Learning
by: Russo, Alessio, et al.
Published: (2024)

Bayesian Online Model Selection
by: Afshar, Aida, et al.
Published: (2026)

Contextual Bandits with Stage-wise Constraints
by: Pacchiano, Aldo, et al.
Published: (2024)

Data-Driven Online Model Selection With Regret Guarantees
by: Pacchiano, Aldo, et al.
Published: (2023)

State-free Reinforcement Learning
by: Chen, Mingyu, et al.
Published: (2024)

On the Hardness of Bandit Learning
by: Brukhim, Nataly, et al.
Published: (2025)

Language Model Personalization via Reward Factorization
by: Shenfeld, Idan, et al.
Published: (2025)

Pure Exploration Beyond Reward Feedback: The Role of Post-Action Context
by: Shahverdikondori, Mohammad, et al.
Published: (2025)

Improving Offline RL by Blending Heuristics
by: Geng, Sinong, et al.
Published: (2023)

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

Multiple-policy Evaluation via Density Estimation
by: Chen, Yilei, et al.
Published: (2024)

Experiment Planning with Function Approximation
by: Pacchiano, Aldo, et al.
Published: (2024)

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

The Good, the Bad, and the Sampled: a No-Regret Approach to Safe Online Classification
by: Baharav, Tavor Z., et al.
Published: (2025)

A Theoretical Framework for Partially Observed Reward-States in RLHF
by: Kausik, Chinmaya, et al.
Published: (2024)

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

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

The Batch Complexity of Bandit Pure Exploration
by: Tuynman, Adrienne, et al.
Published: (2025)

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

Active Preference Optimization for Sample Efficient RLHF
by: Das, Nirjhar, et al.
Published: (2024)

Principled Fine-tuning of LLMs from User-Edits: A Medley of Preference, Supervision, and Reward
by: Misra, Dipendra, et al.
Published: (2026)

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

When Less is Enough: Efficient Inference via Collaborative Reasoning
by: Chen, Yilei, et al.
Published: (2026)

ORSO: Accelerating Reward Design via Online Reward Selection and Policy Optimization
by: Zhang, Chen Bo Calvin, et al.
Published: (2024)

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

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

UCB for Large-Scale Pure Exploration: Beyond Sub-Gaussianity
by: Li, Zaile, et al.
Published: (2025)

The Limits of Pure Exploration in POMDPs: When the Observation Entropy is Enough
by: Zamboni, Riccardo, et al.
Published: (2024)

Fair Best Arm Identification with Fixed Confidence
by: Russo, Alessio, et al.
Published: (2024)

Pure Exploration for Constrained Best Mixed Arm Identification with a Fixed Budget
by: Tang, Dengwang, et al.
Published: (2024)

Worst-Case Regret Bounds for Exploration via Randomized Value Functions
by: Russo, Daniel
Published: (2019)