Skip to content
conftrace_

online learning

1,990 papers

OL

Papers

A Contextual Bandit Bake-off JMLR 2021 Active Online Learning with Hidden Shifting Domains AISTATS 2021 Addressing the Long-term Impact of ML Decisions via Policy Regret IJCAI 2021 Adversarial Online Learning with Changing Action Sets: Efficient Algorithms with Approximate Regret Bounds ALT 2021 A Hybrid Bandit Framework for Diversified Recommendation AAAI 2021 An online passive-aggressive algorithm for difference-of-squares classification NeurIPS 2021 An online semi-definite programming with a generalised log-determinant regularizer and its applications ACML 2021 A Normative and Biologically Plausible Algorithm for Independent Component Analysis NeurIPS 2021 A One-Size-Fits-All Solution to Conservative Bandit Problems AAAI 2021 AutoBandit: A Meta Bandit Online Learning System IJCAI 2021 Bandit Convex Optimization in Non-stationary Environments JMLR 2021 Bandit Phase Retrieval NeurIPS 2021 Bandits with partially observable confounded data UAI 2021 Best-case lower bounds in online learning NeurIPS 2021 Beyond Bandit Feedback in Online Multiclass Classification NeurIPS 2021 Bilevel Online Adaptation for Out-of-Domain Human Mesh Reconstruction CVPR 2021 Black-Box Control for Linear Dynamical Systems COLT 2021 Bubblewrap: Online tiling and real-time flow prediction on neural manifolds NeurIPS 2021 Capturing Delayed Feedback in Conversion Rate Prediction via Elapsed-Time Sampling AAAI 2021 ChaCha for Online AutoML ICML 2021 Collect & Infer - a fresh look at data-efficient Reinforcement Learning CoRL 2021 Combinatorial semi-bandit in the non-stationary environment UAI 2021 Confidence-Budget Matching for Sequential Budgeted Learning ICML 2021 Contextual Bandits with Delayed Feedback and Semi-supervised Learning (Student Abstract) AAAI 2021 Contextual Recommendations and Low-Regret Cutting-Plane Algorithms NeurIPS 2021