Online Algorithms

What You See May Not Be What You Get: UCB Bandit Algorithms Robust to ε-Contamination UAI 2020 When Demands Evolve Larger and Noisier: Learning and Earning in a Growing Environment ICML 2020 A 2-Approximation Algorithm for the Online Tethered Coverage Problem RSS 2019 A Bandit Approach to Maximum Inner Product Search AAAI 2019 Achieving a Fairer Future by Changing the Past IJCAI 2019 Achieving Optimal Dynamic Regret for Non-stationary Bandits without Prior Information COLT 2019 Active Exploration in Markov Decision Processes AISTATS 2019 AdaLinUCB: Opportunistic Learning for Contextual Bandits IJCAI 2019 Adaptive Influence Maximization with Myopic Feedback NeurIPS 2019 Adaptively Tracking the Best Bandit Arm with an Unknown Number of Distribution Changes COLT 2019 Adaptive Monte Carlo Multiple Testing via Multi-Armed Bandits ICML 2019 Adaptive Regret of Convex and Smooth Functions ICML 2019 Adaptive Sensor Placement for Continuous Spaces ICML 2019 Adaptivity and Optimality: A Universal Algorithm for Online Convex Optimization UAI 2019 ADDIS: an adaptive discarding algorithm for online FDR control with conservative nulls NeurIPS 2019 A*+IDA*: A Simple Hybrid Search Algorithm IJCAI 2019 An Efficient Algorithm for Skeptical Preferred Acceptance in Dynamic Argumentation Frameworks IJCAI 2019 A New Perspective on Pool-Based Active Classification and False-Discovery Control NeurIPS 2019 An Information-Theoretic Approach to Minimax Regret in Partial Monitoring COLT 2019 An Online Learning Approach to Model Predictive Control RSS 2019 Anytime Online-to-Batch, Optimism and Acceleration ICML 2019 A Practical Semi-Parametric Contextual Bandit IJCAI 2019 A Robust Non-Clairvoyant Dynamic Mechanism for Contextual Auctions NeurIPS 2019 Artificial Constraints and Hints for Unbounded Online Learning COLT 2019 A Theory of Selective Prediction COLT 2019