sublinear regret

Online Learning with Sublinear Best-Action Queries NeurIPS 2024 Optimal Scalarizations for Sublinear Hypervolume Regret NeurIPS 2024 Pursuing Overall Welfare in Federated Learning through Sequential Decision Making ICML 2024 RA-PbRL: Provably Efficient Risk-Aware Preference-Based Reinforcement Learning NeurIPS 2024 Regret Analysis of Repeated Delegated Choice AAAI 2024 Safe dynamic pricing for nonstationary network resource allocation L4DC 2024 Truly No-Regret Learning in Constrained MDPs ICML 2024 Adaptive Regret for Control of Time-Varying Dynamics L4DC 2023 Adversarial Attacks on Adversarial Bandits ICLR 2023 A Framework for Adapting Offline Algorithms to Solve Combinatorial Multi-Armed Bandit Problems with Bandit Feedback ICML 2023 Best of Both Worlds in Online Control: Competitive Ratio and Policy Regret L4DC 2023 Combinatorial categorized bandits with expert rankings UAI 2023 Distributed Linear Bandits under Communication Constraints ICML 2023 Last Switch Dependent Bandits with Monotone Payoff Functions ICML 2023 Maximize to Explore: One Objective Function Fusing Estimation, Planning, and Exploration NeurIPS 2023 Multi-Agent congestion cost minimization with linear function approximations AISTATS 2023 Non-Convex Bilevel Optimization with Time-Varying Objective Functions NeurIPS 2023 No-Regret Online Prediction with Strategic Experts NeurIPS 2023 On the Sublinear Regret of GP-UCB NeurIPS 2023 Provable Reset-free Reinforcement Learning by No-Regret Reduction ICML 2023 Provably and Practically Efficient Neural Contextual Bandits ICML 2023 Regularized online DR-submodular optimization UAI 2023 Robust Bayesian Satisficing NeurIPS 2023 Semi Bandit dynamics in Congestion Games: Convergence to Nash Equilibrium and No-Regret Guarantees. ICML 2023 Smoothed Analysis of Sequential Probability Assignment NeurIPS 2023