← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Towards Logically Centralized Interdomain Routing NSDI 2020
An Asymptotically Optimal Primal-Dual Incremental Algorithm for Contextual Linear Bandits NIPS 2020
Improved Algorithms for Online Submodular Maximization via First-order Regret Bounds NIPS 2020
Learning to Optimize Computational Resources: Frugal Training with Generalization Guarantees AAAI 2020
Revisiting Online Quantum State Learning AAAI 2020
Tsallis-INF for Decoupled Exploration and Exploitation in Multi-armed Bandits COLT 2020
My Fair Bandit: Distributed Learning of Max-Min Fairness with Multi-player Bandits ICML 2020
Competing Bandits in Matching Markets AISTATS 2020
Ensemble Gaussian Processes with Spectral Features for Online Interactive Learning with Scalability AISTATS 2020
Randomized Exploration in Generalized Linear Bandits AISTATS 2020
Fatigue-Aware Bandits for Dependent Click Models AAAI 2020
Dual Mirror Descent for Online Allocation Problems ICML 2020
Incentivized Exploration for Multi-Armed Bandits under Reward Drift AAAI 2020
Adaptive Aggregation of Arbitrary Online Trackers with a Regret Bound WACV 2020
Efficient Contextual Bandits with Continuous Actions NIPS 2020
Projective Quadratic Regression for Online Learning AAAI 2020
Bandit Linear Control NIPS 2020
Online Non-Convex Learning: Following the Perturbed Leader is Optimal ALT 2020
Hypothesis Sketching for Online Kernel Selection in Continuous Kernel Space IJCAI 2020
An Online Learning Framework for Energy-Efficient Navigation of Electric Vehicles IJCAI 2020
Online Algorithm for Unsupervised Sequential Selection with Contextual Information NIPS 2020
Linear Bandits with Feature Feedback AAAI 2020
Adversarial Attacks on Linear Contextual Bandits NIPS 2020
Prediction with Corrupted Expert Advice NIPS 2020
Top-$k$ Combinatorial Bandits with Full-Bandit Feedback ALT 2020