Online Algorithms

Revisiting Online Quantum State Learning AAAI 2020 Robust Algorithms for Online k-means Clustering ALT 2020 Robust Outlier Arm Identification ICML 2020 Robust Pricing in Dynamic Mechanism Design ICML 2020 Robust Stochastic Bandit Algorithms under Probabilistic Unbounded Adversarial Attack AAAI 2020 Safe Linear Stochastic Bandits AAAI 2020 Schatten Norms in Matrix Streams: Hello Sparsity, Goodbye Dimension ICML 2020 Secretary and Online Matching Problems with Machine Learned Advice NeurIPS 2020 Simple and Fast Algorithm for Binary Integer and Online Linear Programming NeurIPS 2020 Sliding Window Algorithms for k-Clustering Problems NeurIPS 2020 SLIP: Learning to predict in unknown dynamical systems with long-term memory NeurIPS 2020 Small Nash Equilibrium Certificates in Very Large Games NeurIPS 2020 Smart Forgetting for Safe Online Learning with Gaussian Processes L4DC 2020 Smooth Contextual Bandits: Bridging the Parametric and Non-differentiable Regret Regimes COLT 2020 Sol: Fast Distributed Computation Over Slow Networks NSDI 2020 Spectral bandits JMLR 2020 Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP IJCAI 2020 Stable Roommate Problem with Diversity Preferences IJCAI 2020 Stage-wise Conservative Linear Bandits NeurIPS 2020 Stateful Posted Pricing with Vanishing Regret via Dynamic Deterministic Markov Decision Processes NeurIPS 2020 Statistical Efficiency of Thompson Sampling for Combinatorial Semi-Bandits NeurIPS 2020 Stochastic Online Learning with Probabilistic Graph Feedback AAAI 2020 Streaming k-Submodular Maximization under Noise subject to Size Constraint ICML 2020 Sundial: Fault-tolerant Clock Synchronization for Datacenters OSDI 2020 Synthesizing strategies under expected and exceptional environment behaviors IJCAI 2020