conftrace_

confidence bound

29 papers

Explore in graph

Co-occurring keywords

multi-armed bandit (1098) regret bound (1926) online learning (1777) pure exploration (50) conditional value at risk (50) combinatorial bandit (37) upper confidence bound (197) quantile estimation (21) regret minimization (315) markov decision process (790)

Papers

DP-NCB: Privacy Preserving Fair Bandits AAAI 2026
A Distribution Optimization Framework for Confidence Bounds of Risk Measures ICML 2023
Time-uniform confidence bands for the CDF under nonstationarity NIPS 2023
Identification of Blackwell Optimal Policies for Deterministic MDPs AISTATS 2023
Recursive Quantile Estimation: Non-Asymptotic Confidence Bounds JMLR 2023
Lazy Estimation of Variable Importance for Large Neural Networks ICML 2022
Reinforcement Learning with a Terminator NIPS 2022
Nearly Optimal Catoni’s M-estimator for Infinite Variance ICML 2022
Graph Neural Network Bandits NIPS 2022
Norm-Agnostic Linear Bandits AISTATS 2022
DART: Adaptive Accept Reject Algorithm for Non-Linear Combinatorial Bandits AAAI 2021
Universal Off-Policy Evaluation NIPS 2021
Confident Off-Policy Evaluation and Selection through Self-Normalized Importance Weighting AISTATS 2021
Improved Confidence Bounds for the Linear Logistic Model and Applications to Bandits ICML 2021
Training a Single Bandit Arm AISTATS 2021
Better Exploration with Optimistic Actor Critic NIPS 2019
Adversarially Robust Optimization with Gaussian Processes NIPS 2018
Streaming kernel regression with provably adaptive mean, variance, and regularization JMLR 2018
A KL-LUCB algorithm for Large-Scale Crowdsourcing NIPS 2017
Pareto Front Identification from Stochastic Bandit Feedback AISTATS 2016
Heteroscedastic Sequences: Beyond Gaussianity ICML 2016
Maximin Action Identification: A New Bandit Framework for Games COLT 2016
Anytime Exploration for Multi-armed Bandits using Confidence Information ICML 2016
High Confidence Policy Improvement ICML 2015
Distributionally Robust Logistic Regression NIPS 2015