conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2,192 papers

Papers per year

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

Papers

Asymptotically Optimal Quantile Pure Exploration for Infinite-Armed Bandits NIPS 2023
Fully Dynamic $k$-Clustering in $\tilde O(k)$ Update Time NIPS 2023
Nearest Neighbour with Bandit Feedback NIPS 2023
Online Inventory Problems: Beyond the i.i.d. Setting with Online Convex Optimization NIPS 2023
A Combinatorial Algorithm for Approximating the Optimal Transport in the Parallel and MPC Settings NIPS 2023
Learning and Collusion in Multi-unit Auctions NIPS 2023
Cascading Contextual Assortment Bandits NIPS 2023
Blocked Collaborative Bandits: Online Collaborative Filtering with Per-Item Budget Constraints NIPS 2023
Efficient Online Clustering with Moving Costs NIPS 2023
Asynchronous Proportional Response Dynamics: Convergence in Markets with Adversarial Scheduling NIPS 2023
Online Convex Optimization with Unbounded Memory NIPS 2023
Sorting with Predictions NIPS 2023
Polynomial-Time Linear-Swap Regret Minimization in Imperfect-Information Sequential Games NIPS 2023
Anytime Model Selection in Linear Bandits NIPS 2023
Non-Convex Bilevel Optimization with Time-Varying Objective Functions NIPS 2023
Online Pricing for Multi-User Multi-Item Markets NIPS 2023
Online (Multinomial) Logistic Bandit: Improved Regret and Constant Computation Cost NIPS 2023
Improved Best-of-Both-Worlds Guarantees for Multi-Armed Bandits: FTRL with General Regularizers and Multiple Optimal Arms NIPS 2023
Logarithmic-Regret Quantum Learning Algorithms for Zero-Sum Games NIPS 2023
Multi-Fidelity Multi-Armed Bandits Revisited NIPS 2023
Non-stationary Experimental Design under Linear Trends NIPS 2023
CLIP-OGD: An Experimental Design for Adaptive Neyman Allocation in Sequential Experiments NIPS 2023
An active learning framework for multi-group mean estimation NIPS 2023
On Private and Robust Bandits NIPS 2023
Adaptive Algorithms for Relaxed Pareto Set Identification NIPS 2023