Online Algorithms

Minimizing Adaptive Regret with One Gradient per Iteration IJCAI 2018 Multi-armed Bandits with Compensation NeurIPS 2018 Multinomial Logit Bandit with Linear Utility Functions IJCAI 2018 Multi-objective Contextual Bandit Problem with Similarity Information AISTATS 2018 Multi-Path Transport for RDMA in Datacenters NSDI 2018 {Multi-Player Bandits Revisited} ALT 2018 Multiplicative Weights Updates with Constant Step-Size in Graphical Constant-Sum Games NeurIPS 2018 Nearly Optimal Robust Subspace Tracking ICML 2018 Near-Optimal Policies for Dynamic Multinomial Logit Assortment Selection Models NeurIPS 2018 NetChain: Scale-Free Sub-RTT Coordination NSDI 2018 Nonstochastic Bandits with Composite Anonymous Feedback COLT 2018 Online Adaptive Methods, Universality and Acceleration NeurIPS 2018 Online Continuous Submodular Maximization AISTATS 2018 Online convex optimization for cumulative constraints NeurIPS 2018 Online Ensemble Multi-kernel Learning Adaptive to Non-stationary and Adversarial Environments AISTATS 2018 Online Kernel Selection via Incremental Sketched Kernel Alignment IJCAI 2018 Online Learning of Quantum States NeurIPS 2018 Online Learning with Abstention ICML 2018 Online Learning with an Unknown Fairness Metric NeurIPS 2018 Online Learning with Non-Convex Losses and Non-Stationary Regret AISTATS 2018 Online Linear Quadratic Control ICML 2018 Online Pricing for Revenue Maximization with Unknown Time Discounting Valuations IJCAI 2018 Online Reciprocal Recommendation with Theoretical Performance Guarantees NeurIPS 2018 Online Regression with Partial Information: Generalization and Linear Projection AISTATS 2018 Online Variance Reduction for Stochastic Optimization COLT 2018