Online Algorithms

Storage Fit Learning with Feature Evolvable Streams AAAI 2021 Streaming k-PCA: Efficient guarantees for Oja’s algorithm, beyond rank-one updates COLT 2021 The Hardness Analysis of Thompson Sampling for Combinatorial Semi-bandits with Greedy Oracle NeurIPS 2021 The Lazy Online Subgradient Algorithm is Universal on Strongly Convex Domains NeurIPS 2021 The Limits of Optimal Pricing in the Dark NeurIPS 2021 The Pareto Frontier of model selection for general Contextual Bandits NeurIPS 2021 The Power of Adaptivity for Stochastic Submodular Cover ICML 2021 The Semi-Random Satisfaction of Voting Axioms NeurIPS 2021 The Sparse Vector Technique, Revisited COLT 2021 TMCOSS: Thresholded Multi-Criteria Online Subset Selection for Data-Efficient Autonomous Driving ICCV 2021 Top-k eXtreme Contextual Bandits with Arm Hierarchy ICML 2021 Toward Optimal Solution for the Context-Attentive Bandit Problem IJCAI 2021 Towards Best-of-All-Worlds Online Learning with Feedback Graphs NeurIPS 2021 Tracking Regret Bounds for Online Submodular Optimization AISTATS 2021 Traffic Congestion Alleviation over Dynamic Road Networks: Continuous Optimal Route Combination for Trip Query Streams IJCAI 2021 Traffic Shaping in E-Commercial Search Engine: Multi-Objective Online Welfare Maximization AAAI 2021 Training a Single Bandit Arm AISTATS 2021 Tsallis-INF: An Optimal Algorithm for Stochastic and Adversarial Bandits JMLR 2021 UCB-based Algorithms for Multinomial Logistic Regression Bandits NeurIPS 2021 Understanding Bandits with Graph Feedback NeurIPS 2021 Variance-dependent best arm identification UAI 2021 Variational Bayesian Optimistic Sampling NeurIPS 2021 Zeroth-Order Non-Convex Learning via Hierarchical Dual Averaging ICML 2021 A/B Testing in Dense Large-Scale Networks: Design and Inference NeurIPS 2020 Achieving Fairness in the Stochastic Multi-Armed Bandit Problem AAAI 2020