← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Data-driven Competitive Algorithms for Online Knapsack and Set Cover AAAI 2021
Improved Analysis for Dynamic Regret of Strongly Convex and Smooth Functions L4DC 2021
Learning Partially Observed Linear Dynamical Systems from Logarithmic Number of Samples L4DC 2021
Regret Bounds for Adaptive Nonlinear Control L4DC 2021
Decentralized Multi-Agent Linear Bandits with Safety Constraints AAAI 2021
Computing an Efficient Exploration Basis for Learning with Univariate Polynomial Features AAAI 2021
On Online Optimization: Dynamic Regret Analysis of Strongly Convex and Smooth Problems AAAI 2021
Problem Dependent View on Structured Thresholding Bandit Problems ICML 2021
Online Selection Problems against Constrained Adversary ICML 2021
ADOM: Accelerated Decentralized Optimization Method for Time-Varying Networks ICML 2021
Follow-the-Regularized-Leader Routes to Chaos in Routing Games ICML 2021
Online Learning for Load Balancing of Unknown Monotone Resource Allocation Games ICML 2021
Multi-Receiver Online Bayesian Persuasion ICML 2021
Best Model Identification: A Rested Bandit Formulation ICML 2021
Online Optimization in Games via Control Theory: Connecting Regret, Passivity and Poincaré Recurrence ICML 2021
Fairness and Bias in Online Selection ICML 2021
Online Learning with Optimism and Delay ICML 2021
Online A-Optimal Design and Active Linear Regression ICML 2021
Efficient Online Learning for Dynamic k-Clustering ICML 2021
Zeroth-Order Non-Convex Learning via Hierarchical Dual Averaging ICML 2021
Stochastic Multi-Armed Bandits with Unrestricted Delay Distributions ICML 2021
Learning to Price Against a Moving Target ICML 2021
Multi-layered Network Exploration via Random Walks: From Offline Optimization to Online Learning ICML 2021
Joint Online Learning and Decision-making via Dual Mirror Descent ICML 2021
No-regret Algorithms for Capturing Events in Poisson Point Processes ICML 2021