← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Stochastic Multi-Armed Bandits with Unrestricted Delay Distributions ICML 2021
Revisiting Smoothed Online Learning NIPS 2021
Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback AAAI 2021
Zeroth-Order Non-Convex Learning via Hierarchical Dual Averaging ICML 2021
Variational Bayesian Optimistic Sampling NIPS 2021
On Limited-Memory Subsampling Strategies for Bandits ICML 2021
Online Selective Classification with Limited Feedback NIPS 2021
Necessary and Sufficient Conditions for Avoiding Reopenings in Best First Suboptimal Search with General Bounding Functions AAAI 2021
Efficient Online Learning for Dynamic k-Clustering ICML 2021
Efficient Truthful Scheduling and Resource Allocation through Monitoring AAAI 2021
Online A-Optimal Design and Active Linear Regression ICML 2021
Budget Feasible Mechanisms Over Graphs AAAI 2021
Sequential Algorithms for Testing Closeness of Distributions NIPS 2021
Fast Routing under Uncertainty: Adaptive Learning in Congestion Games via Exponential Weights NIPS 2021
Online Learning with Optimism and Delay ICML 2021
Fairness and Bias in Online Selection ICML 2021
Making the most of your day: online learning for optimal allocation of time NIPS 2021
Online Optimization in Games via Control Theory: Connecting Regret, Passivity and Poincaré Recurrence ICML 2021
Multinomial Logit Contextual Bandits: Provable Optimality and Practicality AAAI 2021
Online Learning Meets Machine Translation Evaluation: Finding the Best Systems with the Least Human Effort IJCNLP 2021
Best Model Identification: A Rested Bandit Formulation ICML 2021
Online Adaptation to Label Distribution Shift NIPS 2021
Learning-to-learn non-convex piecewise-Lipschitz functions NIPS 2021
Efficient Deviation Types and Learning for Hindsight Rationality in Extensive-Form Games ICML 2021
Multi-Receiver Online Bayesian Persuasion ICML 2021