← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Statistical Inference and A/B Testing for First-Price Pacing Equilibria ICML 2023
Best of Both Worlds in Online Control: Competitive Ratio and Policy Regret L4DC 2023
Linear Stochastic Bandits over a Bit-Constrained Channel L4DC 2023
Multiplier Bootstrap-based Exploration ICML 2023
Delegated Online Search IJCAI 2023
Bandits with Knapsacks: Advice on Time-Varying Demands ICML 2023
Communication-Constrained Bandits under Additive Gaussian Noise ICML 2023
Optimal Arms Identification with Knapsacks ICML 2023
Stochastic Gradient Succeeds for Bandits ICML 2023
Is Consensus Acceleration Possible in Decentralized Optimization over Slowly Time-Varying Networks? ICML 2023
Adversarial Contention Resolution Games IJCAI 2023
Logarithmic regret in communicating MDPs: Leveraging known dynamics with bandits ACML 2023
Semi-Parametric Contextual Pricing Algorithm using Cox Proportional Hazards Model ICML 2023
Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints ICML 2023
Learning to Bid in Repeated First-Price Auctions with Budgets ICML 2023
Dynamical Linear Bandits ICML 2023
A Framework for Adapting Offline Algorithms to Solve Combinatorial Multi-Armed Bandit Problems with Bandit Feedback ICML 2023
Federated Online and Bandit Convex Optimization ICML 2023
Speed-Oblivious Online Scheduling: Knowing (Precise) Speeds is not Necessary ICML 2023
Levin Tree Search with Context Models IJCAI 2023
BARA: Efficient Incentive Mechanism with Online Reward Budget Allocation in Cross-Silo Federated Learning IJCAI 2023
Online Algorithms with Costly Predictions AISTATS 2023
An Information-Theoretic Analysis of Nonstationary Bandit Learning ICML 2023
Tight Regret Bounds for Single-pass Streaming Multi-armed Bandits ICML 2023
Simulation-Assisted Optimization for Large-Scale Evacuation Planning with Congestion-Dependent Delays IJCAI 2023