regret minimization

Neural Combinatorial Optimization for Robust Routing Problem with Uncertain Travel Times NeurIPS 2024 No-Regret Reinforcement Learning in Smooth MDPs ICML 2024 Online Recommendations for Agents with Discounted Adaptive Preferences ALT 2024 Online Stackelberg Optimization via Nonlinear Control COLT 2024 Open Problem: Black-Box Reductions and Adaptive Gradient Methods for Nonconvex Optimization COLT 2024 Optimal Regret Bounds for Collaborative Learning in Bandits ALT 2024 Provable Reward-Agnostic Preference-Based Reinforcement Learning ICLR 2024 Rate-Optimal Policy Optimization for Linear Markov Decision Processes ICML 2024 Regret Minimization in Stackelberg Games with Side Information NeurIPS 2024 Robust Losses for Decision-Focused Learning IJCAI 2024 Strategic Linear Contextual Bandits NeurIPS 2024 Strategic Multi-Armed Bandit Problems Under Debt-Free Reporting NeurIPS 2024 (ε, u)-Adaptive Regret Minimization in Heavy-Tailed Bandits COLT 2024 Achieving Near-Optimal Individual Regret & Low Communications in Multi-Agent Bandits ICLR 2023 Adapting to game trees in zero-sum imperfect information games ICML 2023 An Information-Theoretic Analysis of Nonstationary Bandit Learning ICML 2023 Bandit Multi-linear DR-Submodular Maximization and Its Applications on Adversarial Submodular Bandits ICML 2023 Blocked Collaborative Bandits: Online Collaborative Filtering with Per-Item Budget Constraints NeurIPS 2023 Decentralized Stochastic Multi-Player Multi-Armed Walking Bandits AAAI 2023 Distributed Contextual Linear Bandits with Minimax Optimal Communication Cost ICML 2023 Dynamical Linear Bandits ICML 2023 Efficient Algorithms for Regret Minimization in Billboard Advertisement (Student Abstract) AAAI 2023 Efficient Rate Optimal Regret for Adversarial Contextual MDPs Using Online Function Approximation ICML 2023 End-to-End Meta-Bayesian Optimisation with Transformer Neural Processes NeurIPS 2023 Exploration in Reward Machines with Low Regret AISTATS 2023