← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Revisiting Simple Regret: Fast Rates for Returning a Good Arm ICML 2023
Delayed Feedback in Kernel Bandits ICML 2023
Efficient and Equitable Deployment of Mobile Vaccine Distribution Centers IJCAI 2023
Learning and Collusion in Multi-unit Auctions NIPS 2023
Tighter Robust Upper Bounds for Options via No-Regret Learning AAAI 2023
Online Task Assignment with Controllable Processing Time IJCAI 2023
Meta-Learning Adversarial Bandit Algorithms NIPS 2023
Resolving the Approximability of Offline and Online Non-monotone DR-Submodular Maximization over General Convex Sets AISTATS 2023
Linear Partial Monitoring for Sequential Decision Making: Algorithms, Regret Bounds and Applications JMLR 2023
Cilantro: Performance-Aware Resource Allocation for General Objectives via Online Feedback OSDI 2023
Bandit problems with fidelity rewards JMLR 2023
Prediction Equilibrium for Dynamic Network Flows JMLR 2023
Non-Convex Bilevel Optimization with Time-Varying Objective Functions NIPS 2023
Contextual Conservative Interleaving Bandits ICML 2023
Stochastic Multi-armed Bandits: Optimal Trade-off among Optimality, Consistency, and Tail Risk NIPS 2023
High-dimensional Contextual Bandit Problem without Sparsity NIPS 2023
A New Look at Dynamic Regret for Non-Stationary Stochastic Bandits JMLR 2023
Online Non-stochastic Control with Partial Feedback JMLR 2023
Learning for Edge-Weighted Online Bipartite Matching with Robustness Guarantees ICML 2023
Learning to Rank under Multinomial Logit Choice JMLR 2023
Robust Load Balancing with Machine Learned Advice JMLR 2023
Contextual Combinatorial Bandits with Probabilistically Triggered Arms ICML 2023
Graph-Aided Online Multi-Kernel Learning JMLR 2023
Logarithmic-Regret Quantum Learning Algorithms for Zero-Sum Games NIPS 2023
Polynomial-Time Linear-Swap Regret Minimization in Imperfect-Information Sequential Games NIPS 2023