Online Learning

A Bandit Learning Algorithm and Applications to Auction Design NeurIPS 2020 Achieving Fairness in the Stochastic Multi-Armed Bandit Problem AAAI 2020 A Closer Look at Small-loss Bounds for Bandits with Graph Feedback COLT 2020 A Computational Separation between Private Learning and Online Learning NeurIPS 2020 Adaptive Aggregation of Arbitrary Online Trackers with a Regret Bound WACV 2020 Adaptive Estimator Selection for Off-Policy Evaluation ICML 2020 A Low Complexity Algorithm with O(√T) Regret and O(1) Constraint Violations for Online Convex Optimization with Long Term Constraints JMLR 2020 Analysis and Design of Thompson Sampling for Stochastic Partial Monitoring NeurIPS 2020 An Implicit Form of Krasulina's k-PCA Update without the Orthonormality Constraint AAAI 2020 An Online Learning Framework for Energy-Efficient Navigation of Electric Vehicles IJCAI 2020 A Simple Online Algorithm for Competing with Dynamic Comparators UAI 2020 A Single Recipe for Online Submodular Maximization with Adversarial or Stochastic Constraints NeurIPS 2020 A Skip-Connected Evolving Recurrent Neural Network for Data Stream Classification under Label Latency Scenario AAAI 2020 A Tight Lower Bound and Efficient Reduction for Swap Regret NeurIPS 2020 A Unified Framework of Online Learning Algorithms for Training Recurrent Neural Networks JMLR 2020 Batched Coarse Ranking in Multi-Armed Bandits NeurIPS 2020 Bayesian joint state and parameter tracking in autoregressive models L4DC 2020 Budgeted Online Influence Maximization ICML 2020 Closure Properties for Private Classification and Online Prediction COLT 2020 Delay and Cooperation in Nonstochastic Linear Bandits NeurIPS 2020 Distributed Bandit Learning: Near-Optimal Regret with Efficient Communication ICLR 2020 Divergence-Based Motivation for Online EM and Combining Hidden Variable Models UAI 2020 Efficient improper learning for online logistic regression COLT 2020 Efficient Large-Scale Gaussian Process Bandits by Believing only Informative Actions L4DC 2020 Efficient Online Learning of Optimal Rankings: Dimensionality Reduction via Gradient Descent NeurIPS 2020