conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2,192 papers

Papers per year

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

Papers

Scalable and Efficient Non-adaptive Deterministic Group Testing NIPS 2022
Better Best of Both Worlds Bounds for Bandits with Switching Costs NIPS 2022
Sequential Information Design: Learning to Persuade in the Dark NIPS 2022
Training Subset Selection for Weak Supervision NIPS 2022
Optimistic Mirror Descent Either Converges to Nash or to Strong Coarse Correlated Equilibria in Bimatrix Games NIPS 2022
Non-stationary Bandits with Knapsacks NIPS 2022
Active Labeling: Streaming Stochastic Gradients NIPS 2022
Multi-Fidelity Best-Arm Identification NIPS 2022
On Elimination Strategies for Bandit Fixed-Confidence Identification NIPS 2022
An $\alpha$-No-Regret Algorithm For Graphical Bilinear Bandits NIPS 2022
Dynamic Pricing with Monotonicity Constraint under Unknown Parametric Demand Model NIPS 2022
Non-monotonic Resource Utilization in the Bandits with Knapsacks Problem NIPS 2022
Online Frank-Wolfe with Arbitrary Delays NIPS 2022
Lipschitz Bandits with Batched Feedback NIPS 2022
Efficient Frameworks for Generalized Low-Rank Matrix Bandit Problems NIPS 2022
Algorithms with Prediction Portfolios NIPS 2022
Non-Stationary Bandits under Recharging Payoffs: Improved Planning with Sublinear Regret NIPS 2022
Dynamic Learning in Large Matching Markets NIPS 2022
Pessimism for Offline Linear Contextual Bandits using $\ell_p$ Confidence Sets NIPS 2022
Discrete-Convex-Analysis-Based Framework for Warm-Starting Algorithms with Predictions NIPS 2022
Leveraging the Hints: Adaptive Bidding in Repeated First-Price Auctions NIPS 2022
An Analysis of Ensemble Sampling NIPS 2022
Uplifting Bandits NIPS 2022
Collaborative Linear Bandits with Adversarial Agents: Near-Optimal Regret Bounds NIPS 2022
Adaptive Oracle-Efficient Online Learning NIPS 2022