Online Algorithms
2,404 papers
Papers per year
2
1
1
6
6
10
14
16
36
31
45
48
59
77
91
126
183
229
283
280
341
301
182
36
'5
'10
'15
'20
'25
Papers
Efficient Methods for Non-stationary Online Learning
NeurIPS 2022
Efficient Online Linear Control with Stochastic Convex Costs and Unknown Dynamics
COLT 2022
Efficient Projection-Free Online Convex Optimization with Membership Oracle
COLT 2022
Efficient Resource Allocation with Secretive Agents
IJCAI 2022
Efficient Scheduling Policies for Microsecond-Scale Tasks
NSDI 2022
Elixir: A High-performance and Low-cost Approach to Managing Hardware/Software Hybrid Flow Tables Considering Flow Burstiness
NSDI 2022
Envy-Free and Pareto-Optimal Allocations for Agents with Asymmetric Random Valuations
IJCAI 2022
Equilibrium Finding in Normal-Form Games via Greedy Regret Minimization
AAAI 2022
Equity Promotion in Online Resource Allocation
AAAI 2022
Equivalence Analysis between Counterfactual Regret Minimization and Online Mirror Descent
ICML 2022
ESCADA: Efficient Safety and Context Aware Dose Allocation for Precision Medicine
NeurIPS 2022
Exact simulation of diffusion first exit times: algorithm acceleration
JMLR 2022
Expected Regret and Pseudo-Regret are Equivalent When the Optimal Arm is Unique
JMLR 2022
Exploiting Correlation to Achieve Faster Learning Rates in Low-Rank Preference Bandits
AISTATS 2022
Exploring the Algorithm-Dependent Generalization of AUPRC Optimization with List Stability
NeurIPS 2022
Finite-Time Regret of Thompson Sampling Algorithms for Exponential Family Multi-Armed Bandits
NeurIPS 2022
Fixed-Budget Best-Arm Identification in Structured Bandits
IJCAI 2022
Fourier Learning with Cyclical Data
ICML 2022
Game Redesign in No-regret Game Playing
IJCAI 2022
Group Meritocratic Fairness in Linear Contextual Bandits
NeurIPS 2022
Identifying near-optimal decisions in linear-in-parameter bandit models with continuous decision sets
UAI 2022
Improved Pure Exploration in Linear Bandits with No-Regret Learning
IJCAI 2022
Improved Regret Analysis for Variance-Adaptive Linear Bandits and Horizon-Free Linear Mixture MDPs
NeurIPS 2022
Improving Dynamic Regret in Distributed Online Mirror Descent Using Primal and Dual Information
L4DC 2022
Instance Dependent Regret Analysis of Kernelized Bandits
ICML 2022