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
Fairness and Efficiency in Online Class Matching
NeurIPS 2024
Fair Online Bilateral Trade
NeurIPS 2024
Fair Secretaries with Unfair Predictions
NeurIPS 2024
Faster Convergence with MultiWay Preferences
AISTATS 2024
Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms
NeurIPS 2024
Fast White-Box Adversarial Streaming Without a Random Oracle
ICML 2024
Federated Combinatorial Multi-Agent Multi-Armed Bandits
ICML 2024
Federated Contextual Cascading Bandits with Asynchronous Communication and Heterogeneous Users
AAAI 2024
Feel-Good Thompson Sampling for Contextual Dueling Bandits
ICML 2024
First Passage Percolation with Queried Hints
AISTATS 2024
Fixed-Budget Real-Valued Combinatorial Pure Exploration of Multi-Armed Bandit
AISTATS 2024
Follow-the-Perturbed-Leader with Fréchet-type Tail Distributions: Optimality in Adversarial Bandits and Best-of-Both-Worlds
COLT 2024
Fully Unconstrained Online Learning
NeurIPS 2024
Generalized Linear Bandits with Limited Adaptivity
NeurIPS 2024
Global Rewards in Restless Multi-Armed Bandits
NeurIPS 2024
Gradient Methods for Online DR-Submodular Maximization with Stochastic Long-Term Constraints
NeurIPS 2024
Gradient-Variation Online Learning under Generalized Smoothness
NeurIPS 2024
Greedy-Based Online Fair Allocation with Adversarial Input: Enabling Best-of-Many-Worlds Guarantees
AAAI 2024
Group-wise oracle-efficient algorithms for online multi-group learning
NeurIPS 2024
Guiding GBFS through Learned Pairwise Rankings
IJCAI 2024
Horus: Granular In-Network Task Scheduler for Cloud Datacenters
NSDI 2024
How Does Variance Shape the Regret in Contextual Bandits?
NeurIPS 2024
Identifying Copeland Winners in Dueling Bandits with Indifferences
AISTATS 2024
Improved Analysis for Bandit Learning in Matching Markets
NeurIPS 2024
Improved Approximation of Weighted MMS Fairness for Indivisible Chores
IJCAI 2024