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 Pure Exploration for Combinatorial Bandits with Semi-Bandit Feedback
ALT 2021
Efficient Truthful Scheduling and Resource Allocation through Monitoring
AAAI 2021
ESCAPED: Efficient Secure and Private Dot Product Framework for Kernel-based Machine Learning Algorithms with Applications in Healthcare
AAAI 2021
Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries
COLT 2021
Fair Algorithms for Multi-Agent Multi-Armed Bandits
NeurIPS 2021
Fair and Efficient Online Allocations with Normalized Valuations
AAAI 2021
Fairness and Bias in Online Selection
ICML 2021
Faster Algorithms and Constant Lower Bounds for the Worst-Case Expected Error
NeurIPS 2021
Fast Learning for Renewal Optimization in Online Task Scheduling
JMLR 2021
Fast Policy Extragradient Methods for Competitive Games with Entropy Regularization
NeurIPS 2021
Fast Pure Exploration via Frank-Wolfe
NeurIPS 2021
Fast Rate Learning in Stochastic First Price Bidding
ACML 2021
Fast rates for prediction with limited expert advice
NeurIPS 2021
Fast Routing under Uncertainty: Adaptive Learning in Congestion Games via Exponential Weights
NeurIPS 2021
Federated Linear Contextual Bandits
NeurIPS 2021
Federated Multi-armed Bandits with Personalization
AISTATS 2021
Finite-time System Identification and Adaptive Control in Autoregressive Exogenous Systems
L4DC 2021
Follow-the-Regularized-Leader Routes to Chaos in Routing Games
ICML 2021
From Optimality to Robustness: Adaptive Re-Sampling Strategies in Stochastic Bandits
NeurIPS 2021
Fully Gap-Dependent Bounds for Multinomial Logit Bandit
AISTATS 2021
Generalized Linear Bandits with Local Differential Privacy
NeurIPS 2021
Greedy Approximation Algorithms for Active Sequential Hypothesis Testing
NeurIPS 2021
Identification of the Generalized Condorcet Winner in Multi-dueling Bandits
NeurIPS 2021
Implicit Finite-Horizon Approximation and Efficient Optimal Algorithms for Stochastic Shortest Path
NeurIPS 2021
Impossible Tuning Made Possible: A New Expert Algorithm and Its Applications
COLT 2021