Online Algorithms

Efficient Adaptive Online Learning via Frequent Directions IJCAI 2018 Efficient and Correct Test Scheduling for Ensembles of Network Policies NSDI 2018 Efficient Bandit Combinatorial Optimization Algorithm with Zero-suppressed Binary Decision Diagrams AISTATS 2018 Efficient Computation of Approximate Equilibria in Discrete Colonel Blotto Games IJCAI 2018 Efficient Mechanisms for Peer Grading and Dueling Bandits ACML 2018 Efficient online algorithms for fast-rate regret bounds under sparsity NeurIPS 2018 Efficient Online Portfolio with Logarithmic Regret NeurIPS 2018 Enhancing the Accuracy and Fairness of Human Decision Making NeurIPS 2018 Factored Bandits NeurIPS 2018 Faster Online Learning of Optimal Threshold for Consistent F-measure Optimization NeurIPS 2018 Faster Rates for Convex-Concave Games COLT 2018 Firing Bandits: Optimizing Crowdfunding ICML 2018 Generalized Binary Search For Split-Neighborly Problems AISTATS 2018 Generalized Inverse Optimization through Online Learning NeurIPS 2018 Growth-Optimal Portfolio Selection under CVaR Constraints AISTATS 2018 HONES: A Fast and Tuning-free Homotopy Method For Online Newton Step AISTATS 2018 Horizon-Independent Minimax Linear Regression NeurIPS 2018 Improving Online Algorithms via ML Predictions NeurIPS 2018 LeapsAndBounds: A Method for Approximately Optimal Algorithm Configuration ICML 2018 Learning Optimal Reserve Price against Non-myopic Bidders NeurIPS 2018 Maximum Selection and Sorting with Adversarial Comparators JMLR 2018 Medoids in Almost-Linear Time via Multi-Armed Bandits AISTATS 2018 Meta-Level Control of Anytime Algorithms with Online Performance Prediction IJCAI 2018 Methods for off-line/on-line optimization under uncertainty IJCAI 2018 Minimax Rates and Efficient Algorithms for Noisy Sorting ALT 2018