Online Algorithms

Corralling a Band of Bandit Algorithms COLT 2017 Correlational Dueling Bandits with Application to Clinical Treatment in Large Decision Spaces IJCAI 2017 Countering Feedback Delays in Multi-Agent Learning NeurIPS 2017 Delta-net: Real-time Network Verification Using Atoms NSDI 2017 Don't Bury your Head in Warnings: A Game-Theoretic Approach for Intelligent Allocation of Cyber-security Alerts IJCAI 2017 Dynamic Revenue Sharing NeurIPS 2017 Efficiency Through Procrastination: Approximately Optimal Algorithm Configuration with Runtime Guarantees IJCAI 2017 Efficient Mechanism Design for Online Scheduling (Extended Abstract) IJCAI 2017 Efficient Online Linear Optimization with Approximation Algorithms NeurIPS 2017 Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation NeurIPS 2017 Emulating the Expert: Inverse Optimization through Online Learning ICML 2017 Fast Rates for Bandit Optimization with Upper-Confidence Frank-Wolfe NeurIPS 2017 Following the Leader and Fast Rates in Online Linear Prediction: Curved Constraint Sets and Other Regularities JMLR 2017 Follow the Compressed Leader: Faster Online Learning of Eigenvectors and Faster MMWU ICML 2017 Identifying Outlier Arms in Multi-Armed Bandit NeurIPS 2017 Identify the Nash Equilibrium in Static Games with Random Payoffs ICML 2017 Improved Dynamic Regret for Non-degenerate Functions NeurIPS 2017 Improved Strongly Adaptive Online Learning using Coin Betting AISTATS 2017 Improving Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms and Its Applications NeurIPS 2017 Influence Maximization with ε-Almost Submodular Threshold Functions NeurIPS 2017 Interactive Submodular Bandit NeurIPS 2017 Lazifying Conditional Gradient Algorithms ICML 2017 Learning with Bandit Feedback in Potential Games NeurIPS 2017 Learning with Limited Rounds of Adaptivity: Coin Tossing, Multi-Armed Bandits, and Ranking from Pairwise Comparisons COLT 2017 Linear Thompson Sampling Revisited AISTATS 2017