Online Algorithms

Online learning in bandits with predicted context AISTATS 2024 Online Learning in Betting Markets: Profit versus Prediction ICML 2024 Online Learning in CMDPs: Handling Stochastic and Adversarial Constraints ICML 2024 Online Learning of Delayed Choices NeurIPS 2024 Online Learning of Partitions in Additively Separable Hedonic Games IJCAI 2024 Online Learning under Budget and ROI Constraints via Weak Adaptivity ICML 2024 Online Learning with Bounded Recall ICML 2024 Online Learning with Off-Policy Feedback in Adversarial MDPs IJCAI 2024 Online Learning with Sublinear Best-Action Queries NeurIPS 2024 Online Linear Regression in Dynamic Environments via Discounting ICML 2024 Online Markov Decision Processes Configuration with Continuous Decision Space AAAI 2024 Online Matrix Completion: A Collaborative Approach with Hott Items ICML 2024 Online Newton Method for Bandit Convex Optimisation Extended Abstract COLT 2024 Online Non-convex Learning in Dynamic Environments NeurIPS 2024 Online Policy Optimization in Unknown Nonlinear Systems COLT 2024 Online Recommendations for Agents with Discounted Adaptive Preferences ALT 2024 Online Resource Allocation with Non-Stationary Customers ICML 2024 Online Sampling and Decision Making with Low Entropy IJCAI 2024 Online Stackelberg Optimization via Nonlinear Control COLT 2024 Online Submodular Maximization via Adaptive Thresholds IJCAI 2024 Online Submodular Maximization via Online Convex Optimization AAAI 2024 Online Variational Sequential Monte Carlo ICML 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