← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

A Batch-to-Online Transformation under Random-Order Model NIPS 2023
Bypassing the Simulator: Near-Optimal Adversarial Linear Contextual Bandits NIPS 2023
Multiplier Bootstrap-based Exploration ICML 2023
Dynamical Linear Bandits ICML 2023
Online List Labeling with Predictions NIPS 2023
A One-Size-Fits-All Approach to Improving Randomness in Paper Assignment NIPS 2023
Improved Algorithms for Maximum Satisfiability and Its Special Cases AAAI 2023
Proportionally Fair Online Allocation of Public Goods with Predictions IJCAI 2023
Kullback-Leibler Maillard Sampling for Multi-armed Bandits with Bounded Rewards NIPS 2023
Adversarial Contention Resolution Games IJCAI 2023
Experimental Designs for Heteroskedastic Variance NIPS 2023
Information-guided Planning: An Online Approach for Partially Observable Problems NIPS 2023
Is Consensus Acceleration Possible in Decentralized Optimization over Slowly Time-Varying Networks? ICML 2023
Stochastic Gradient Succeeds for Bandits ICML 2023
EvolveMT: an Ensemble MT Engine Improving Itself with Usage Only ACL 2023
Riemannian Projection-free Online Learning NIPS 2023
Communication-Constrained Bandits under Additive Gaussian Noise ICML 2023
Energy-Efficient Scheduling with Predictions NIPS 2023
Bandits with Knapsacks: Advice on Time-Varying Demands ICML 2023
Fast and Regret Optimal Best Arm Identification: Fundamental Limits and Low-Complexity Algorithms NIPS 2023
Online Ad Procurement in Non-stationary Autobidding Worlds NIPS 2023
Optimal Arms Identification with Knapsacks ICML 2023
Efficient Rate Optimal Regret for Adversarial Contextual MDPs Using Online Function Approximation ICML 2023
Regret Minimization and Convergence to Equilibria in General-sum Markov Games ICML 2023
Bandit Online Linear Optimization with Hints and Queries ICML 2023