conftrace_

regret bound

1926 papers

Explore in graph

Also known as

RB

Co-occurring keywords

online learning (1777) multi-armed bandit (1098) contextual bandit (381) stochastic optimization (1060) reinforcement learning (4352) online algorithm (445) upper confidence bound (197) markov decision process (790) thompson sampling (237) online convex optimization (165)

Papers

Near-optimal Conservative Exploration in Reinforcement Learning under Episode-wise Constraints ICML 2023
What can online reinforcement learning with function approximation benefit from general coverage conditions? ICML 2023
Communication-Constrained Bandits under Additive Gaussian Noise ICML 2023
Bandits with Knapsacks: Advice on Time-Varying Demands ICML 2023
Failure-Aware Gaussian Process Optimization with Regret Bounds NIPS 2023
Reinforcement Learning with History Dependent Dynamic Contexts ICML 2023
Online Harmonizing Gradient Descent for Imbalanced Data Streams One-Pass Classification IJCAI 2023
Efficient Online Clustering with Moving Costs NIPS 2023
Quantum Bayesian Optimization NIPS 2023
Corruption-Robust Algorithms with Uncertainty Weighting for Nonlinear Contextual Bandits and Markov Decision Processes ICML 2023
Nearest Neighbour with Bandit Feedback NIPS 2023
Generalized test utilities for long-tail performance in extreme multi-label classification NIPS 2023
Distributionally Robust Bayesian Optimization with $\varphi$-divergences NIPS 2023
Noise-Adaptive Thompson Sampling for Linear Contextual Bandits NIPS 2023
Online Convex Optimization with Unbounded Memory NIPS 2023
A Unified Analysis of Nonstochastic Delayed Feedback for Combinatorial Semi-Bandits, Linear Bandits, and MDPs COLT 2023
Efficient Exploration via Epistemic-Risk-Seeking Policy Optimization ICML 2023
Learning to Rank under Multinomial Logit Choice JMLR 2023
Optimistic Thompson Sampling-based algorithms for episodic reinforcement learning UAI 2023
Robust Lipschitz Bandits to Adversarial Corruptions NIPS 2023
Optimal Regret Is Achievable with Bounded Approximate Inference Error: An Enhanced Bayesian Upper Confidence Bound Framework NIPS 2023
Interpolating Classifiers Make Few Mistakes JMLR 2023
Multitask Learning with No Regret: from Improved Confidence Bounds to Active Learning NIPS 2023
Competing Bandits in Time Varying Matching Markets L4DC 2023
Bandit Task Assignment with Unknown Processing Time NIPS 2023