online algorithm

Near-Optimal Dynamic Regret for Adversarial Linear Mixture MDPs NeurIPS 2024 Near-optimal Per-Action Regret Bounds for Sleeping Bandits AISTATS 2024 Near-Optimal Policy Optimization for Correlated Equilibrium in General-Sum Markov Games AISTATS 2024 No-Regret M${}^{\natural}$-Concave Function Maximization: Stochastic Bandit Algorithms and NP-Hardness of Adversarial Full-Information Setting NeurIPS 2024 Online Budgeted Matching with General Bids NeurIPS 2024 Online Classification with Predictions NeurIPS 2024 Online Convex Optimisation: The Optimal Switching Regret for all Segmentations Simultaneously NeurIPS 2024 Online Resource Allocation with Non-Stationary Customers ICML 2024 Online Sampling and Decision Making with Low Entropy IJCAI 2024 Online Submodular Maximization via Adaptive Thresholds IJCAI 2024 Online Weighted Paging with Unknown Weights NeurIPS 2024 On Multi-Armed Bandit with Impatient Arms ICML 2024 On the Minimax Regret for Contextual Linear Bandits and Multi-Armed Bandits with Expert Advice NeurIPS 2024 Optimal Top-Two Method for Best Arm Identification and Fluid Analysis NeurIPS 2024 Overcoming Brittleness in Pareto-Optimal Learning Augmented Algorithms NeurIPS 2024 Piecewise-Stationary Bandits with Knapsacks NeurIPS 2024 Promoting Fairness Among Dynamic Agents in Online-Matching Markets under Known Stationary Arrival Distributions NeurIPS 2024 Reducing sequential change detection to sequential estimation ICML 2024 Regret Analysis of Bilateral Trade with a Smoothed Adversary JMLR 2024 Reinforcement Learning with Lookahead Information NeurIPS 2024 Restless bandits with rewards generated by a linear Gaussian dynamical system L4DC 2024 Risk-Sensitive Online Algorithms (Extended Abstract) COLT 2024 Sampling for Beyond-Worst-Case Online Ranking AAAI 2024 Stability in Online Coalition Formation AAAI 2024 Stochastic contextual bandits with graph feedback: from independence number to MAS number NeurIPS 2024