Skip to content
conftrace_

online learning

1,990 papers

OL

Papers

Task-Agnostic Online Reinforcement Learning with an Infinite Mixture of Gaussian Processes NeurIPS 2020 Temporal Variability in Implicit Online Learning NeurIPS 2020 Thompson Sampling for Adversarial Bit Prediction ALT 2020 Tight First- and Second-Order Regret Bounds for Adversarial Linear Bandits NeurIPS 2020 Towards Non-Parametric Drift Detection via Dynamic Adapting Window Independence Drift Detection (DAWIDD) ICML 2020 Trading-Off Static and Dynamic Regret in Online Least-Squares and Beyond AAAI 2020 Training Recurrent Neural Networks Online by Learning Explicit State Variables ICLR 2020 VoiceID on the Fly: A Speaker Recognition System that Learns from Scratch Interspeech 2020 When Demands Evolve Larger and Noisier: Learning and Earning in a Growing Environment ICML 2020 Accelerating Imitation Learning with Predictive Models AISTATS 2019 Adaptive Scale-Invariant Online Algorithms for Learning Linear Models ICML 2019 Adversarial Online Learning with noise ICML 2019 A Generalization Bound for Online Variational Inference ACML 2019 A Local Block Coordinate Descent Algorithm for the CSC Model CVPR 2019 An Information-Theoretic Approach to Minimax Regret in Partial Monitoring COLT 2019 An Online Learning Approach to Model Predictive Control RSS 2019 Anytime Online-to-Batch, Optimism and Acceleration ICML 2019 Approximations of the Restless Bandit Problem JMLR 2019 A Robust Non-Clairvoyant Dynamic Mechanism for Contextual Auctions NeurIPS 2019 A Theory of Selective Prediction COLT 2019 ATOM: Accurate Tracking by Overlap Maximization CVPR 2019 Bandit Multiclass Linear Classification: Efficient Algorithms for the Separable Case ICML 2019 Bandit Online Learning with Unknown Delays AISTATS 2019 Batch-Size Independent Regret Bounds for the Combinatorial Multi-Armed Bandit Problem COLT 2019 Beating Stochastic and Adversarial Semi-bandits Optimally and Simultaneously ICML 2019