Online Algorithms

Decentralized Multi-player Multi-armed Bandits with No Collision Information AISTATS 2020 Delay and Cooperation in Nonstochastic Linear Bandits NeurIPS 2020 Derivative-Free & Order-Robust Optimisation AISTATS 2020 Did That Lost Ballot Box Cost Me a Seat? Computing Manipulations of STV Elections AAAI 2020 Dimension-Free Bounds for Chasing Convex Functions COLT 2020 Distributed Online Optimization over a Heterogeneous Network with Any-Batch Mirror Descent ICML 2020 Draining the Water Hole: Mitigating Social Engineering Attacks with CyberTWEAK AAAI 2020 Dual Mirror Descent for Online Allocation Problems ICML 2020 Dynamic Multi-Robot Task Allocation under Uncertainty and Temporal Constraints RSS 2020 Dynamic Regret of Convex and Smooth Functions NeurIPS 2020 Efficient and Robust High-Dimensional Linear Contextual Bandits IJCAI 2020 Efficient Contextual Bandits with Continuous Actions NeurIPS 2020 Efficient Online Learning of Optimal Rankings: Dimensionality Reduction via Gradient Descent NeurIPS 2020 Efficient Projection-Free Online Methods with Stochastic Recursive Gradient AAAI 2020 Enabling Programmable Transport Protocols in High-Speed NICs NSDI 2020 End-to-End Transition-Based Online Dialogue Disentanglement IJCAI 2020 Ensemble Gaussian Processes with Spectral Features for Online Interactive Learning with Scalability AISTATS 2020 Exploration by Optimisation in Partial Monitoring COLT 2020 Exploration Through Reward Biasing: Reward-Biased Maximum Likelihood Estimation for Stochastic Multi-Armed Bandits ICML 2020 Faster Projection-free Online Learning COLT 2020 Fast Rates for Online Prediction with Abstention COLT 2020 Fatigue-Aware Bandits for Dependent Click Models AAAI 2020 Feedback graph regret bounds for Thompson Sampling and UCB ALT 2020 Finding All ε-Good Arms in Stochastic Bandits NeurIPS 2020 Finite Continuum-Armed Bandits NeurIPS 2020