conftrace_

online algorithm

445 papers

Explore in graph

Co-occurring keywords

regret bound (1926) multi-armed bandit (1098) online learning (1777) competitive ratio (74) stochastic optimization (1060) competitive analysis (53) learning-augmented algorithm (44) combinatorial optimization (1039) contextual bandit (381) regret minimization (315)

Papers

Near-Optimal Policies for Dynamic Multinomial Logit Assortment Selection Models NIPS 2018
UCBoost: A Boosting Approach to Tame Complexity and Optimality for Stochastic Bandits IJCAI 2018
Zeroth-Order Online Alternating Direction Method of Multipliers: Convergence Analysis and Applications AISTATS 2018
Competitive Caching with Machine Learned Advice ICML 2018
Weakly Consistent Optimal Pricing Algorithms in Repeated Posted-Price Auctions with Strategic Buyer ICML 2018
Online Linear Quadratic Control ICML 2018
Optimal Bidding Strategy for Brand Advertising IJCAI 2018
Efficient Contextual Bandits in Non-stationary Worlds COLT 2018
Combinatorial Pure Exploration with Continuous and Separable Reward Functions and Its Applications IJCAI 2018
Finding Frequent Entities in Continuous Data IJCAI 2018
LeapsAndBounds: A Method for Approximately Optimal Algorithm Configuration ICML 2018
Efficient Bandit Combinatorial Optimization Algorithm with Zero-suppressed Binary Decision Diagrams AISTATS 2018
Monte-Carlo Tree Search for Constrained POMDPs NIPS 2018
Steering Social Activity: A Stochastic Optimal Control Point Of View JMLR 2018
Improved Algorithms for Collaborative PAC Learning NIPS 2018
Differential Privacy for Growing Databases NIPS 2018
Nearly Optimal Robust Subspace Tracking ICML 2018
Restricted Communication in Online Multi-Robot Exploration IJCAI 2018
Faster Rates for Convex-Concave Games COLT 2018
Scheduling under Uncertainty: A Query-based Approach IJCAI 2018
Almost Optimal Algorithms for Linear Stochastic Bandits with Heavy-Tailed Payoffs NIPS 2018
Stochastic Multi-armed Bandits in Constant Space AISTATS 2018
Improving Online Algorithms via ML Predictions NIPS 2018
Nonstochastic Bandits with Composite Anonymous Feedback COLT 2018
Methods for off-line/on-line optimization under uncertainty IJCAI 2018