conftrace_
← Optimization & Theory
Machine Learning › Optimization & Theory ›

Online Algorithms

806 papers

Papers per year

6
24
87
21
'10
'15
'20
'25

Papers

Efficient Algorithms for Extreme Bandits AISTATS 2022
Learning Competitive Equilibria in Exchange Economies with Bandit Feedback AISTATS 2022
Top K Ranking for Multi-Armed Bandit with Noisy Evaluations AISTATS 2022
Minimal Expected Regret in Linear Quadratic Control AISTATS 2022
Efficient and Optimal Fixed-Time Regret with Two Experts ALT 2022
Universal Online Learning: an Optimistically Universal Learning Rule COLT 2022
The Pareto Frontier of Instance-Dependent Guarantees in Multi-Player Multi-Armed Bandits with no Communication COLT 2022
Thompson Sampling Achieves $\tilde{O}(\sqrt{T})$ Regret in Linear Quadratic Control COLT 2022
Return of the bias: Almost minimax optimal high probability bounds for adversarial linear bandits COLT 2022
Bandits for Structure Perturbation-Based Black-Box Attacks To Graph Neural Networks With Theoretical Guarantees CVPR 2022
Greedy when Sure and Conservative when Uncertain about the Opponents ICML 2022
Breaking the $\sqrtT$ Barrier: Instance-Independent Logarithmic Regret in Stochastic Contextual Linear Bandits ICML 2022
A Reduction from Linear Contextual Bandits Lower Bounds to Estimations Lower Bounds ICML 2022
Regret Minimization with Performative Feedback ICML 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
Cooperative Online Learning in Stochastic and Adversarial MDPs ICML 2022
Decentralized Online Convex Optimization in Networked Systems ICML 2022
Stochastic Rising Bandits ICML 2022
Feature and Parameter Selection in Stochastic Linear Bandits ICML 2022
Universal and data-adaptive algorithms for model selection in linear contextual bandits ICML 2022
Sample-Efficient Reinforcement Learning with loglog(T) Switching Cost ICML 2022
One-Pass Algorithms for MAP Inference of Nonsymmetric Determinantal Point Processes ICML 2022
Versatile Dueling Bandits: Best-of-both World Analyses for Learning from Relative Preferences ICML 2022
Instance Dependent Regret Analysis of Kernelized Bandits ICML 2022