regret bound

Dynamic Pricing and Learning with Bayesian Persuasion NeurIPS 2023 Efficient Adversarial Attacks on Online Multi-agent Reinforcement Learning NeurIPS 2023 Efficient Algorithms for Generalized Linear Bandits with Heavy-tailed Rewards NeurIPS 2023 Efficient Batched Algorithm for Contextual Linear Bandits with Large Action Space via Soft Elimination NeurIPS 2023 Efficient Exploration via Epistemic-Risk-Seeking Policy Optimization ICML 2023 Efficient Explorative Key-Term Selection Strategies for Conversational Contextual Bandits AAAI 2023 Efficient Online Clustering with Moving Costs NeurIPS 2023 Efficient Rate Optimal Regret for Adversarial Contextual MDPs Using Online Function Approximation ICML 2023 Efficient RL with Impaired Observability: Learning to Act with Delayed and Missing State Observations NeurIPS 2023 Exploiting Correlated Auxiliary Feedback in Parameterized Bandits NeurIPS 2023 Exploration for Free: How Does Reward Heterogeneity Improve Regret in Cooperative Multi-agent Bandits? UAI 2023 Exploration in Linear Bandits with Rich Action Sets and its Implications for Inference AISTATS 2023 Exploration in Reward Machines with Low Regret AISTATS 2023 Failure-Aware Gaussian Process Optimization with Regret Bounds NeurIPS 2023 Fairness and Welfare Quantification for Regret in Multi-Armed Bandits AAAI 2023 Fast Online Node Labeling for Very Large Graphs ICML 2023 Federated Linear Bandits with Finite Adversarial Actions NeurIPS 2023 Federated Linear Contextual Bandits with User-level Differential Privacy ICML 2023 Federated Online and Bandit Convex Optimization ICML 2023 Finite-Time Logarithmic Bayes Regret Upper Bounds NeurIPS 2023 First- and Second-Order Bounds for Adversarial Linear Contextual Bandits NeurIPS 2023 Follow-the-Perturbed-Leader Achieves Best-of-Both-Worlds for Bandit Problems ALT 2023 Follow-ups Also Matter: Improving Contextual Bandits via Post-serving Contexts NeurIPS 2023 Fully Dynamic Online Selection through Online Contention Resolution Schemes AAAI 2023 Further Adaptive Best-of-Both-Worlds Algorithm for Combinatorial Semi-Bandits AISTATS 2023