Skip to content
conftrace_

online learning

1,990 papers

OL

Papers

Combinatorial Multi-Armed Bandit: General Framework and Applications ICML 2013 Competing with an Infinite Set of Models in Reinforcement Learning AISTATS 2013 Competing With Strategies COLT 2013 Concurrent Reinforcement Learning from Customer Interactions ICML 2013 Consistency of Online Random Forests ICML 2013 Counterfactual Reasoning and Learning Systems: The Example of Computational Advertising JMLR 2013 Dimension-Free Exponentiated Gradient NeurIPS 2013 Distributed Exploration in Multi-Armed Bandits NeurIPS 2013 Dual Averaging and Proximal Gradient Descent for Online Alternating Direction Multiplier Method ICML 2013 Efficient Online Inference for Bayesian Nonparametric Relational Models NeurIPS 2013 ELLA: An Efficient Lifelong Learning Algorithm ICML 2013 Estimation Bias in Multi-Armed Bandit Algorithms for Search Advertising NeurIPS 2013 Further Optimal Regret Bounds for Thompson Sampling AISTATS 2013 Hierarchical Regularization Cascade for Joint Learning ICML 2013 How to Hedge an Option Against an Adversary: Black-Scholes Pricing is Minimax Optimal NeurIPS 2013 Large-Scale Bandit Problems and KWIK Learning ICML 2013 Large-Scale Learning with Less RAM via Randomization ICML 2013 Learning Trajectory Preferences for Manipulators via Iterative Improvement NeurIPS 2013 Localization and Adaptation in Online Learning AISTATS 2013 Memoized Online Variational Inference for Dirichlet Process Mixture Models NeurIPS 2013 Minimax Optimal Algorithms for Unconstrained Linear Optimization NeurIPS 2013 Multi-armed Bandit Problem with Lock-up Periods ACML 2013 (Nearly) Optimal Algorithms for Private Online Learning in Full-information and Bandit Settings NeurIPS 2013 One-Pass AUC Optimization ICML 2013 Online Feature Selection for Model-based Reinforcement Learning ICML 2013