conftrace_

instance-dependent bound

11 papers

Explore in graph

Co-occurring keywords · papers mentioning both

regret bound (3) markov decision process (3) sample complexity (3) reinforcement learning (3) pac reinforcement learning (2) minimax lower bound (2) multi-armed bandit (2) function approximation (2) general function approximation (1) weighted value-targeted regression (1)

Papers

On the Exponential Convergence for Offline RLHF with Pairwise Comparisons AAAI 2026 Rates for Offline Reinforcement Learning with Adaptively Collected Data L4DC 2025 Achieving Constant Regret in Linear Markov Decision Processes NeurIPS 2024 Causal Bandits: The Pareto Optimal Frontier of Adaptivity, a Reduction to Linear Bandits, and Limitations around Unknown Marginals ICML 2024 Horizon-Free and Instance-Dependent Regret Bounds for Reinforcement Learning with General Function Approximation AISTATS 2024 Complexity Analysis of a Countable-armed Bandit Problem ALT 2023 Optimistic PAC Reinforcement Learning: the Instance-Dependent View ALT 2023 Near Instance-Optimal PAC Reinforcement Learning for Deterministic MDPs NeurIPS 2022 Optimal and instance-dependent guarantees for Markovian linear stochastic approximation COLT 2022 Adaptive Discretization for Adversarial Lipschitz Bandits COLT 2021 Sequential Experimental Design for Transductive Linear Bandits NeurIPS 2019