online learning

1770 papers

Explore in graph

Also known as

OLO OL

Co-occurring keywords

regret bound (1918) multi-armed bandit (1091) stochastic optimization (1060) regret minimization (315) contextual bandit (379) reinforcement learning (4122) online algorithm (444) convex optimization (1320) adversarial learning (1592) continual learning (1164)

Papers

Learner-Private Convex Optimization ICML 2021

Low-Rank Generalized Linear Bandit Problems AISTATS 2021

Optimal regret algorithm for Pseudo-1d Bandit Convex Optimization ICML 2021

Provably Efficient Reinforcement Learning with Linear Function Approximation under Adaptivity Constraints NIPS 2021

Zeroth-Order Non-Convex Learning via Hierarchical Dual Averaging ICML 2021

Multi-layered Network Exploration via Random Walks: From Offline Optimization to Online Learning ICML 2021

Sparsity-Agnostic Lasso Bandit ICML 2021

Mirror Descent and the Information Ratio COLT 2021

Stochastic Shortest Path with Adversarially Changing Costs IJCAI 2021

Parametric Graph for Unimodal Ranking Bandit ICML 2021

No-regret Algorithms for Capturing Events in Poisson Point Processes ICML 2021

Dominate or Delete: Decentralized Competing Bandits in Serial Dictatorship AISTATS 2021

Heuristic-Guided Reinforcement Learning NIPS 2021

Online Variational Filtering and Parameter Learning NIPS 2021

Learning in Non-Cooperative Configurable Markov Decision Processes NIPS 2021

Logarithmic Regret in Feature-based Dynamic Pricing NIPS 2021

Linear Bandits on Uniformly Convex Sets JMLR 2021

Neural Pseudo-Label Optimism for the Bank Loan Problem NIPS 2021

On Optimal Robustness to Adversarial Corruption in Online Decision Problems NIPS 2021

Online Sign Identification: Minimization of the Number of Errors in Thresholding Bandits NIPS 2021

A Normative and Biologically Plausible Algorithm for Independent Component Analysis NIPS 2021

Bilevel Online Adaptation for Out-of-Domain Human Mesh Reconstruction CVPR 2021

Differentially Private Online Submodular Maximization AISTATS 2021

The Lazy Online Subgradient Algorithm is Universal on Strongly Convex Domains NIPS 2021

Delving Deep Into Many-to-Many Attention for Few-Shot Video Object Segmentation CVPR 2021