← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Incentivizing Compliance with Algorithmic Instruments ICML 2021
Leveraging Good Representations in Linear Contextual Bandits ICML 2021
Adversarial Dueling Bandits ICML 2021
Dueling Convex Optimization ICML 2021
Optimal regret algorithm for Pseudo-1d Bandit Convex Optimization ICML 2021
Top-k eXtreme Contextual Bandits with Arm Hierarchy ICML 2021
Online Submodular Resource Allocation with Applications to Rebalancing Shared Mobility Systems ICML 2021
Approximation Theory Based Methods for RKHS Bandits ICML 2021
Resource Allocation in Multi-armed Bandit Exploration: Overcoming Sublinear Scaling with Adaptive Parallelism ICML 2021
Coupon Design in Advertising Systems AAAI 2021
A Fast Exact Algorithm for the Resource Constrained Shortest Path Problem AAAI 2021
Linear Bandits on Uniformly Convex Sets JMLR 2021
Fast Learning for Renewal Optimization in Online Task Scheduling JMLR 2021
Refined approachability algorithms and application to regret minimization with global costs JMLR 2021
Bandit Convex Optimization in Non-stationary Environments JMLR 2021
Projection-free Decentralized Online Learning for Submodular Maximization over Time-Varying Networks JMLR 2021
Tsallis-INF: An Optimal Algorithm for Stochastic and Adversarial Bandits JMLR 2021
Preference-based Online Learning with Dueling Bandits: A Survey JMLR 2021
Regulating Greed Over Time in Multi-Armed Bandits JMLR 2021
Toward Optimal Solution for the Context-Attentive Bandit Problem IJCAI 2021
Dual Active Learning for Both Model and Data Selection IJCAI 2021
Jointly Learning Prices and Product Features IJCAI 2021
Matchings with Group Fairness Constraints: Online and Offline Algorithms IJCAI 2021
On a Competitive Secretary Problem with Deferred Selections IJCAI 2021
Regret and Cumulative Constraint Violation Analysis for Online Convex Optimization with Long Term Constraints ICML 2021