Online Algorithms

On preserving non-discrimination when combining expert advice NeurIPS 2018 Opinion Diffusion and Campaigning on Society Graphs IJCAI 2018 Optimal Bidding Strategy for Brand Advertising IJCAI 2018 Optimistic optimization of a Brownian NeurIPS 2018 Parallelizing Stochastic Gradient Descent for Least Squares Regression: Mini-batching, Averaging, and Model Misspecification JMLR 2018 Performance Analysis of Cloud Applications NSDI 2018 Private Sequential Learning COLT 2018 Profitable Bandits ACML 2018 Proportional Allocation: Simple, Distributed, and Diverse Matching with High Entropy ICML 2018 Pure Exploration in Infinitely-Armed Bandit Models with Fixed-Confidence ALT 2018 Refining the Confidence Level for Optimistic Bandit Strategies JMLR 2018 Regional Multi-Armed Bandits AISTATS 2018 Regret Bounds for Online Portfolio Selection with a Cardinality Constraint NeurIPS 2018 Regret Bounds for Robust Adaptive Control of the Linear Quadratic Regulator NeurIPS 2018 Robust Subspace Approximation in a Stream NeurIPS 2018 SAFFRON: an Adaptive Algorithm for Online Control of the False Discovery Rate ICML 2018 Scalar Posterior Sampling with Applications NeurIPS 2018 Scheduling under Uncertainty: A Query-based Approach IJCAI 2018 Semiparametric Contextual Bandits ICML 2018 Sequential prediction with coded side information under logarithmic loss ALT 2018 Sharing, Protection, and Compatibility for Reconfigurable Fabric with AmorphOS OSDI 2018 Single-Agent Policy Tree Search With Guarantees NeurIPS 2018 Smoothed Online Convex Optimization in High Dimensions via Online Balanced Descent COLT 2018 Solving Patrolling Problems in the Internet Environment IJCAI 2018 Sparsity, variance and curvature in multi-armed bandits ALT 2018