Cover Image

Pure Exploration with Infinite Answers

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Poiani, Riccardo, Bernasconi, Martino, Celli, Andrea
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

Non-Asymptotic Analysis of (Sticky) Track-and-Stop
by: Poiani, Riccardo, et al.
Published: (2025)

Optimal Rates for Feasible Payoff Set Estimation in Games
by: Barbara, Annalisa, et al.
Published: (2026)

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

No-Regret is not enough! Bandits with General Constraints through Adaptive Regret Minimization
by: Bernasconi, Martino, et al.
Published: (2024)

Nonparametric Contextual Online Bilateral Trade
by: Coccia, Emanuele, et al.
Published: (2026)

Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial Constraints
by: Bernasconi, Martino, et al.
Published: (2024)

No-Regret Learning in Bilateral Trade via Global Budget Balance
by: Bernasconi, Martino, et al.
Published: (2023)

Online Learning in the Random Order Model
by: Bernasconi, Martino, et al.
Published: (2025)

Min-Max Optimization Requires Exponentially Many Queries
by: Bernasconi, Martino, et al.
Published: (2026)

Truncating Trajectories in Monte Carlo Policy Evaluation: an Adaptive Approach
by: Poiani, Riccardo, et al.
Published: (2024)

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

Nearly-Optimal Bandit Learning in Stackelberg Games with Side Information
by: Balcan, Maria-Florina, et al.
Published: (2025)

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

Inverse Reinforcement Learning with Sub-optimal Experts
by: Poiani, Riccardo, et al.
Published: (2024)

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

Pure Exploration with Feedback Graphs
by: Russo, Alessio, 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)

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

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

Single-dimensional Contract Design: Efficient Algorithms and Learning
by: Bernasconi, Martino, et al.
Published: (2025)

Agent-Designed Contracts: How to Sell Hidden Actions
by: Bernasconi, Martino, et al.
Published: (2024)

Near Optimal Pure Exploration in Logistic Bandits
by: Rivera, Eduardo Ochoa, 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)

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

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

Efficient Exploration of the Rashomon Set of Rule Set Models
by: Ciaperoni, Martino, et al.
Published: (2024)

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

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

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

Online Learning under Budget and ROI Constraints via Weak Adaptivity
by: Castiglioni, Matteo, et al.
Published: (2023)

Online Learning with Sublinear Best-Action Queries
by: Russo, Matteo, et al.
Published: (2024)

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

Optimistically Optimistic Exploration for Provably Efficient Infinite-Horizon Reinforcement and Imitation Learning
by: Moulin, Antoine, et al.
Published: (2025)

The Complexity of Correlated Equilibria in Generalized Games
by: Bernasconi, Martino, et al.
Published: (2025)

Improved Hardness Results for Min-Max Optimization with Coupled Constraints
by: Bernasconi, Martino, et al.
Published: (2024)

Pure Exploration via Frank-Wolfe Self-Play
by: Liu, Xinyu, et al.
Published: (2025)

If Concept Bottlenecks are the Question, are Foundation Models the Answer?
by: Debole, Nicola, et al.
Published: (2025)