Skip to content
conftrace_

online learning

1,990 papers

OL

Papers

Littlestone Classes are Privately Online Learnable NeurIPS 2021 Logarithmic Regret in Feature-based Dynamic Pricing NeurIPS 2021 Low-Rank Generalized Linear Bandit Problems AISTATS 2021 Majorizing Measures, Sequential Complexities, and Online Learning COLT 2021 Making the most of your day: online learning for optimal allocation of time NeurIPS 2021 Margin-Independent Online Multiclass Learning via Convex Geometry NeurIPS 2021 Max-Utility Based Arm Selection Strategy For Sequential Query Recommendations ACML 2021 Minimax Optimal Quantile and Semi-Adversarial Regret via Root-Logarithmic Regularizers NeurIPS 2021 Mirror Descent and the Information Ratio COLT 2021 Mixability made efficient: Fast online multiclass logistic regression NeurIPS 2021 Model-Free Online Learning in Unknown Sequential Decision Making Problems and Games AAAI 2021 Model-Targeted Poisoning Attacks with Provable Convergence ICML 2021 Model Uncertainty Guides Visual Object Tracking AAAI 2021 Multi-armed Bandit Requiring Monotone Arm Sequences NeurIPS 2021 Multi-Armed Bandits with Cost Subsidy AISTATS 2021 Multi-layered Network Exploration via Random Walks: From Offline Optimization to Online Learning ICML 2021 Multi-Receiver Online Bayesian Persuasion ICML 2021 Multitask Bandit Learning Through Heterogeneous Feedback Aggregation AISTATS 2021 Neural Pseudo-Label Optimism for the Bank Loan Problem NeurIPS 2021 Non-uniform Consistency of Online Learning with Random Sampling ALT 2021 No-regret Algorithms for Capturing Events in Poisson Point Processes ICML 2021 No-regret Online Learning over Riemannian Manifolds NeurIPS 2021 Online Active Learning with Surrogate Loss Functions NeurIPS 2021 Online Active Model Selection for Pre-trained Classifiers AISTATS 2021 Online Adaptation to Label Distribution Shift NeurIPS 2021