Online Algorithms

Prior-Free Dynamic Auctions with Low Regret Buyers NeurIPS 2019 Private Learning Implies Online Learning: An Efficient Reduction NeurIPS 2019 Problem-dependent Regret Bounds for Online Learning with Feedback Graphs UAI 2019 Procrastinating with Confidence: Near-Optimal, Anytime, Adaptive Algorithm Configuration NeurIPS 2019 Profiles, Proxies, and Assumptions: Decentralized, Communications-Resilient Planning, Allocation, and Scheduling AAAI 2019 Profit-driven Task Assignment in Spatial Crowdsourcing IJCAI 2019 Projection Free Online Learning over Smooth Sets AISTATS 2019 Pure entropic regularization for metrical task systems COLT 2019 Pure Exploration with Multiple Correct Answers NeurIPS 2019 Query-focused Sentence Compression in Linear Time EMNLP 2019 Reallocating Multiple Facilities on the Line IJCAI 2019 Regularized Contextual Bandits AISTATS 2019 Robust Frequent Directions with Application in Online Learning JMLR 2019 Sample complexity of partition identification using multi-armed bandits COLT 2019 Scalable and Congestion-Aware Routing for Autonomous Mobility-On-Demand Via Frank-Wolfe Optimization RSS 2019 Scale-free adaptive planning for deterministic dynamics & discounted rewards ICML 2019 Secretary Ranking with Minimal Inversions NeurIPS 2019 Sequential Experimental Design for Transductive Linear Bandits NeurIPS 2019 Shinjuku: Preemptive Scheduling for μsecond-scale Tail Latency NSDI 2019 SIC-MMAB: Synchronisation Involves Communication in Multiplayer Multi-Armed Bandits NeurIPS 2019 Sorted Top-k in Rounds COLT 2019 Stardust: Divide and Conquer in the Data Center Network NSDI 2019 Stay With Me: Lifetime Maximization Through Heteroscedastic Linear Bandits With Reneging ICML 2019 Stochastic Bandits with Context Distributions NeurIPS 2019 Sublinear Space Private Algorithms Under the Sliding Window Model ICML 2019