regret bound

A Unified Confidence Sequence for Generalized Linear Models, with Applications to Bandits NeurIPS 2024 Autobidders with Budget and ROI Constraints: Efficiency, Regret, and Pacing Dynamics COLT 2024 BanditQ:Fair Bandits with Guaranteed Rewards UAI 2024 Bandits Meet Mechanism Design to Combat Clickbait in Online Recommendation ICLR 2024 Bandits with Concave Aggregated Reward IJCAI 2024 Bandits with Knapsacks and Predictions UAI 2024 Bandits with Preference Feedback: A Stackelberg Game Perspective NeurIPS 2024 Bandits with Ranking Feedback NeurIPS 2024 Bandits with Replenishable Knapsacks: the Best of both Worlds ICLR 2024 Bayesian Optimisation with Unknown Hyperparameters: Regret Bounds Logarithmically Closer to Optimal NeurIPS 2024 Best-of-Both-Worlds Algorithms for Linear Contextual Bandits AISTATS 2024 Beyond task diversity: provable representation transfer for sequential multitask linear bandits NeurIPS 2024 Bridging Distributional and Risk-sensitive Reinforcement Learning with Provable Regret Bounds JMLR 2024 Cascading Reinforcement Learning ICLR 2024 Causal Bandits with General Causal Models and Interventions AISTATS 2024 Causally Abstracted Multi-armed Bandits UAI 2024 Causal Q-Aggregation for CATE Model Selection AISTATS 2024 Combinatorial Bandits for Maximum Value Reward Function under Value-Index Feedback ICLR 2024 Combinatorial Causal Bandits without Graph Skeleton ACML 2024 Combinatorial Stochastic-Greedy Bandit AAAI 2024 Combining model-based controller and ML advice via convex reparameterization L4DC 2024 Communication Bounds for the Distributed Experts Problem NeurIPS 2024 Concentration Tail-Bound Analysis of Coevolutionary and Bandit Learning Algorithms IJCAI 2024 Conformal Inference for Online Prediction with Arbitrary Distribution Shifts JMLR 2024 Consistent Hierarchical Classification with A Generalized Metric AISTATS 2024