conftrace_

logarithmic regret

28 papers

Explore in graph

Co-occurring keywords

regret bound (1926) online learning (1777) convex optimization (1321) multi-armed bandit (1098) online convex optimization (165) reinforcement learning (4352) stochastic optimization (1060) online linear optimization (32) contextual bandit (381) strongly convex function (31)

Papers

Fast Rates in Stochastic Online Convex Optimization by Exploiting the Curvature of Feasible Sets NIPS 2024
Local Anti-Concentration Class: Logarithmic Regret for Greedy Linear Contextual Bandit NIPS 2024
Achieving $\tilde{O}(1/\epsilon)$ Sample Complexity for Constrained Markov Decision Process NIPS 2024
Bandit Online Linear Optimization with Hints and Queries ICML 2023
An Instance-Dependent Analysis for the Cooperative Multi-Player Multi-Armed Bandit ALT 2023
Breaking the $\sqrtT$ Barrier: Instance-Independent Logarithmic Regret in Stochastic Contextual Linear Bandits ICML 2022
Reinforcement Learning with Logarithmic Regret and Policy Switches NIPS 2022
Strategies for Safe Multi-Armed Bandits with Logarithmic Regret and Risk ICML 2022
Cascaded Gaps: Towards Logarithmic Regret for Risk-Sensitive Reinforcement Learning ICML 2022
Quantum Speedups of Optimizing Approximately Convex Functions with Applications to Logarithmic Regret Stochastic Convex Bandits NIPS 2022
Damped Online Newton Step for Portfolio Selection COLT 2022
Q-learning with Logarithmic Regret AISTATS 2021
Logarithmic Regret in Feature-based Dynamic Pricing NIPS 2021
Online Learning from Optimal Actions COLT 2021
Logarithmic Regret for Reinforcement Learning with Linear Function Approximation ICML 2021
On Uninformative Optimal Policies in Adaptive LQR with Unknown B-Matrix L4DC 2021
Online Linear Optimization with Many Hints NIPS 2020
Dynamic Pricing in High-dimensions JMLR 2019
Non-Asymptotic Gap-Dependent Regret Bounds for Tabular MDPs NIPS 2019
Logarithmic Regret for Online Control NIPS 2019
Logarithmic Regret for Online Gradient Descent Beyond Strong Convexity AISTATS 2019
Efficient Online Portfolio with Logarithmic Regret NIPS 2018
Following the Leader and Fast Rates in Online Linear Prediction: Curved Constraint Sets and Other Regularities JMLR 2017
Efficient Second-Order Online Kernel Learning with Adaptive Embedding NIPS 2017
Variants of RMSProp and Adagrad with Logarithmic Regret Bounds ICML 2017