conftrace_

sublinear regret

88 papers

Explore in graph

Co-occurring keywords

regret bound (1926) online learning (1777) multi-armed bandit (1098) contextual bandit (381) bayesian optimization (624) online algorithm (445) gaussian process (1200) reinforcement learning (4352) upper confidence bound (197) online convex optimization (165)

Papers

No-Regret Online Prediction with Strategic Experts NIPS 2023
Non-Convex Bilevel Optimization with Time-Varying Objective Functions NIPS 2023
On the Sublinear Regret of GP-UCB NIPS 2023
Variance Reduced Online Gradient Descent for Kernelized Pairwise Learning with Limited Memory ACML 2023
Adaptive Regret for Control of Time-Varying Dynamics L4DC 2023
Best of Both Worlds in Online Control: Competitive Ratio and Policy Regret L4DC 2023
Regularized online DR-submodular optimization UAI 2023
Multi-Agent congestion cost minimization with linear function approximations AISTATS 2023
Provably and Practically Efficient Neural Contextual Bandits ICML 2023
Weighted Gaussian Process Bandits for Non-stationary Environments AISTATS 2022
Non-Stationary Bandits under Recharging Payoffs: Improved Planning with Sublinear Regret NIPS 2022
Welfare Maximization in Competitive Equilibrium: Reinforcement Learning for Markov Exchange Economy ICML 2022
Context Uncertainty in Contextual Bandits with Applications to Recommender Systems AAAI 2022
Regret Bounds for Stochastic Shortest Path Problems with Linear Function Approximation ICML 2022
Online Reinforcement Learning for Mixed Policy Scopes NIPS 2022
Triple-Q: A Model-Free Algorithm for Constrained Reinforcement Learning with Sublinear Regret and Zero Constraint Violation AISTATS 2022
Near-Optimal Multi-Agent Learning for Safe Coverage Control NIPS 2022
A Provably-Efficient Model-Free Algorithm for Infinite-Horizon Average-Reward Constrained Markov Decision Processes AAAI 2022
Neural Contextual Bandits without Regret AISTATS 2022
Learning Competitive Equilibria in Exchange Economies with Bandit Feedback AISTATS 2022
A Bayesian Approach for Stochastic Continuum-armed Bandit with Long-term Constraints AISTATS 2022
Can Q-learning be Improved with Advice? COLT 2022
On the Theory of Reinforcement Learning with Once-per-Episode Feedback NIPS 2021
Individual Fairness in Hindsight JMLR 2021
Online Learning in Unknown Markov Games ICML 2021