conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2,192 papers

Papers per year

1
16
59
225
69
'05
'10
'15
'20
'25

Papers

Benchmarking Scalable Methods for Streaming Cross Document Entity Coreference ACL 2021
Max-Utility Based Arm Selection Strategy For Sequential Query Recommendations ACML 2021
An online semi-definite programming with a generalised log-determinant regularizer and its applications ACML 2021
Fast Rate Learning in Stochastic First Price Bidding ACML 2021
Fully Gap-Dependent Bounds for Multinomial Logit Bandit AISTATS 2021
Online k-means Clustering AISTATS 2021
Consistent k-Median: Simpler, Better and Robust AISTATS 2021
Quick Streaming Algorithms for Maximization of Monotone Submodular Functions in Linear Time AISTATS 2021
Multitask Bandit Learning Through Heterogeneous Feedback Aggregation AISTATS 2021
Budgeted and Non-Budgeted Causal Bandits AISTATS 2021
Corralling Stochastic Bandit Algorithms AISTATS 2021
Smooth Bandit Optimization: Generalization to Holder Space AISTATS 2021
Power of Hints for Online Learning with Movement Costs AISTATS 2021
Stochastic Bandits with Linear Constraints AISTATS 2021
An Optimal Reduction of TV-Denoising to Adaptive Online Learning AISTATS 2021
Federated Multi-armed Bandits with Personalization AISTATS 2021
Training a Single Bandit Arm AISTATS 2021
Tracking Regret Bounds for Online Submodular Optimization AISTATS 2021
Online Robust Control of Nonlinear Systems with Large Uncertainty AISTATS 2021
Revisiting Projection-free Online Learning: the Strongly Convex Case AISTATS 2021
Instance-Wise Minimax-Optimal Algorithms for Logistic Bandits AISTATS 2021
No-substitution k-means Clustering with Adversarial Order ALT 2021
An Efficient Algorithm for Cooperative Semi-Bandits ALT 2021
Last Round Convergence and No-Dynamic Regret in Asymmetric Repeated Games ALT 2021
Adversarial Online Learning with Changing Action Sets: Efficient Algorithms with Approximate Regret Bounds ALT 2021