Skip to content
conftrace_

confidence bound

36 papers

Papers

Best Arm Identification with Minimal Regret JMLR 2026 DP-NCB: Privacy Preserving Fair Bandits AAAI 2026 On the Sublinear Regret of Continuous K-Max Bandits UAI 2026 Improved Offline Contextual Bandits with Second-Order Bounds: Betting and Freezing COLT 2025 Near-Optimal Algorithm for Non-Stationary Kernelized Bandits AISTATS 2025 Tighter Confidence Bounds for Sequential Kernel Regression AISTATS 2025 Randomized Confidence Bounds for Stochastic Partial Monitoring ICML 2024 A Distribution Optimization Framework for Confidence Bounds of Risk Measures ICML 2023 Identification of Blackwell Optimal Policies for Deterministic MDPs AISTATS 2023 Recursive Quantile Estimation: Non-Asymptotic Confidence Bounds JMLR 2023 Time-uniform confidence bands for the CDF under nonstationarity NeurIPS 2023 Anti-Concentrated Confidence Bonuses For Scalable Exploration ICLR 2022 Graph Neural Network Bandits NeurIPS 2022 Lazy Estimation of Variable Importance for Large Neural Networks ICML 2022 Nearly Optimal Catoni’s M-estimator for Infinite Variance ICML 2022 Norm-Agnostic Linear Bandits AISTATS 2022 Reinforcement Learning with a Terminator NeurIPS 2022 Confident Off-Policy Evaluation and Selection through Self-Normalized Importance Weighting AISTATS 2021 DART: Adaptive Accept Reject Algorithm for Non-Linear Combinatorial Bandits AAAI 2021 Improved Confidence Bounds for the Linear Logistic Model and Applications to Bandits ICML 2021 Training a Single Bandit Arm AISTATS 2021 Universal Off-Policy Evaluation NeurIPS 2021 Better Exploration with Optimistic Actor Critic NeurIPS 2019 Adversarially Robust Optimization with Gaussian Processes NeurIPS 2018 Streaming kernel regression with provably adaptive mean, variance, and regularization JMLR 2018