← Optimization & Theory
Machine Learning › Optimization & Theory ›

Online Algorithms

803 directly classified papers

Papers per year

Papers

Fourier Learning with Cyclical Data ICML 2022
Greedy when Sure and Conservative when Uncertain about the Opponents ICML 2022
An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem NIPS 2022
Bandits for Structure Perturbation-Based Black-Box Attacks To Graph Neural Networks With Theoretical Guarantees CVPR 2022
Universal and data-adaptive algorithms for model selection in linear contextual bandits ICML 2022
NaturalInversion: Data-Free Image Synthesis Improving Real-World Consistency AAAI 2022
Saving Stochastic Bandits from Poisoning Attacks via Limited Data Verification AAAI 2022
Projection-free Distributed Online Learning with Sublinear Communication Complexity JMLR 2022
NeuroLogic A*esque Decoding: Constrained Text Generation with Lookahead Heuristics NAACL 2022
Sample-Efficient Reinforcement Learning with loglog(T) Switching Cost ICML 2022
Efficient Algorithms for Extreme Bandits AISTATS 2022
Feature and Parameter Selection in Stochastic Linear Bandits ICML 2022
Online Influence Maximization with Node-Level Feedback Using Standard Offline Oracles AAAI 2022
Online Learning and Pricing with Reusable Resources: Linear Bandits with Sub-Exponential Rewards ICML 2022
Simultaneously Learning Stochastic and Adversarial Bandits with General Graph Feedback ICML 2022
Multiple-Play Stochastic Bandits with Shareable Finite-Capacity Arms ICML 2022
Risk-Averse No-Regret Learning in Online Convex Games ICML 2022
Versatile Dueling Bandits: Best-of-both World Analyses for Learning from Relative Preferences ICML 2022
Cooperative Online Learning in Stochastic and Adversarial MDPs ICML 2022
Breaking the $\sqrtT$ Barrier: Instance-Independent Logarithmic Regret in Stochastic Contextual Linear Bandits ICML 2022
Decentralized Online Convex Optimization in Networked Systems ICML 2022
A Reduction from Linear Contextual Bandits Lower Bounds to Estimations Lower Bounds ICML 2022
Online Mirror Descent and Dual Averaging: Keeping Pace in the Dynamic Case JMLR 2022
(Optimal) Online Bipartite Matching with Degree Information NIPS 2022
Return of the bias: Almost minimax optimal high probability bounds for adversarial linear bandits COLT 2022