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

Online Convex Optimization with Stochastic Constraints NIPS 2017
Intrinsic Grassmann Averages for Online Linear and Robust Subspace Learning CVPR 2017
Online Roommate Allocation Problem IJCAI 2017
Perishability of Data: Dynamic Pricing under Varying-Coefficient Models JMLR 2017
Heuristic Online Goal Recognition in Continuous Domains IJCAI 2017
Online Nonnegative Matrix Factorization with General Divergences AISTATS 2017
An Efficient, Sparsity-Preserving, Online Algorithm for Low-Rank Approximation ICML 2017
Efficient tracking of a growing number of experts ALT 2017
Dynamic Revenue Sharing NIPS 2017
Improved Dynamic Regret for Non-degenerate Functions NIPS 2017
A Scale Free Algorithm for Stochastic Bandits with Bounded Kurtosis NIPS 2017
Consistent k-Clustering ICML 2017
Near-Optimal Design of Experiments via Regret Minimization ICML 2017
Follow the Compressed Leader: Faster Online Learning of Eigenvectors and Faster MMWU ICML 2017
Training Deep Networks without Learning Rates Through Coin Betting NIPS 2017
Online to Offline Conversions, Universality and Adaptive Minibatch Sizes NIPS 2017
Efficient Algorithms for Adversarial Contextual Learning ICML 2016
Dueling Bandits: Beyond Condorcet Winners to General Tournament Solutions NIPS 2016
An efficient algorithm for contextual bandits with knapsacks, and an extension to concave objectives COLT 2016
Pricing a Low-regret Seller ICML 2016
Multi-scale exploration of convex functions and bandit convex optimization COLT 2016
Fast Rate Analysis of Some Stochastic Optimization Algorithms ICML 2016
No Regret Bound for Extreme Bandits AISTATS 2016
Online and Distributed Bayesian Moment Matching for Parameter Learning in Sum-Product Networks AISTATS 2016
Importance Weighting Without Importance Weights: An Efficient Algorithm for Combinatorial Semi-Bandits JMLR 2016