← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

A Real-Time Game Theoretic Planner for Autonomous Two-Player Drone Racing RSS 2018
Multi-Path Transport for RDMA in Datacenters NSDI 2018
Efficient Mechanisms for Peer Grading and Dueling Bandits ACML 2018
Parallelizing Stochastic Gradient Descent for Least Squares Regression: Mini-batching, Averaging, and Model Misspecification JMLR 2018
Contextual Pricing for Lipschitz Buyers NIPS 2018
Regret Bounds for Robust Adaptive Control of the Linear Quadratic Regulator NIPS 2018
Thompson Sampling for Combinatorial Semi-Bandits ICML 2018
Solving Patrolling Problems in the Internet Environment IJCAI 2018
Performance Analysis of Cloud Applications NSDI 2018
Multi-objective Contextual Bandit Problem with Similarity Information AISTATS 2018
Efficient and Correct Test Scheduling for Ensembles of Network Policies NSDI 2018
Near-Optimal Policies for Dynamic Multinomial Logit Assortment Selection Models NIPS 2018
Firing Bandits: Optimizing Crowdfunding ICML 2018
Optimistic optimization of a Brownian NIPS 2018
Competing with Automata-based Expert Sequences AISTATS 2018
Combinatorial Semi-Bandits with Knapsacks AISTATS 2018
Online Continuous Submodular Maximization AISTATS 2018
Online Ensemble Multi-kernel Learning Adaptive to Non-stationary and Adversarial Environments AISTATS 2018
NetChain: Scale-Free Sub-RTT Coordination NSDI 2018
Methods for off-line/on-line optimization under uncertainty IJCAI 2018
Adaptivity to Smoothness in X-armed bandits COLT 2018
Meta-Level Control of Anytime Algorithms with Online Performance Prediction IJCAI 2018
UCBoost: A Boosting Approach to Tame Complexity and Optimality for Stochastic Bandits IJCAI 2018
Competitive Caching with Machine Learned Advice ICML 2018
Bandit Learning with Positive Externalities NIPS 2018