Online Learning

Higher-Order Regret Bounds with Switching Costs COLT 2014 Improved Bounds for Online Learning Over the Permutahedron and Other Ranking Polytopes AISTATS 2014 Improving offline evaluation of contextual bandit algorithms via bootstrapping techniques ICML 2014 Incremental Activity Modeling and Recognition in Streaming Videos CVPR 2014 Incremental Clustering: The Case for Extra Clusters NeurIPS 2014 Learning Multiple Tasks in Parallel with a Shared Annotator NeurIPS 2014 Learning the Learning Rate for Prediction with Expert Advice NeurIPS 2014 Learning Theory and Algorithms for revenue optimization in second price auctions with reserve ICML 2014 Learning to Optimize via Information-Directed Sampling NeurIPS 2014 Lipschitz Bandits: Regret Lower Bound and Optimal Algorithms COLT 2014 Mondrian Forests: Efficient Online Random Forests NeurIPS 2014 Multiarmed Bandits With Limited Expert Advice COLT 2014 Near-Optimally Teaching the Crowd to Classify ICML 2014 Online and Stochastic Gradient Methods for Non-decomposable Loss Functions NeurIPS 2014 Online Bayesian Passive-Aggressive Learning ICML 2014 Online combinatorial optimization with stochastic decision sets and adversarial losses NeurIPS 2014 Online Decision-Making in General Combinatorial Spaces NeurIPS 2014 Online Learning with Composite Loss Functions COLT 2014 Online Linear Optimization via Smoothing COLT 2014 Online matrix prediction for sparse loss matrices ACML 2014 Online Non-Parametric Regression COLT 2014 Online Optimization for Max-Norm Regularization NeurIPS 2014 Online Passive Aggressive Active Learning and Its Applications ACML 2014 Open Problem: Efficient Online Sparse Regression COLT 2014 Open Problem: Finding Good Cascade Sampling Processes for the Network Inference Problem COLT 2014