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

Hardness of Online Sleeping Combinatorial Optimization Problems NIPS 2016
Combinatorial semi-bandit with known covariance NIPS 2016
Minimizing the Maximal Loss: How and Why ICML 2016
Provable Efficient Online Matrix Completion via Non-convex Stochastic Gradient Descent NIPS 2016
Community Detection on Evolving Graphs NIPS 2016
No-Regret Algorithms for Heavy-Tailed Linear Bandits ICML 2016
Cheap Bandits ICML 2015
Achieving All with No Parameters: AdaNormalHedge COLT 2015
Simple regret for infinitely many armed bandits ICML 2015
Competing with the Empirical Risk Minimizer in a Single Pass COLT 2015
Multiarmed Bandits With Limited Expert Advice COLT 2014
Dual online inference for latent Dirichlet allocation ACML 2014
Bandit Convex Optimization: Towards Tight Bounds NIPS 2014
Open Problem: Shifting Experts on Easy Data COLT 2014
Repeated Contextual Auctions with Strategic Buyers NIPS 2014
Online Passive-Aggressive Algorithms for Non-Negative Matrix Factorization and Completion AISTATS 2014
Bounded Regret for Finite-Armed Structured Bandits NIPS 2014
Contextual Bandits with Similarity Information JMLR 2014
Fundamental Limits of Online and Distributed Algorithms for Statistical Learning and Estimation NIPS 2014
Learning a set of directions COLT 2013
Dimension-Free Exponentiated Gradient NIPS 2013
Learning Policies for Contextual Submodular Prediction ICML 2013
Random Spanning Trees and the Prediction of Weighted Graphs JMLR 2013
Stable Coactive Learning via Perturbation ICML 2013
Online Learning for Time Series Prediction COLT 2013