logarithmic regret

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