← Learning Types
Machine Learning › Learning Types ›

Online Learning

1012 directly classified papers

Papers per year

Papers

Learning from discriminative feature feedback NIPS 2018
Multiple-Step Greedy Policies in Approximate and Online Reinforcement Learning NIPS 2018
Contextual Pricing for Lipschitz Buyers NIPS 2018
Regret Bounds for Online Portfolio Selection with a Cardinality Constraint NIPS 2018
Improving Online Algorithms via ML Predictions NIPS 2018
Horizon-Independent Minimax Linear Regression NIPS 2018
Policy Regret in Repeated Games NIPS 2018
Efficient Online Portfolio with Logarithmic Regret NIPS 2018
Learning Optimal Reserve Price against Non-myopic Bidders NIPS 2018
Online convex optimization for cumulative constraints NIPS 2018
Linear Stochastic Approximation: How Far Does Constant Step-Size and Iterate Averaging Go? AISTATS 2018
Nonstochastic Bandits with Composite Anonymous Feedback COLT 2018
Online Kernel Selection via Incremental Sketched Kernel Alignment IJCAI 2018
Cost-aware Cascading Bandits IJCAI 2018
Adaptive Learning with Unknown Information Flows NIPS 2018
Differential Privacy for Growing Databases NIPS 2018
Online Improper Learning with an Approximation Oracle NIPS 2018
Constant Regret, Generalized Mixability, and Mirror Descent NIPS 2018
Online Adaptive Methods, Universality and Acceleration NIPS 2018
Compiling Combinatorial Prediction Games ICML 2018
Preventing Disparate Treatment in Sequential Decision Making IJCAI 2018
Steering Social Activity: A Stochastic Optimal Control Point Of View JMLR 2018
Reward Maximization Under Uncertainty: Leveraging Side-Observations on Networks JMLR 2018
Streaming kernel regression with provably adaptive mean, variance, and regularization JMLR 2018
Meta-Level Control of Anytime Algorithms with Online Performance Prediction IJCAI 2018