online algorithm

Pure entropic regularization for metrical task systems COLT 2019 Reallocating Multiple Facilities on the Line IJCAI 2019 Secretary Ranking with Minimal Inversions NeurIPS 2019 Stochastic algorithms with descent guarantees for ICA AISTATS 2019 Structured Robust Submodular Maximization: Offline and Online Algorithms AISTATS 2019 Submodular Cost Submodular Cover with an Approximate Oracle ICML 2019 Thresholding Bandit with Optimal Aggregate Regret NeurIPS 2019 A fully adaptive algorithm for pure exploration in linear bandits AISTATS 2018 Almost Optimal Algorithms for Linear Stochastic Bandits with Heavy-Tailed Payoffs NeurIPS 2018 Combinatorial Pure Exploration with Continuous and Separable Reward Functions and Its Applications IJCAI 2018 Competitive Caching with Machine Learned Advice ICML 2018 Differential Privacy for Growing Databases NeurIPS 2018 Efficient Bandit Combinatorial Optimization Algorithm with Zero-suppressed Binary Decision Diagrams AISTATS 2018 Efficient Contextual Bandits in Non-stationary Worlds COLT 2018 Faster Rates for Convex-Concave Games COLT 2018 Finding Frequent Entities in Continuous Data IJCAI 2018 Improved Algorithms for Collaborative PAC Learning NeurIPS 2018 Improving Online Algorithms via ML Predictions NeurIPS 2018 LeapsAndBounds: A Method for Approximately Optimal Algorithm Configuration ICML 2018 Methods for off-line/on-line optimization under uncertainty IJCAI 2018 Monte-Carlo Tree Search for Constrained POMDPs NeurIPS 2018 Nearly Optimal Robust Subspace Tracking ICML 2018 Near-Optimal Policies for Dynamic Multinomial Logit Assortment Selection Models NeurIPS 2018 Nonstochastic Bandits with Composite Anonymous Feedback COLT 2018 Online Linear Quadratic Control ICML 2018